Tanssiaiset

input/code.cpp: In function 'std::pair<int, int> search(int)':
input/code.cpp:10:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<v.size(); i++) {
                ^
input/code.cpp: In function 'int main()':
input/code.cpp:32:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i; i<d.size(); i++) {
              ^
input/code.cpp:32:14: warning: 'i' is used uninitialized in this function [-Wuninitialized]
input/code.cpp:22:2: warning: 'i' may be used uninitialized in this function [-Wmaybe-uninitialized]
  for(int i; i<n+2; i++) {
  ^

#include <bits/stdc++.h>
 
using namespace std;
 
int n;
vector<int> v;
vector<int> d;
 
pair<int,int> search(int x) {
	for(int i=0; i<v.size(); i++) {
		if(v[i]==x) {
			return make_pair(v.size(),i);
		}
	}
	return make_pair(-1,-1);
}
 
int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(0);
	cin >> n;
	for(int i; i<n+2; i++) {
		int t; cin >> t;
		pair<int,int> x = search(t);
		v.push_back(t);
		if(x.first != -1) {
			d.push_back(x.first);
			d.push_back(x.second);
		}
	}
	sort(d.begin(), d.end());
	for(int i; i<d.size(); i++) {
		if( (i>0) && ((d[i] - d[i-1]) == 1) && (d[i] % 2 != 0)) {
			cout << v[d[i-1]] << " " << v[d[i]] << endl;
		}
	}
 
	return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2

Verdict: TIME LIMIT EXCEEDED