| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1321549 | tsetsenbileg | 게임 (IOI14_game) | C++20 | 1 ms | 332 KiB |
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
using pr = pair<int, int>;
const int INF = 1e9+7, MOD = 1e9+7;
vector<int> cnt;
vector<bool> root;
int rootcnt = 0;
int n;
void initialize(int N) {
n = N;
cnt.assign(n, 0);
// root.assign(n, 0);
}
int hasEdge(int a, int b) {
cnt[a]++; cnt[b]++;
int mx = max(cnt[a], cnt[b]);
if (mx > n-1) mx = min(cnt[a], cnt[b]);
if (max(cnt[a], cnt[b]) == n-1) return 1;
else 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... | ||||
