# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
933604 | 2024-02-26T01:19:14 Z | vjudge1 | Speedrun (RMI21_speedrun) | C++14 | 1 ms | 740 KB |
#include <bits/stdc++.h> #include <speedrun.h> using namespace std; void assignHints (int subtask , int N, int A[], int B[]) { setHintLen(N-1); vector<vector<int>>adj(N); for (int i = 0; i < N; i++) { adj[A[i]].push_back(B[i]); adj[B[i]].push_back(A[i]); } for (int i = 0; i < N; i++) { if (adj[A[i]].size() == 1) setHint(i, 0, 0); else continue; } } void speedrun(int subtask , int N, int start ) { bool yo = getHint(0); int jefe; if (yo) { for (int i = 0; i < N; i++) { if (i == start) continue; if (!goTo(i)) continue; jefe = i; break; } } for (int i = 0; i < N; i++) { if (i == jefe) continue; goTo(i); goTo(jefe); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 740 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | The length is too large |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | The length is too large |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 596 KB | The length is too large |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | The length is too large |
2 | Halted | 0 ms | 0 KB | - |