# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
930603 |
2024-02-20T07:42:52 Z |
dimashhh |
Game (IOI14_game) |
C++17 |
|
29 ms |
101212 KB |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 12, MOD = 998244353;
typedef long long ll;
#include "game.h"
int _n;
//int read_int() {
// int x;
// assert(scanf("%d", &x) == 1);
// return x;
//}
set<int> g[N];
int p[N];
void initialize(int n) {
_n = n;
for(int i = 0;i < n;i++){
p[i] = i;
}
for(int i = 0;i < n;i++){
p[i] = i;
for(int j = 0;j < n;j++){
g[i].insert(j);
}
}
}
int col[N];
int get(int v){
if(p[v] == v) return v;
return p[v] = get(p[v]);
}
void merge(int a,int b){
a = get(a);
b = get(b);
p[a] = b;
}
pair<int,int> blocked;
int vis[N],timer = 0,ct = 0;
void dfs(int v){
vis[v] = timer;
ct++;
for(int to:g[v]){
pair<int,int> f = {v,to};
if(f == blocked) continue;
if(make_pair(f.second,f.first) == blocked) continue;
if(vis[to] == timer) continue;
dfs(to);
}
}
int hasEdge(int u, int v) {
u = get(u);
v = get(v);
if (u == v) return 0;
if(u > v) swap(u,v);
blocked = {u,v};
++timer;
ct = 0;
dfs(1);
if(ct != _n){
merge(u,v);
return 1;
}
g[v].erase(u);
g[u].erase(v);
return 0;
}
//int main() {
// int n, u, v;
// n = read_int();
// initialize(n);
// for (int i = 0; i < n * (n - 1) / 2; i++) {
// u = read_int();
// v = read_int();
// if (hasEdge(u, v)) {
// puts("1");
// }
// else puts("0");
// }
// return 0;
//}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
29 ms |
100948 KB |
Output is correct |
2 |
Correct |
25 ms |
100956 KB |
Output is correct |
3 |
Correct |
25 ms |
100796 KB |
Output is correct |
4 |
Incorrect |
24 ms |
100956 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
25 ms |
100956 KB |
Output is correct |
2 |
Correct |
25 ms |
101208 KB |
Output is correct |
3 |
Correct |
24 ms |
100956 KB |
Output is correct |
4 |
Incorrect |
23 ms |
100956 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
24 ms |
100956 KB |
Output is correct |
2 |
Correct |
24 ms |
100952 KB |
Output is correct |
3 |
Correct |
25 ms |
100956 KB |
Output is correct |
4 |
Incorrect |
25 ms |
101212 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |