Data Packet Routing

#include <bits/stdc++.h>

#define ll long long
#define lll __int128
#define pii pair<int, int>
#define M 1000000007
#define N 101
#define push_back PB
using namespace std;

int solve() {
	set<pii> s;
	int n, m;
	cin>>n>>m;
	int ans = 1;
	while (m --> 0) {
		int a, b;
		cin>>a>>b;
		if (s.count({a, b})) {
			ans = 2;
		}
		s.insert({a, b});
	}
	return ans;
}

int main () {
	ll t; cin >> t;
	while(t--) cout<<solve()<<endl;
}

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