| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1290087 | hssaan_arif | Game (IOI14_game) | C++20 | 1 ms | 568 KiB |
#include <bits/stdc++.h>
#include "game.h"
using namespace std;
#define endl "\n"
#define pb push_back
// #define int long long
#define fi first
#define se second
const int N = 2e3 + 5, M = 1e9 + 7, LG = 20;
int cnt[N] , n , k;
void initialize(int m) {
n = m;
}
int hasEdge(int u, int v) {
cnt[u]++;
cnt[v]++;
if (cnt[u] == n-1 || cnt[v] == n-1){
return 1;
}else {
if (k == ((n*(n-1))/2) - (n-1)){
return 1;
}
k++;
return 0;
}
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
