제출 #598670

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

dungeons

#include "dungeons.h"
#include<bits/stdc++.h>
using namespace std;

const int nmax=4e5+42;

int mem_n;

vector<int> opponent_power,lose_gain,win_move,lose_move;

long long gain_only_wins[nmax];
long long lowest_only_wins[nmax];

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

	opponent_power=s;

	lose_gain=p;

	win_move=w;

	lose_move=l;

	for(int i=n-1;i>=0;i--)
    {
        gain_only_wins[i]=opponent_power[i]+gain_only_wins[win_move[i]];

        lowest_only_wins[i]=max(1LL*opponent_power[i],lowest_only_wins[win_move[i]]-opponent_power[i]);
    }
}

long long simulate(int x, int z_)
{
    long long z=z_;

    while(z<lowest_only_wins[x])
    {
        if(opponent_power[x]<=z)
        {
            z+=opponent_power[x];
            x=win_move[x];
        }
        else
        {
            z+=lose_gain[x];
            x=lose_move[x];
        }
    }

    z+=gain_only_wins[x];

    return z;
}

/*
static int n, q;
static std::vector<int> s, p, z;
static std::vector<int> w, l, x;
static std::vector<long long> answer;

int main() {
	assert(scanf("%d %d", &n, &q) == 2);
	s.resize(n);
	p.resize(n);
	w.resize(n);
	l.resize(n);
    x.resize(q);
    z.resize(q);
    answer.resize(q);

	for (int i = 0; i < n; i++) {
		assert(scanf("%d", &s[i]) == 1);
	}
	for (int i = 0; i < n; i++) {
		assert(scanf("%d", &p[i]) == 1);
	}
	for (int i = 0; i < n; i++) {
		assert(scanf("%d", &w[i]) == 1);
	}
	for (int i = 0; i < n; i++) {
		assert(scanf("%d", &l[i]) == 1);
	}


    init(n, s, p, w, l);

    for (int i = 0; i < q; i++) {
		assert(scanf("%d %d", &x[i], &z[i]) == 2);
		answer[i] = simulate(x[i], z[i]);
    }
    fclose(stdin);

    for (int i = 0; i < q; i++) {
        printf("%lld\n", answer[i]);
    }
    fclose(stdout);
    return 0;
}
*/

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