oj.uz

Submission #914592

# Submission time Handle Problem Language Result Execution time Memory
914592 2024-01-22T11:08:52 Z Wansur Dungeons Game (IOI21_dungeons) C++17
0 / 100
 7000 ms 263584 KB 
#include<bits/stdc++.h>
#define ent '\n'

typedef long long ll;
using namespace std;
const int mx=4e5+12;

vector<int> A,B,C,D;
int up[21][mx];
ll ma[21][mx];
ll sum[21][mx];
int N,m,k;

void init(int M, vector<int> s, vector<int> p, vector<int> w, vector<int> l){
	N=M;
	A=s,B=p;
	C=w,D=l;
	s.push_back(0);
	s.push_back(0);
	for(int k=0;k<20;k++){
		up[k][N]=up[k][N+1]=N+1;
	}
	for(int i=N-1;i>=0;i--){
		up[0][i]=w[i];
		ma[0][i]=s[i];
		sum[0][i]=s[i];
		for(int k=1;k<20;k++){
			up[k][i]=up[k-1][up[k-1][i]];
			ma[k][i]=max(ma[k-1][i],ma[k-1][up[k-1][i]]);
			sum[k][i]=sum[k-1][i]+sum[k-1][up[k-1][i]];
		}
	}
}

long long simulate(int pos, int d){
	int n=N;
	ll x=d;
	vector<int> s=A,p=B,w=C,l=D;
	int cnt=0;
	ll prev=x;
	while(pos<n){
		cnt++;
		for(int k=19;k>=0;k--){
			if(up[k][pos]<=n && ma[k][pos]<=x){
				x+=sum[k][pos];
				pos=up[k][pos];
			}
		}
		if(pos==n)break;
		if(s[pos]<=x){
			x+=s[pos];
			pos=w[pos];
		}
		else{
			x+=p[pos];
			pos=l[pos];
		}
		if(prev*2-100>x)assert(0);
	}
	return x;
}

Subtask #1
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 110976 KB Output is correct
2 Correct 16 ms 111192 KB Output is correct
3 Correct 17 ms 111196 KB Output is correct
4 Runtime error 163 ms 263584 KB Execution killed with signal 6
5 Halted 0 ms 0 KB -

Subtask #2
0.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 111196 KB Output is correct
2 Execution timed out 7044 ms 182868 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 122 ms 225444 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 122 ms 225444 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 27.0

# Verdict Execution time Memory Grader output
1 Runtime error 122 ms 225444 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 111196 KB Output is correct
2 Execution timed out 7044 ms 182868 KB Time limit exceeded
3 Halted 0 ms 0 KB -