oj.uz

답안 #612314

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
612314 2022-07-29T13:00:51 Z StrawHatWess 던전 (IOI21_dungeons) C++17
37 / 100
 7000 ms 257704 KB 
#include "dungeons.h"

#include <bits/stdc++.h>
using namespace std; 

typedef long long ll;
typedef vector<int>vi; 
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x),end(x)

#define FOR(i,a,b) for(int i=a; i<b; i++)
#define ROF(i,a,b) for(int i=b-1; i>=a; i--)

//------------------------------------------------ 

const int MX=4e5+10, LOG=25; 

int N; 
vi s, p, w, l; 
ll jump[MX][LOG], jumpSum[MX][LOG], jumpMX[MX][LOG];
void init(int n, vi s, vi p, vi w, vi l) {
	N=n; 
	::s=s; ::p=p; ::w=w; ::l=l; 

	::s.pb(0); ::p.pb(0); ::w.pb(N); ::l.pb(N); 

	ROF(i,0,N+1){
		if(i==N){
			FOR(j,0,LOG) jump[i][j]=i, jumpSum[i][j]=0, jumpMX[i][j]=0; 
		}
		else{
			jump[i][0]=w[i]; jumpSum[i][0]=s[i]; jumpMX[i][0]=max(s[i], s[w[i]]); 
			FOR(j,1,LOG){
				jump[i][j]=jump[jump[i][j-1]][j-1];
				jumpSum[i][j]=jumpSum[i][j-1] + jumpSum[jump[i][j-1]][j-1];  
				jumpMX[i][j]=max(jumpMX[i][j-1], jumpMX[jump[i][j-1]][j-1]); 
			}
		}
	}

}

ll simulate(int st, int x){
	int u=st; 
	ll X=x; 
	while(1){
		if(u==N) break;

		if(X>=s[u]){
			ROF(i,0,LOG) if(jumpMX[u][i]<=X){
				X+=jumpSum[u][i]; 
				u=jump[u][i]; 
			}
			X+=jumpSum[u][0]; 
			u=jump[u][0]; 
		}
		else{
			X+=p[u]; 
			u=l[u]; 
		}
		
	}

	return X; 
}



/*

3 2
2 6 9
3 1 2
2 2 3
1 0 1
0 1
2 3

24
25



*/

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 2 ms 1620 KB Output is correct
4 Correct 62 ms 32964 KB Output is correct
5 Correct 3 ms 1620 KB Output is correct
6 Correct 67 ms 32868 KB Output is correct

Subtask #2
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 980 KB Output is correct
2 Correct 684 ms 257124 KB Output is correct
3 Correct 642 ms 256708 KB Output is correct
4 Correct 593 ms 257704 KB Output is correct
5 Correct 587 ms 257688 KB Output is correct
6 Correct 584 ms 257612 KB Output is correct
7 Correct 761 ms 256668 KB Output is correct

Subtask #3
0.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 980 KB Output is correct
2 Correct 94 ms 32704 KB Output is correct
3 Correct 105 ms 32788 KB Output is correct
4 Correct 94 ms 32716 KB Output is correct
5 Correct 77 ms 32704 KB Output is correct
6 Execution timed out 7071 ms 32796 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 980 KB Output is correct
2 Correct 94 ms 32704 KB Output is correct
3 Correct 105 ms 32788 KB Output is correct
4 Correct 94 ms 32716 KB Output is correct
5 Correct 77 ms 32704 KB Output is correct
6 Execution timed out 7071 ms 32796 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #5
0.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 980 KB Output is correct
2 Correct 94 ms 32704 KB Output is correct
3 Correct 105 ms 32788 KB Output is correct
4 Correct 94 ms 32716 KB Output is correct
5 Correct 77 ms 32704 KB Output is correct
6 Execution timed out 7071 ms 32796 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 980 KB Output is correct
2 Correct 684 ms 257124 KB Output is correct
3 Correct 642 ms 256708 KB Output is correct
4 Correct 593 ms 257704 KB Output is correct
5 Correct 587 ms 257688 KB Output is correct
6 Correct 584 ms 257612 KB Output is correct
7 Correct 761 ms 256668 KB Output is correct
8 Correct 3 ms 980 KB Output is correct
9 Correct 94 ms 32704 KB Output is correct
10 Correct 105 ms 32788 KB Output is correct
11 Correct 94 ms 32716 KB Output is correct
12 Correct 77 ms 32704 KB Output is correct
13 Execution timed out 7071 ms 32796 KB Time limit exceeded
14 Halted 0 ms 0 KB -