# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
719632 |
2023-04-06T12:05:10 Z |
Toxtaq |
Game (IOI14_game) |
C++17 |
|
1 ms |
308 KB |
#include<bits/stdc++.h>
#include "game.h"
using namespace std;
int n;
vector<int>degrees;
void initialize(int N) {
n = N;
degrees.resize(n);
}
int hasEdge(int u, int v) {
degrees[u]++;
degrees[v]++;
if(degrees[u] >= n - 1 || degrees[v] >= n - 1){
return 1;
}
return 0;
}
//int main()
//{
// int cnt = 0;
// int n;
// cin >> n;
// initialize(n);
// for(int i = 0;i < n;++i){
// for(int j = i + 1;j < n;++j){
// cout << "(" << i << ", " << j << "): " << hasEdge(i, j) << '\n';
// }
// }
//}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
308 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
308 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |