# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
741589 |
2023-05-14T12:21:50 Z |
Mauve |
Game (APIO22_game) |
C++17 |
|
0 ms |
208 KB |
#include "game.h"
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define INF 1e18
#define ss second
#define ff first
using namespace std;
ll n,m,k,l,r,i,j,ii,jj;
bitset<1000> C[30001],rev[30001];
void init(int n, int k){
n=n;
k=k;
for(i=0;i<k;i++)
for(j=i+1;j<k;j++){
C[i][j]=1;
rev[j][i]=1;
}
}
int add_teleporter(int u, int v){
if(u<k) C[u][v]=1;
if(v<k) rev[v][u]=1;
for(i=0;i<k;i++){
if(C[i][u]) C[i][v]=1;
if(rev[i][v]) rev[i][u]=1;
if(C[i][v] && rev[i][v]) return 1;
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Wrong Answer[1] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Wrong Answer[1] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Wrong Answer[1] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Wrong Answer[1] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
208 KB |
Wrong Answer[1] |
2 |
Halted |
0 ms |
0 KB |
- |