Data Packet Routing

#include <bits/stdc++.h>

using namespace std;

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

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

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: TIME LIMIT EXCEEDED

Test 4

Verdict: TIME LIMIT EXCEEDED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED