| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1202769 | AMel0n | Game (IOI14_game) | C++20 | 179 ms | 7084 KiB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,N) for(ll i = 0; i < N; i++)
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
#include "game.h"
void initialize(int n) {
;
}
int bruh[1505];
int hasEdge(int u, int v) {
return (u > v ? ++bruh[u] == u : ++bruh[v] == v);
}
// signed main() {
// cin.tie(0); ios::sync_with_stdio(false);
// }| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
