| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1146321 | ind1v | The Ties That Guide Us (CEOI23_incursion) | C++17 | 18 ms | 1004 KiB |
#include <vector>
#include "incursion.h"
#include <cstdio>
std::vector<int> mark(std::vector<std::pair<int, int>> F, int safe) {
return {2, 2, 0};
}
void locate(std::vector<std::pair<int, int>> F, int curr, int t) {
int x;
x = visit(3);
if (x != 2) {
return;
}
x = visit(1);
if (x != 0) {
return;
}
x = visit(3);
if (x != 2) {
return;
}
x = visit(2);
if (x != 2) {
return;
}
return;
}| # | 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... | ||||
