| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 933313 |
2024-02-25T12:54:19 Z |
SmuggingSpun |
Game (IOI14_game) |
C++14 |
|
3 ms |
11244 KB |
#include "game.h"
#include<bits/stdc++.h>
using namespace std;
const int lim = 1505;
int p[lim], sz[lim], cnt[lim][lim];
int find_set(int n){
return n == p[n] ? n : p[n] = find_set(p[n]);
}
void merge(int a, int b){
if((a = find_set(a)) != (b = find_set(b))){
if(sz[a] < sz[b]){
swap(a, b);
}
sz[p[b] = a] += sz[b];
}
}
void initialize(int n){
iota(p, p + n, 0);
fill(sz, sz + n, 1);
memset(cnt, 0, sizeof(cnt));
}
int hasEdge(int u, int v){
if(sz[u = find_set(u)] * sz[v = find_set(v)] - 1 == cnt[u][v]){
merge(u, v);
return 1;
}
cnt[u][v]++;
cnt[v][u]++;
return 0;
}
Compilation message
game.cpp: In function 'int hasEdge(int, int)':
game.cpp:23:32: warning: operation on 'v' may be undefined [-Wsequence-point]
23 | if(sz[u = find_set(u)] * sz[v = find_set(v)] - 1 == cnt[u][v]){
| ~~^~~~~~~~~~~~~
game.cpp:23:32: warning: operation on 'v' may be undefined [-Wsequence-point]
game.cpp:23:10: warning: operation on 'u' may be undefined [-Wsequence-point]
23 | if(sz[u = find_set(u)] * sz[v = find_set(v)] - 1 == cnt[u][v]){
| ~~^~~~~~~~~~~~~
game.cpp:23:10: warning: operation on 'u' may be undefined [-Wsequence-point]
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
10840 KB |
Output is correct |
| 2 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 3 |
Correct |
2 ms |
10680 KB |
Output is correct |
| 4 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 5 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 6 |
Correct |
2 ms |
10680 KB |
Output is correct |
| 7 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 8 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 9 |
Correct |
2 ms |
10840 KB |
Output is correct |
| 10 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 11 |
Correct |
2 ms |
10868 KB |
Output is correct |
| 12 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 13 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 14 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 15 |
Correct |
2 ms |
10876 KB |
Output is correct |
| 16 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 17 |
Correct |
3 ms |
10840 KB |
Output is correct |
| 18 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 19 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 20 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 21 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 22 |
Correct |
2 ms |
11244 KB |
Output is correct |
| 23 |
Correct |
3 ms |
10844 KB |
Output is correct |
| 24 |
Correct |
2 ms |
10840 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 2 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 3 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 4 |
Correct |
2 ms |
10840 KB |
Output is correct |
| 5 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 6 |
Correct |
2 ms |
10840 KB |
Output is correct |
| 7 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 8 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 9 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 10 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 11 |
Correct |
2 ms |
10840 KB |
Output is correct |
| 12 |
Correct |
2 ms |
10840 KB |
Output is correct |
| 13 |
Correct |
2 ms |
10840 KB |
Output is correct |
| 14 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 15 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 16 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 17 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 18 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 19 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 20 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 21 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 22 |
Correct |
1 ms |
10844 KB |
Output is correct |
| 23 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 24 |
Correct |
3 ms |
10844 KB |
Output is correct |
| 25 |
Incorrect |
3 ms |
10996 KB |
Output isn't correct |
| 26 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
10840 KB |
Output is correct |
| 2 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 3 |
Correct |
2 ms |
10840 KB |
Output is correct |
| 4 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 5 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 6 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 7 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 8 |
Correct |
2 ms |
10684 KB |
Output is correct |
| 9 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 10 |
Correct |
2 ms |
10680 KB |
Output is correct |
| 11 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 12 |
Correct |
2 ms |
10684 KB |
Output is correct |
| 13 |
Correct |
2 ms |
10840 KB |
Output is correct |
| 14 |
Correct |
1 ms |
10844 KB |
Output is correct |
| 15 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 16 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 17 |
Correct |
2 ms |
10840 KB |
Output is correct |
| 18 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 19 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 20 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 21 |
Correct |
2 ms |
10840 KB |
Output is correct |
| 22 |
Correct |
2 ms |
10876 KB |
Output is correct |
| 23 |
Correct |
2 ms |
10840 KB |
Output is correct |
| 24 |
Correct |
2 ms |
10844 KB |
Output is correct |
| 25 |
Incorrect |
2 ms |
10844 KB |
Output isn't correct |
| 26 |
Halted |
0 ms |
0 KB |
- |
