| Task: | Data Packet Routing |
| Sender: | Oispa nutellaa |
| Submission time: | 2018-05-26 14:38:34 +0300 |
| Language: | C++ |
| Status: | READY |
| Result: | TIME LIMIT EXCEEDED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.01 s | details |
| #2 | ACCEPTED | 0.84 s | details |
| #3 | TIME LIMIT EXCEEDED | -- | details |
| #4 | ACCEPTED | 0.88 s | details |
| #5 | ACCEPTED | 0.08 s | details |
| #6 | ACCEPTED | 0.04 s | details |
| #7 | ACCEPTED | 0.03 s | details |
| #8 | ACCEPTED | 0.01 s | details |
| #9 | ACCEPTED | 0.01 s | details |
Compiler report
input/code.cpp: In function 'int main()':
input/code.cpp:21:4: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
if(!boo)
^~
input/code.cpp:23:5: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
boo = true;
^~~Code
#include <bits/stdc++.h>
#define ull unsigned long long
using namespace std;
int t, n, m, x, y;
map<pair<int,int>, int> mp;
int main() {
cin >> t;
for(int g=0; g<t; g++) {
cin >> n >> m;
bool boo = false;
for(int i=0; i<m; i++) {
cin >> x >> y;
mp[make_pair(x, y)]++;
}
for(auto it = mp.begin(); it!=mp.end(); it++) {
if(it->second>=2) {
if(!boo)
cout << 2 << "\n";
boo = true;
break;
}
}
mp.clear();
if(!boo)
cout << 1 << "\n";
}
}
Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 2 10 3 1 2 2 1 3 4 ... |
| correct output |
|---|
| 1 2 |
| user output |
|---|
| 1 2 |
Test 2
Verdict: ACCEPTED
| input |
|---|
| 10 400 100000 292 392 33 131 61 254 ... |
| correct output |
|---|
| 2 2 2 2 2 ... |
| user output |
|---|
| 2 2 2 2 2 ... |
Test 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 10 700 100000 603 318 570 280 374 589 ... |
| correct output |
|---|
| 2 2 2 2 2 ... |
| user output |
|---|
| (empty) |
Test 4
Verdict: ACCEPTED
| input |
|---|
| 10 1000 100000 612 150 630 797 925 44 ... |
| correct output |
|---|
| 2 2 2 2 2 ... |
| user output |
|---|
| 2 2 2 2 2 ... |
Test 5
Verdict: ACCEPTED
| input |
|---|
| 10 1000 10000 25 713 450 653 659 325 ... |
| correct output |
|---|
| 2 2 2 2 2 ... |
| user output |
|---|
| 2 2 2 2 2 ... |
Test 6
Verdict: ACCEPTED
| input |
|---|
| 10 1000 3000 804 754 634 483 331 476 ... |
| correct output |
|---|
| 2 2 2 2 2 ... |
| user output |
|---|
| 2 2 2 2 2 ... |
Test 7
Verdict: ACCEPTED
| input |
|---|
| 10 1000 1000 529 538 501 784 783 645 ... |
| correct output |
|---|
| 2 2 2 2 2 ... |
| user output |
|---|
| 2 2 2 2 2 ... |
Test 8
Verdict: ACCEPTED
| input |
|---|
| 10 1000 300 602 710 622 952 254 471 ... |
| correct output |
|---|
| 1 2 2 1 1 ... |
| user output |
|---|
| 1 2 2 1 1 ... |
Test 9
Verdict: ACCEPTED
| input |
|---|
| 10 1000 100 295 836 509 67 436 838 ... |
| correct output |
|---|
| 1 1 1 1 1 ... |
| user output |
|---|
| 1 1 1 1 1 ... |
