oj.uz

Submission #1045964

# Submission time Handle Problem Language Result Execution time Memory
1045964 2024-08-06T08:46:10 Z Unforgettablepl Dungeons Game (IOI21_dungeons) C++17
0 / 100
 1 ms 860 KB 
#include "dungeons.h"
#include <bits/stdc++.h>
using namespace std;

const int INF = 1e8;

vector<int> s,p,w,l;
vector<vector<int>> lift;
vector<vector<long long>> liftcost;
vector<long long> bestans;
int n;

void init(int n,vector<int> s,vector<int> p,vector<int> w,vector<int> l){
	::n=n;
	::s=s;
	::p=p;
	::w=w;
	::l=l;
	lift = vector(n+1,vector(24,0));
	liftcost = vector(n+1,vector(24,0ll));
	bestans = vector(n+1,0ll);
	for(int i=n-1;i>=0;i--){
		bestans[i]=bestans[w[i]]+s[i];
		lift[i][0] = l[i];
		liftcost[i][0] = p[i];
	}
	liftcost[n][0]=INF;
	lift[n][0]=n;
	for(int bit=1;bit<24;bit++){
		for(int i=0;i<=n;i++){
			lift[i][bit]=lift[lift[i][bit-1]][bit-1];
			liftcost[i][bit]=liftcost[i][bit-1]+liftcost[lift[i][bit-1]][bit-1];
		}
	}
	return;
}

long long simulate(int x,int z){
	for(int bit=23;bit>=0;bit--){
		if(z+liftcost[x][bit]<s[0]){
			z+=liftcost[x][bit];
			x=lift[x][bit];
		}
	}
	if(x==n)return z;
	z+=liftcost[x][0];
	x = lift[x][0];
	return z+bestans[x];
}

Subtask #1
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 860 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 860 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 860 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 860 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 860 KB Output isn't correct
2 Halted 0 ms 0 KB -