# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
728350 | 2023-04-22T09:09:51 Z | NeroZein | Dreaming (IOI13_dreaming) | C++17 | 22 ms | 2772 KB |
#include "dreaming.h" #include <bits/stdc++.h> using namespace std; const int NN = 3003; int a[NN], b[NN], t[NN]; vector<pair<int, int>> g[NN]; int vis[NN]; int far[NN]; int travelTime(int N, int M, int L, int A[], int B[], int T[]) { int n, m, l; n = N, m = M, l = L; for (int i = 0; i < m; ++i) { a[i] = A[i]; b[i] = B[i]; t[i] = T[i]; } int mx2 = 0, mx = 0; for (int i = 0; i < m; ++i) { mx2 = max(mx2, T[i]); if (mx2 > mx) { swap(mx, mx2); } } int ans = max(mx + l, mx2 + 2 * l); return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 22 ms | 2772 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 22 ms | 2772 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 8 ms | 1364 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 22 ms | 2772 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |