Submission #744159

#	Time	Username	Problem	Language	Result	Execution time	Memory
744159		myrcella	Dungeons Game (IOI21_dungeons)	C++17	11 / 100	7066 ms	32928 KiB

dungeons

//by szh
#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define ll long long
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}

#include "dungeons.h"

const int maxn = 4e5+10;

int nn;
ll ss[maxn],pp[maxn],ww[maxn],lr[maxn];

void init(int N, std::vector<int> S, std::vector<int> P, std::vector<int> W, std::vector<int> L) {
	nn = N;
	rep(i,0,nn) ss[i] = S[i], pp[i] = P[i], ww[i] = W[i], lr[i] = L[i];
	return;
}

long long simulate(int x, int z) {
	ll Z = z;
	while (x!=nn) {
		if (Z >= ss[x]) Z += ss[x], x = ww[x];
		else Z += pp[x], x = lr[x];
	}
	return Z;
}

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