제출 #799934

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
799934		boris_mihov	던전 (IOI21_dungeons)	C++17	11 / 100	7100 ms	26664 KiB

dungeons

#include "dungeons.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>

typedef long long llong;
const int MAXN = 400000 + 10;
const int INF  = 1e9;

int n;
int win[MAXN];
int lose[MAXN];
int loseUPD[MAXN];
int strenght[MAXN];

void init(int N, std::vector<int> s, std::vector<int> p, std::vector<int> w, std::vector<int> l) 
{
    n = N;
    for (int i = 1 ; i <= n ; ++i)
    {
        win[i] = w[i - 1] + 1;
        lose[i] = l[i - 1] + 1;
        strenght[i] = s[i - 1];
        loseUPD[i] = p[i - 1];
    }
}

llong simulate(int x, int z) 
{
    x++;
    llong s = z;
    while (x <= n)
    {
        if (s >= strenght[x])
        {
            s += strenght[x];
            x = win[x];
        } else
        {
            s += loseUPD[x];
            x = lose[x];
        }
    }

	return s;
}

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