제출 #991680

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
991680		wood	던전 (IOI21_dungeons)	C++17	0 / 100	7091 ms	26660 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 = w; S::l = l;
}

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

#ifdef WIN32
int main()
{
    fast_cin();
    freopen("input.in", "r", stdin);
    freopen("input.out", "w", stdout);
    int n,q; cin>>n>>q;
    vi s,p,w,l;
    for(int i = 0; i<n; i++){
        int x; cin>>x;
        s.pb(x);
    }
    for(int i = 0; i<n; i++){
        int x; cin>>x;
        p.pb(x);
    }
    for(int i = 0; i<n; i++){
        int x; cin>>x;
        w.pb(x);
    }
    for(int i = 0; i<n; i++){
        int x; cin>>x;
        l.pb(x);
    }
    init(n,s,p,w,l);
    for (size_t i = 0; i < q; i++)
    {
        int x,z; cin>>x>>z;
        cout<<simulate(x,z);
    }
    
    return 0;
}
#endif 

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