제출 #1009476

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1009476		induwara16	Dungeons Game (IOI21_dungeons)	C++17	0 / 100	7040 ms	3556 KiB

dungeons

#include "dungeons.h"
#include <bits/stdc++.h>

using namespace std;

typedef string str;
typedef vector<int> vi;

int n, sm;
vi s, p, w, l;

void init(int n1, std::vector<int> s1, std::vector<int> p1, std::vector<int> w1, std::vector<int> l1)
{
	n = n1;
	s = s1;
	p = p1;
	w = w1;
	l = l1;

	sm = *max_element(s.begin(), s.end());
}

long long solve(int x, long long z)
{
	if (z >= sm)
	{
		queue<int> q;
		q.push(x);

		while (!q.empty())
		{
			int a = q.front();
			q.pop();

			if (a != n)
			{
				z += s[0];
				q.push(w[a]);
			}
		}

		return z;
	}

	else
	{
		if (x == n)
			return z;

		if (z >= s[x])
			return solve(w[x], z + s[x]);
		else
			return solve(l[x], z + p[x]);
	}
}

long long simulate(int x, int z)
{
	return solve(x, (long long)z);
}

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