-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathspy-detected.cpp
80 lines (62 loc) · 1.08 KB
/
spy-detected.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
// https://codeforces.com/problemset/problem/1512/A
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int testCases = 0;
cin >> testCases;
int vecSize = 0;
int element1 = 0, element1Count = 0;
int element2 = 0, element2Count = 0;
int oddElement = 0;
while (testCases--)
{
cin >> vecSize;
vector<int> v(vecSize);
cin >> v[0] >> v[1];
element1 = v[0];
element2 = v[1];
if (element1 == element2)
{
element1Count = 2;
element2 = 0;
}
else
{
element1Count++;
element2Count++;
}
for (int i = 2; i < vecSize; i++)
{
cin >> v[i];
if (v[i] == element1)
{
element1Count++;
}
else
{
element2 = v[i];
element2Count++;
}
}
(element1Count == 1) ? (oddElement = element1) : (oddElement = element2);
for (int i = 0; i < vecSize; i++)
{
if (v[i] == oddElement)
{
cout << (i + 1);
break;
}
}
cout << "\n";
element1 = 0;
element1Count = 0;
element2 = 0;
element2Count = 0;
oddElement = 0;
}
return 0;
}