oj.uz

Submission #815911

# Submission time Handle Problem Language Result Execution time Memory
815911 2023-08-09T02:24:31 Z blackyuki Dungeons Game (IOI21_dungeons) C++17
100 / 100
 4588 ms 261272 KB 
#include "dungeons.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<bool> vb;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define REP(i,k,n) for(ll i=(ll)(k);i<(ll)(n);i++)
#define all(a) a.begin(),a.end()
#define fi first
#define se second
#define pb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
const ll inf=1001001001001001001;

ll mx=10000005,B=2000,lg=24,n;
vi s,p,w,l,dp;
vector<vector<PP>> table;
void init(int n_, std::vector<int> s_, std::vector<int> p_, std::vector<int> w_, std::vector<int> l_) {
	n=n_;
	for(ll x:s_)s.pb(x);
	for(ll x:p_)p.pb(x);
	for(ll x:w_)w.pb(x);
	for(ll x:l_)l.pb(x);
	table=vector<vector<PP>>(lg,vector<PP>(n,PP(n,-1,-1)));
	rep(i,n){
		if(s[i]>B)table[0][i]=PP(l[i],p[i],s[i]);
		else table[0][i]=PP(w[i],s[i],inf);
	}
	rep(i,lg-1)rep(j,n)if(get<0>(table[i][j])!=n){
		get<0>(table[i+1][j])=get<0>(table[i][get<0>(table[i][j])]);
		get<1>(table[i+1][j])=get<1>(table[i][j])+get<1>(table[i][get<0>(table[i][j])]);
		get<2>(table[i+1][j])=min(get<2>(table[i][j]),get<2>(table[i][get<0>(table[i][j])])-get<1>(table[i][j]));
	}
	dp=vi(n+1);
	for(ll i=n-1;i>=0;i--)dp[i]=dp[w[i]]+s[i];
}

long long simulate(int x, int z) {
	ll curx=x,curz=z;
	while(curx<n&&curz<B){
		if(s[curx]<=curz){
			curz+=s[curx];curx=w[curx];
		}
		else{
			curz+=p[curx];curx=l[curx];
		}
	}
	if(curx==n)return curz;
	while(curx<n&&curz<mx){
		for(ll i=lg-1;i>=0;i--)if(get<0>(table[i][curx])<n&&curz<get<2>(table[i][curx])){
			curz+=get<1>(table[i][curx]);
			curx=get<0>(table[i][curx]);
		}
		if(s[curx]<=curz){
			curz+=s[curx];curx=w[curx];
		}
		else{
			curz+=p[curx];curx=l[curx];
		}
	}
	return dp[curx]+curz;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 1492 KB Output is correct
4 Correct 34 ms 32856 KB Output is correct
5 Correct 2 ms 1492 KB Output is correct
6 Correct 34 ms 32848 KB Output is correct

Subtask #2
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 328 ms 261064 KB Output is correct
3 Correct 320 ms 261080 KB Output is correct
4 Correct 332 ms 261108 KB Output is correct
5 Correct 311 ms 261144 KB Output is correct
6 Correct 372 ms 261128 KB Output is correct
7 Correct 399 ms 261120 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 852 KB Output is correct
2 Correct 99 ms 33592 KB Output is correct
3 Correct 67 ms 33624 KB Output is correct
4 Correct 58 ms 33680 KB Output is correct
5 Correct 61 ms 33624 KB Output is correct
6 Correct 86 ms 33720 KB Output is correct
7 Correct 180 ms 33620 KB Output is correct
8 Correct 79 ms 33620 KB Output is correct
9 Correct 57 ms 33624 KB Output is correct
10 Correct 94 ms 33688 KB Output is correct
11 Correct 963 ms 33668 KB Output is correct
12 Correct 1073 ms 34388 KB Output is correct
13 Correct 297 ms 34384 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 852 KB Output is correct
2 Correct 99 ms 33592 KB Output is correct
3 Correct 67 ms 33624 KB Output is correct
4 Correct 58 ms 33680 KB Output is correct
5 Correct 61 ms 33624 KB Output is correct
6 Correct 86 ms 33720 KB Output is correct
7 Correct 180 ms 33620 KB Output is correct
8 Correct 79 ms 33620 KB Output is correct
9 Correct 57 ms 33624 KB Output is correct
10 Correct 94 ms 33688 KB Output is correct
11 Correct 963 ms 33668 KB Output is correct
12 Correct 1073 ms 34388 KB Output is correct
13 Correct 297 ms 34384 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 62 ms 34412 KB Output is correct
16 Correct 79 ms 34420 KB Output is correct
17 Correct 64 ms 34244 KB Output is correct
18 Correct 63 ms 34360 KB Output is correct
19 Correct 94 ms 34400 KB Output is correct
20 Correct 96 ms 34412 KB Output is correct
21 Correct 62 ms 34324 KB Output is correct
22 Correct 343 ms 34372 KB Output is correct
23 Correct 1345 ms 34456 KB Output is correct
24 Correct 379 ms 34384 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 852 KB Output is correct
2 Correct 99 ms 33592 KB Output is correct
3 Correct 67 ms 33624 KB Output is correct
4 Correct 58 ms 33680 KB Output is correct
5 Correct 61 ms 33624 KB Output is correct
6 Correct 86 ms 33720 KB Output is correct
7 Correct 180 ms 33620 KB Output is correct
8 Correct 79 ms 33620 KB Output is correct
9 Correct 57 ms 33624 KB Output is correct
10 Correct 94 ms 33688 KB Output is correct
11 Correct 963 ms 33668 KB Output is correct
12 Correct 1073 ms 34388 KB Output is correct
13 Correct 297 ms 34384 KB Output is correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 62 ms 34412 KB Output is correct
16 Correct 79 ms 34420 KB Output is correct
17 Correct 64 ms 34244 KB Output is correct
18 Correct 63 ms 34360 KB Output is correct
19 Correct 94 ms 34400 KB Output is correct
20 Correct 96 ms 34412 KB Output is correct
21 Correct 62 ms 34324 KB Output is correct
22 Correct 343 ms 34372 KB Output is correct
23 Correct 1345 ms 34456 KB Output is correct
24 Correct 379 ms 34384 KB Output is correct
25 Correct 37 ms 33588 KB Output is correct
26 Correct 78 ms 34472 KB Output is correct
27 Correct 91 ms 34408 KB Output is correct
28 Correct 77 ms 34384 KB Output is correct
29 Correct 82 ms 34384 KB Output is correct
30 Correct 104 ms 34384 KB Output is correct
31 Correct 143 ms 34304 KB Output is correct
32 Correct 290 ms 34384 KB Output is correct
33 Correct 234 ms 34384 KB Output is correct
34 Correct 521 ms 34372 KB Output is correct
35 Correct 1410 ms 34384 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 328 ms 261064 KB Output is correct
3 Correct 320 ms 261080 KB Output is correct
4 Correct 332 ms 261108 KB Output is correct
5 Correct 311 ms 261144 KB Output is correct
6 Correct 372 ms 261128 KB Output is correct
7 Correct 399 ms 261120 KB Output is correct
8 Correct 1 ms 852 KB Output is correct
9 Correct 99 ms 33592 KB Output is correct
10 Correct 67 ms 33624 KB Output is correct
11 Correct 58 ms 33680 KB Output is correct
12 Correct 61 ms 33624 KB Output is correct
13 Correct 86 ms 33720 KB Output is correct
14 Correct 180 ms 33620 KB Output is correct
15 Correct 79 ms 33620 KB Output is correct
16 Correct 57 ms 33624 KB Output is correct
17 Correct 94 ms 33688 KB Output is correct
18 Correct 963 ms 33668 KB Output is correct
19 Correct 1073 ms 34388 KB Output is correct
20 Correct 297 ms 34384 KB Output is correct
21 Correct 1 ms 980 KB Output is correct
22 Correct 62 ms 34412 KB Output is correct
23 Correct 79 ms 34420 KB Output is correct
24 Correct 64 ms 34244 KB Output is correct
25 Correct 63 ms 34360 KB Output is correct
26 Correct 94 ms 34400 KB Output is correct
27 Correct 96 ms 34412 KB Output is correct
28 Correct 62 ms 34324 KB Output is correct
29 Correct 343 ms 34372 KB Output is correct
30 Correct 1345 ms 34456 KB Output is correct
31 Correct 379 ms 34384 KB Output is correct
32 Correct 37 ms 33588 KB Output is correct
33 Correct 78 ms 34472 KB Output is correct
34 Correct 91 ms 34408 KB Output is correct
35 Correct 77 ms 34384 KB Output is correct
36 Correct 82 ms 34384 KB Output is correct
37 Correct 104 ms 34384 KB Output is correct
38 Correct 143 ms 34304 KB Output is correct
39 Correct 290 ms 34384 KB Output is correct
40 Correct 234 ms 34384 KB Output is correct
41 Correct 521 ms 34372 KB Output is correct
42 Correct 1410 ms 34384 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 980 KB Output is correct
45 Correct 357 ms 261272 KB Output is correct
46 Correct 324 ms 261156 KB Output is correct
47 Correct 306 ms 261232 KB Output is correct
48 Correct 363 ms 261156 KB Output is correct
49 Correct 356 ms 261252 KB Output is correct
50 Correct 400 ms 261172 KB Output is correct
51 Correct 301 ms 261264 KB Output is correct
52 Correct 372 ms 261176 KB Output is correct
53 Correct 1006 ms 261264 KB Output is correct
54 Correct 847 ms 261160 KB Output is correct
55 Correct 1291 ms 261228 KB Output is correct
56 Correct 4588 ms 261172 KB Output is correct
57 Correct 3180 ms 261160 KB Output is correct
58 Correct 2155 ms 261208 KB Output is correct
59 Correct 1986 ms 261264 KB Output is correct
60 Correct 2919 ms 261164 KB Output is correct
61 Correct 2962 ms 261256 KB Output is correct