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
#define F first
#define S second
using namespace std;
 
int v[1001][1001];
 
int solve() {
	int n, m;
	cin>>n>>m;
	int ans = 1;
	vector<pii> q(m);
	for (int i = 0; i < m; i++) {
		int a, b;
		cin>>a>>b;
		if (v[a][b]) {
			ans = 2;
		}
		v[a][b] = 1;
		q[i] = {a, b};
	}
	for (pii p : q) {
		v[p.F][p.S] = 0;
	}
	return ans;
}
 
int main () {
	cin.sync_with_stdio(false);
	cin.tie(0);
	ll t; cin >> t;
	while(t--) cout<<solve()<<endl;
}

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