oj.uz

Submission #1049937

# Submission time Handle Problem Language Result Execution time Memory
1049937 2024-08-09T06:14:16 Z Alihan_8 Dungeons Game (IOI21_dungeons) C++17
63 / 100
 2943 ms 2097152 KB 
#include "dungeons.h"
#include <vector>

#include <bits/stdc++.h>

using namespace std;

#define all(x) x.begin(), x.end()
#define ar array
#define pb push_back
#define ln '\n'
//#define int long long

using i64 = long long;

template <class F, class _S>
bool chmin(F &u, const _S &v){
    bool flag = false;
    if ( u > v ){
        u = v; flag |= true;
    }
    return flag;
}

template <class F, class _S>
bool chmax(F &u, const _S &v){
    bool flag = false;
    if ( u < v ){
        u = v; flag |= true;
    }
    return flag;
}

const i64 inf = 1e15;

const int L = 24;

const int B = 8;

vector <int> s, p, w, l;

int n;

struct Jump{
	vector <vector<i64>> U, S, need;
	
	int n, lim;
	
	Jump() {}
	
	void modify(vector <int> p, vector <int> w, int lim_){
		n = p.size(); lim = lim_;
		
		S.resize(n + 1); 
		U.resize(n + 1);
		need.resize(n + 1);
		
		for ( int i = 0; i <= n; i++ ){
			S[i].resize(L);
			U[i].resize(L);
			need[i].resize(L);
			
			if ( i == n ) continue;
			
			S[i][0] = w[i];
			U[i][0] = p[i];
			need[i][0] = (s[i] >= lim ? s[i] : inf);
		}
	
		U[n][0] = n;
		S[n][0] = inf;
		
		for ( int i = 1; i < L; i++ ){
			for ( int j = 0; j <= n; j++ ){
				U[j][i] = U[U[j][i - 1]][i - 1];
				S[j][i] = min(inf, S[j][i - 1] + S[U[j][i - 1]][i - 1]);
				need[j][i] = min(need[j][i - 1], need[U[j][i - 1]][i - 1] - S[j][i - 1]);
			}
		}
	}
	
	i64 simulate(int &u, i64 z, i64 rq){
		for ( int i = L - 1; i >= 0; i-- ){
			if ( U[u][i] == n ) continue;
			
			if ( rq == inf || (need[u][i] > z && z + S[u][i] < rq) ){
				z += S[u][i];
				u = U[u][i];
			}
		}
		
		if ( u != n && z < rq ){
			if ( s[u] <= z ){
				z += s[u];
				u = w[u];
			} else{
				z += p[u];
				u = l[u];
			}
		}
		
		return z;
	};
};

vector <Jump> A;

vector <i64> v;

void init(int n_, std::vector<int> s_, std::vector<int> p_, std::vector<int> w_, std::vector<int> l_) {
	n = n_, s = s_, p = p_, w = w_, l = l_;
	
	//~ for ( auto &u: s ) v.pb(u);
	
	v.pb(inf); v.pb(1);
	
	while ( v.back() * B <= 1e8 ){
		v.pb(v.back() * B);
	}
	
	sort(all(v));
	
	v.resize(unique(all(v)) - v.begin());
	
	for ( auto &x: v ){
		vector <int> fa(n), wh(n);
		
		for ( int i = 0; i < n; i++ ){
			if ( s[i] < x ){
				fa[i] = w[i];
				wh[i] = s[i];
			} else{
				fa[i] = l[i];
				wh[i] = p[i];
			}
		}
		
		Jump h; h.modify(fa, wh, x);
		
		A.pb(h);
	}
}

long long simulate(int x, int Z) {
	// subtask #4
	
	i64 z = Z;
	
	for ( int i = 0; i + 2 < (int)v.size(); i++ ){
		while ( (z = A[i].simulate(x, z, v[i + 1])) < v[i + 1] && x != n ){
			continue;
		}
	}
	
	z = A.back().simulate(x, z, inf);
	
	return z;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 13 ms 15452 KB Output is correct
4 Correct 471 ms 378668 KB Output is correct
5 Correct 13 ms 15452 KB Output is correct
6 Correct 482 ms 378500 KB Output is correct

Subtask #2
0.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 8028 KB Output is correct
2 Runtime error 2943 ms 2097152 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8028 KB Output is correct
2 Correct 647 ms 378524 KB Output is correct
3 Correct 641 ms 378632 KB Output is correct
4 Correct 667 ms 379616 KB Output is correct
5 Correct 659 ms 379588 KB Output is correct
6 Correct 680 ms 379676 KB Output is correct
7 Correct 596 ms 379780 KB Output is correct
8 Correct 754 ms 379400 KB Output is correct
9 Correct 585 ms 379356 KB Output is correct
10 Correct 660 ms 379316 KB Output is correct
11 Correct 778 ms 379700 KB Output is correct
12 Correct 1492 ms 379776 KB Output is correct
13 Correct 1396 ms 379768 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8028 KB Output is correct
2 Correct 647 ms 378524 KB Output is correct
3 Correct 641 ms 378632 KB Output is correct
4 Correct 667 ms 379616 KB Output is correct
5 Correct 659 ms 379588 KB Output is correct
6 Correct 680 ms 379676 KB Output is correct
7 Correct 596 ms 379780 KB Output is correct
8 Correct 754 ms 379400 KB Output is correct
9 Correct 585 ms 379356 KB Output is correct
10 Correct 660 ms 379316 KB Output is correct
11 Correct 778 ms 379700 KB Output is correct
12 Correct 1492 ms 379776 KB Output is correct
13 Correct 1396 ms 379768 KB Output is correct
14 Correct 7 ms 8028 KB Output is correct
15 Correct 623 ms 379784 KB Output is correct
16 Correct 588 ms 380016 KB Output is correct
17 Correct 620 ms 379524 KB Output is correct
18 Correct 653 ms 379564 KB Output is correct
19 Correct 638 ms 379636 KB Output is correct
20 Correct 627 ms 379436 KB Output is correct
21 Correct 649 ms 379520 KB Output is correct
22 Correct 682 ms 379524 KB Output is correct
23 Correct 763 ms 379768 KB Output is correct
24 Correct 877 ms 379776 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8028 KB Output is correct
2 Correct 647 ms 378524 KB Output is correct
3 Correct 641 ms 378632 KB Output is correct
4 Correct 667 ms 379616 KB Output is correct
5 Correct 659 ms 379588 KB Output is correct
6 Correct 680 ms 379676 KB Output is correct
7 Correct 596 ms 379780 KB Output is correct
8 Correct 754 ms 379400 KB Output is correct
9 Correct 585 ms 379356 KB Output is correct
10 Correct 660 ms 379316 KB Output is correct
11 Correct 778 ms 379700 KB Output is correct
12 Correct 1492 ms 379776 KB Output is correct
13 Correct 1396 ms 379768 KB Output is correct
14 Correct 7 ms 8028 KB Output is correct
15 Correct 623 ms 379784 KB Output is correct
16 Correct 588 ms 380016 KB Output is correct
17 Correct 620 ms 379524 KB Output is correct
18 Correct 653 ms 379564 KB Output is correct
19 Correct 638 ms 379636 KB Output is correct
20 Correct 627 ms 379436 KB Output is correct
21 Correct 649 ms 379520 KB Output is correct
22 Correct 682 ms 379524 KB Output is correct
23 Correct 763 ms 379768 KB Output is correct
24 Correct 877 ms 379776 KB Output is correct
25 Correct 422 ms 378996 KB Output is correct
26 Correct 576 ms 380272 KB Output is correct
27 Correct 532 ms 379524 KB Output is correct
28 Correct 528 ms 379764 KB Output is correct
29 Correct 588 ms 380036 KB Output is correct
30 Correct 606 ms 379656 KB Output is correct
31 Correct 681 ms 379524 KB Output is correct
32 Correct 718 ms 379268 KB Output is correct
33 Correct 676 ms 378296 KB Output is correct
34 Correct 1064 ms 378160 KB Output is correct
35 Correct 648 ms 378496 KB Output is correct

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 8028 KB Output is correct
2 Runtime error 2943 ms 2097152 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -