#include "speedrun.h"
#include <cstdio>
#include <vector>
using namespace std;
int n, center;
vector<int> adj[1006];
bool visited[1006];
void assign(int x, int y, int z) {
for (int i = 0; i < 10; i++) setHint(x + 1, y * 10 + i + 1, z & 1 << i ? true : false);
}
void assignSingle(int x, int y, int z) {
setHint(x + 1, y, z);
}
int get(int y) {
if (y == 2) return getHint(21);
if (y == 3) return getHint(22);
int ret = 0;
for (int i = 0; i < 10; i++) ret |= getHint(y * 10 + i + 1) << i;
return ret;
}
void move(int x) {
visited[x] = true;
goTo(x + 1);
}
void _dfs(int x, int prev = -1) {
int pv = -1;
for (auto &i: adj[x]) if (i != prev) {
if (pv == -1) assign(x, 0, i);
else assign(pv, 1, i);
pv = i;
_dfs(i, x);
}
if (pv == -1) {
assignSingle(x, 21, 1);
if (prev == -1) assign(x, 0, 1023);
else assign(x, 0, prev);
} else {
assignSingle(x, 22, 1);
if (prev == -1) assign(pv, 1, 1023);
else assign(pv, 1, prev);
}
}
void assignHints(int subtask, int n, int a[], int b[]) {
if (subtask == 2) {
::n = n;
for (int i = 1; i < n; i++) {
adj[a[i] - 1].push_back(b[i] - 1);
adj[b[i] - 1].push_back(a[i] - 1);
}
setHintLen(20);
if (n == 1) return;
for (int i = 0; i < n; i++) if ((int)adj[i].size() != 1) center = i;
for (int i = 0; i < n; i++) assign(i, 0, center);
assign(center, 1, adj[center][0]);
for (int i = 0; i < (int)adj[center].size(); i++) assign(adj[center][i], 1, adj[center][(i + 1) % (int)adj[center].size()]);
return;
}
if (subtask == 3) {
::n = n;
for (int i = 1; i < n; i++) {
adj[a[i] - 1].push_back(b[i] - 1);
adj[b[i] - 1].push_back(a[i] - 1);
}
setHintLen(20);
for (int i = 0; i < n; i++) for (int j = 0; j < 2; j++) {
if (j < (int)adj[i].size()) assign(i, j, adj[i][j]);
else assign(i, j, 1023);
}
return;
}
::n = n;
for (int i = 1; i < n; i++) {
adj[a[i] - 1].push_back(b[i] - 1);
adj[b[i] - 1].push_back(a[i] - 1);
}
setHintLen(22);
assign(0, 1, 1023);
_dfs(0);
}
void connect(int x, int y) {
adj[x].push_back(y);
adj[y].push_back(x);
}
int pv[1006];
void dfs(int x) {
visited[x] = true;
if (get(0) != 1023) connect(x, get(0));
if (get(2)) {
pv[x] = get(0);
if (get(0) != 1023) connect(x, get(0));
}
if (get(3) && pv[x] != 1023 && pv[x] != -1) {
pv[pv[x]] = get(1);
if (get(1) != 1023) connect(pv[x], get(1));
}
for (int i = 0; i < (int)adj[x].size(); i++) if (!visited[adj[x][i]]) {
goTo(adj[x][i] + 1);
dfs(adj[x][i]);
goTo(x + 1);
}
}
bool notVisited() {
for (int i = 0; i < n; i++) if (!visited[i]) return true;
return false;
}
void dfs3(int x, int prev = -1) {
for (int i = 0; i < 2; i++) if (get(i) != 1023) adj[x].push_back(get(i));
for (auto &i: adj[x]) if (i != prev) {
goTo(i + 1);
dfs3(i, x);
}
if (prev != -1) goTo(prev + 1);
}
void speedrun(int subtask, int n, int st) {
if (subtask == 2) {
::n = n;
if (n == 1) return;
st--;
visited[st] = true;
while (notVisited()) {
int a = get(0), b = get(1);
if (visited[b]) move(a);
else move(a), move(b);
}
return;
}
if (subtask == 3) {
::n = n;
dfs3(st - 1);
return;
}
::n = n;
for (int i = 0; i < n; i++) pv[i] = -1;
dfs(st - 1);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
117 ms |
676 KB |
Solution didn't visit every node |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
225 ms |
684 KB |
Output is correct |
| 2 |
Correct |
189 ms |
684 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
189 ms |
792 KB |
Output is correct |
| 2 |
Correct |
137 ms |
672 KB |
Output is correct |
| 3 |
Correct |
160 ms |
672 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
132 ms |
728 KB |
Solution didn't visit every node |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
202 ms |
720 KB |
Solution didn't visit every node |
| 2 |
Halted |
0 ms |
0 KB |
- |
