제출 #1237198

#제출 시각아이디문제언어결과실행 시간메모리
1237198SalihSahinDungeons Game (IOI21_dungeons)C++20
11 / 100
7091 ms57400 KiB
#include "bits/stdc++.h"
#include "dungeons.h"
using namespace std;

const int inf = 2e9 + 5;
const int N = 1e6 + 5;

vector<vector<int> > nxt, add;

void init(int n, vector<int> s, vector<int> p, vector<int> w, vector<int> l){
   nxt.resize(n);
   add.resize(n);
   for(int i = 0; i < n; i++){
      nxt[i].resize(2);
      nxt[i][0] = l[i];
      nxt[i][1] = w[i];

      add[i].resize(2);
      add[i][0] = p[i];
      add[i][1] = s[i];
   }
   return;
}

long long simulate(int x, int z){
   int n = nxt.size();
   long long cur = z;

   while(x != n){
      if(cur >= add[x][1]){
         cur += add[x][1];
         x = nxt[x][1];
      }
      else{
         cur += add[x][0];
         x = nxt[x][0];
      }
   }

   return cur;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...