Submission #1009523

#	Time	Username	Problem	Language	Result	Execution time	Memory
1009523		mindiyak	Dungeons Game (IOI21_dungeons)	C++17	11 / 100	7073 ms	53504 KiB

dungeons

#include "dungeons.h"
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<int, int> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvl;
typedef vector<ld> vd;
typedef vector<long long> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1000000007;

vi S,P,W,L;
vl adding,minimum,loop_counter;
vvl loop_ends,loop_sums;
int N;


void dfs(int start,int pos,ll sum,set<int> visited,int counter){
	sum += P[pos];
	loop_ends[start].pb(pos);
	loop_sums[start].pb(sum);
	counter++;
	if(visited.count(pos))return;
	visited.insert(pos);
	dfs(start,L[pos],sum,visited,counter);
}


void init(int n, std::vector<int> s, std::vector<int> p, std::vector<int> w, std::vector<int> l) {
	S = s;
	P = p;
	W = w;
	L = l;
	N = n;
	adding = vl(n+1,-1);
	adding[n] = 0;
	minimum = vl(n+1,0);
	minimum[n] = 0;
	loop_counter = vl(n+1,-1);
	loop_ends = vvl(n+1,vl());
	loop_sums = vvl(n+1,vl());
	for(int i = n-1;i>=0;i--){
		adding[i] = adding[W[i]] + s[i];
		minimum[i] = max(ll(s[i]),ll(minimum[W[i]]));
	}

	// FOR(i,0,n){
	// 	set<int> vis;
	// 	dfs(i,i,0,vis,0);
	// }


	// cout << "################" << endl;

	// for(int a:adding)cout << a << " ";
	// cout << endl;	
	// for(int a:minimum)cout << a << " ";
	// cout << endl;	
	
	// FOR(i,0,n){
	// 	cout << i << " -> " << endl;
	// 	for(int a:loop_ends[i])cout << a << " ";
	// 	cout << endl;	
	// 	for(int a:loop_sums[i])cout << a << " ";
	// 	cout << endl;
	// 	cout << endl;	
	// }

	// cout << "################" << endl;
}

long long simulate(int x, int z) {
	if(x == N)return z;

	if(z >= minimum[x])return z+adding[x];
	if(z < S[x]){

		return simulate(L[x],z+P[x]);
	}
	return simulate(W[x],z+S[x]);
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 26
• Subtask 3: 0 / 13
• Subtask 4: 0 / 12
• Subtask 5: 0 / 27
• Subtask 6: 0 / 11