| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 64880 | MatheusLealV | Game (IOI14_game) | C++17 | 4 ms | 568 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define N 1550
using namespace std;
typedef long long ll;
int block[N], n;
vector<int> grafo[N];
int hasEdge(int u, int v)
{
if(block[u] == n - 2 || block[v] == n - 2) return 1;
block[u] ++, block[v] ++;
return 0;
}
void initialize(int N_)
{
memset(block, 0, sizeof block);
n = N_;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
