Data Packet Routing

#include <bits/stdc++.h>

using namespace std;

int tt[1010][1010];

void test(int ti) {
	int n, m;
	cin >> n >> m;
	int res = 1;
	for (int i = 0; i < m; i++) {
		int x, y;
		cin >> x >> y;
		if(tt[x][y]==ti)res=2;
		tt[x][y]=ti;
		//pair<int, int> p{x, y};
		/*if (s.count(p)) {
			res = 2;
		}*/
		//s[i] = p;
	}
	cout << res << "\n";
}

int main() {
	int t;
	cin >> t;
	while(t--) test(t+1000);
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED