| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1357381 | kawhiet | 게임 (APIO22_game) | C++20 | 0 ms | 328 KiB |
#include <bits/stdc++.h>
#include "game.h"
using namespace std;
int n, k;
vector<vector<int>> g;
vector<set<int>> t;
void init(int _n, int _k) {
n = _n;
k = _k;
t.resize(n);
for (int i = 0; i <= k - 2; i++) {
for (int j = i + 1; j < k; j++) {
t[i].insert(j);
}
}
}
int add_teleporter(int u, int v) {
for (auto x : t[v]) {
t[u].insert(x);
}
for (int i = 0; i < k; i++) {
if (t[i].count(i)) {
return 1;
}
}
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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
