Submission #991673

#	Time	Username	Problem	Language	Result	Execution time	Memory
991673		wood	Dungeons Game (IOI21_dungeons)	C++17	0 / 100	7058 ms	348 KiB

dungeons

#include <bits/stdc++.h>  
using namespace std;
 
typedef long long ll;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define vi vector<int>
#define vp32 vector<p32>
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define MOD %1000000007
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <class T>
using Tree =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//never guess
//never debug without reviewing code
//never try adding ones or substracting them
//only step by step debug when necessay

namespace S{
    int n;
    vi s, p, w, l;
}

void init(int n, std::vector<int> s, std::vector<int> p, std::vector<int> w, std::vector<int> l) {
    S::n = n; S::s = s; S::p = p; S::w = l; S::l = l;
}

long long simulate(int x, int z) {
    ll Z = z;
    using namespace S;
    while(x!=n){
        if(Z<s[x]){
            return 0;
            x = l[x];
            Z+=s[x];
        } 
        else{
            x = w[x];
            Z+=p[x];
        } 
    }
    return Z;
}

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