oj.uz

Submission #991682

# Submission time Handle Problem Language Result Execution time Memory
991682 2024-06-02T19:13:44 Z wood Dungeons Game (IOI21_dungeons) C++17
11 / 100
 7000 ms 19764 KB 
#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+=p[x];
            x = l[x];
        } 
        else{
            Z+=s[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
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 13 ms 3676 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 13 ms 3520 KB Output is correct

Subtask #2
0.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Execution timed out 7087 ms 19764 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 30 ms 5072 KB Output is correct
3 Correct 2406 ms 5296 KB Output is correct
4 Correct 2771 ms 4700 KB Output is correct
5 Correct 1848 ms 4488 KB Output is correct
6 Execution timed out 7066 ms 4700 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 30 ms 5072 KB Output is correct
3 Correct 2406 ms 5296 KB Output is correct
4 Correct 2771 ms 4700 KB Output is correct
5 Correct 1848 ms 4488 KB Output is correct
6 Execution timed out 7066 ms 4700 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #5
0.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 30 ms 5072 KB Output is correct
3 Correct 2406 ms 5296 KB Output is correct
4 Correct 2771 ms 4700 KB Output is correct
5 Correct 1848 ms 4488 KB Output is correct
6 Execution timed out 7066 ms 4700 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Execution timed out 7087 ms 19764 KB Time limit exceeded
3 Halted 0 ms 0 KB -