| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1223207 | simplemind_31 | 던전 (IOI21_dungeons) | C++20 | 7091 ms | 35512 KiB |
#include "dungeons.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int N;
vector<vi> To;
//strenth,losingstrength,winignto,losingto
void init(int n,vi s,vi p,vi w,vi l) {
To.resize(N=n);
for(int i=0;i<n;i++){
To[i]={s[i],p[i],w[i],l[i]};
}
return;
}
ll simulate(int x, int z){
while(x!=N){
if(z>=To[x][0]){
z+=To[x][0];
x=To[x][2];
}else{
z+=To[x][1];
x=To[x][3];
}
}
return z;
}| # | 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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
