# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
727726 |
2023-04-21T07:54:19 Z |
AdamGS |
Tug of War (BOI15_tug) |
C++17 |
|
13 ms |
4076 KB |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=3e4+7;
vector<int>V[2*LIM], jakie[2*LIM];
int odw[LIM], T[2*LIM];
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int n, k;
cin >> n >> k;
rep(i, 2*n) {
int a, b;
cin >> a >> b >> T[i]; --a; --b;
jakie[a].pb(i);
jakie[n+b].pb(i);
}
rep(i, 2*n) if(jakie[i].size()!=2) {
cout << "NO\n";
return 0;
}
cout << "YES\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
3028 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
3028 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
3924 KB |
Output is correct |
2 |
Correct |
8 ms |
3924 KB |
Output is correct |
3 |
Correct |
7 ms |
3980 KB |
Output is correct |
4 |
Correct |
8 ms |
3916 KB |
Output is correct |
5 |
Correct |
8 ms |
4052 KB |
Output is correct |
6 |
Correct |
9 ms |
3948 KB |
Output is correct |
7 |
Correct |
13 ms |
4052 KB |
Output is correct |
8 |
Correct |
7 ms |
3948 KB |
Output is correct |
9 |
Correct |
8 ms |
4064 KB |
Output is correct |
10 |
Correct |
8 ms |
4052 KB |
Output is correct |
11 |
Correct |
7 ms |
3976 KB |
Output is correct |
12 |
Correct |
8 ms |
4048 KB |
Output is correct |
13 |
Correct |
8 ms |
4072 KB |
Output is correct |
14 |
Correct |
8 ms |
4052 KB |
Output is correct |
15 |
Correct |
7 ms |
3940 KB |
Output is correct |
16 |
Correct |
8 ms |
4052 KB |
Output is correct |
17 |
Correct |
9 ms |
4052 KB |
Output is correct |
18 |
Correct |
7 ms |
3980 KB |
Output is correct |
19 |
Correct |
8 ms |
3952 KB |
Output is correct |
20 |
Correct |
9 ms |
4076 KB |
Output is correct |
21 |
Correct |
9 ms |
3924 KB |
Output is correct |
22 |
Incorrect |
8 ms |
4052 KB |
Output isn't correct |
23 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
3028 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |