# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
623941 | 2022-08-07T03:31:30 Z | Hanksburger | 던전 (IOI21_dungeons) | C++17 | 198 ms | 242380 KB |
#include "dungeons.h" #include <bits/stdc++.h> using namespace std; pair<int, long long> par[6][25][50005]; vector<int> vec; int N; void init(int n, vector<int> s, vector<int> p, vector<int> w, vector<int> l) { N=n; vec.push_back(0); for (int i=0; i<n; i++) vec.push_back(s[i]); sort(vec.begin(), vec.end()); vec.resize(unique(vec.begin(), vec.end())-vec.begin()); for (int i=0; i<vec.size(); i++) { int num=vec[i]; for (int j=0; j<n; j++) { if (num>=s[j]) par[i][0][j]={w[j], s[j]}; else par[i][0][j]={l[j], p[j]}; } par[i][0][n]={n, 0}; for (int j=1; j<=24; j++) { for (int k=0; k<=n; k++) { int u=par[i][j-1][k].first; par[i][j][k]={par[i][j-1][u].first, par[i][j-1][k].second+par[i][j-1][u].second}; } } } } long long simulate(int x, int Z) { long long z=Z; for (int i=0; i+2<=vec.size(); i++) { if (z>=vec[i+1]) continue; for (int j=24; j>=0; j--) { if (z+par[i][j][x].second<vec[i+1]) { z+=par[i][j][x].second; x=par[i][j][x].first; } } z+=par[i][0][x].second; x=par[i][0][x].first; } int ind=vec.size()-1; for (int i=24; i>=0; i--) { if (par[ind][i][x].first!=N) { z+=par[ind][i][x].second; x=par[ind][i][x].first; } } return z+par[ind][0][x].second; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 468 KB | Output is correct |
2 | Runtime error | 5 ms | 2004 KB | Execution killed with signal 11 |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 8 ms | 6808 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 1364 KB | Output is correct |
2 | Correct | 74 ms | 42184 KB | Output is correct |
3 | Correct | 78 ms | 42080 KB | Output is correct |
4 | Correct | 84 ms | 42004 KB | Output is correct |
5 | Correct | 84 ms | 42080 KB | Output is correct |
6 | Correct | 79 ms | 42052 KB | Output is correct |
7 | Correct | 76 ms | 42108 KB | Output is correct |
8 | Correct | 66 ms | 42064 KB | Output is correct |
9 | Correct | 68 ms | 42068 KB | Output is correct |
10 | Correct | 62 ms | 42056 KB | Output is correct |
11 | Correct | 55 ms | 42060 KB | Output is correct |
12 | Correct | 145 ms | 42052 KB | Output is correct |
13 | Correct | 146 ms | 42068 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 1364 KB | Output is correct |
2 | Correct | 74 ms | 42184 KB | Output is correct |
3 | Correct | 78 ms | 42080 KB | Output is correct |
4 | Correct | 84 ms | 42004 KB | Output is correct |
5 | Correct | 84 ms | 42080 KB | Output is correct |
6 | Correct | 79 ms | 42052 KB | Output is correct |
7 | Correct | 76 ms | 42108 KB | Output is correct |
8 | Correct | 66 ms | 42064 KB | Output is correct |
9 | Correct | 68 ms | 42068 KB | Output is correct |
10 | Correct | 62 ms | 42056 KB | Output is correct |
11 | Correct | 55 ms | 42060 KB | Output is correct |
12 | Correct | 145 ms | 42052 KB | Output is correct |
13 | Correct | 146 ms | 42068 KB | Output is correct |
14 | Correct | 3 ms | 2900 KB | Output is correct |
15 | Correct | 109 ms | 81224 KB | Output is correct |
16 | Correct | 128 ms | 100824 KB | Output is correct |
17 | Correct | 106 ms | 120364 KB | Output is correct |
18 | Correct | 151 ms | 120272 KB | Output is correct |
19 | Correct | 155 ms | 120388 KB | Output is correct |
20 | Correct | 122 ms | 81160 KB | Output is correct |
21 | Correct | 141 ms | 100820 KB | Output is correct |
22 | Correct | 82 ms | 61680 KB | Output is correct |
23 | Correct | 116 ms | 100724 KB | Output is correct |
24 | Correct | 198 ms | 81256 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 1364 KB | Output is correct |
2 | Correct | 74 ms | 42184 KB | Output is correct |
3 | Correct | 78 ms | 42080 KB | Output is correct |
4 | Correct | 84 ms | 42004 KB | Output is correct |
5 | Correct | 84 ms | 42080 KB | Output is correct |
6 | Correct | 79 ms | 42052 KB | Output is correct |
7 | Correct | 76 ms | 42108 KB | Output is correct |
8 | Correct | 66 ms | 42064 KB | Output is correct |
9 | Correct | 68 ms | 42068 KB | Output is correct |
10 | Correct | 62 ms | 42056 KB | Output is correct |
11 | Correct | 55 ms | 42060 KB | Output is correct |
12 | Correct | 145 ms | 42052 KB | Output is correct |
13 | Correct | 146 ms | 42068 KB | Output is correct |
14 | Correct | 3 ms | 2900 KB | Output is correct |
15 | Correct | 109 ms | 81224 KB | Output is correct |
16 | Correct | 128 ms | 100824 KB | Output is correct |
17 | Correct | 106 ms | 120364 KB | Output is correct |
18 | Correct | 151 ms | 120272 KB | Output is correct |
19 | Correct | 155 ms | 120388 KB | Output is correct |
20 | Correct | 122 ms | 81160 KB | Output is correct |
21 | Correct | 141 ms | 100820 KB | Output is correct |
22 | Correct | 82 ms | 61680 KB | Output is correct |
23 | Correct | 116 ms | 100724 KB | Output is correct |
24 | Correct | 198 ms | 81256 KB | Output is correct |
25 | Runtime error | 168 ms | 242380 KB | Execution killed with signal 11 |
26 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 8 ms | 6808 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |