Submission #1271308

#	Time	Username	Problem	Language	Result	Execution time	Memory
1271308		nerrrmin	던전 (IOI21_dungeons)	C++20	11 / 100	7094 ms	19780 KiB

dungeons

#include "dungeons.h"
#include <vector>
using namespace std;
int nn;
vector < int > a, b;
vector < int > win, lose;
void init(int n, std::vector<int> s, std::vector<int> p, std::vector<int> w, std::vector<int> l) {
    nn = n;
    a.resize(n, 0);
    b.resize(n, 0);
    for (int i = 0; i < nn; ++ i)
        a[i] = s[i];
    for (int i = 0; i < nn; ++ i)
        b[i] = p[i];
    win.resize(n, 0);
    lose.resize(n, 0);
    for (int i = 0; i < nn; ++ i)
        win[i] = w[i];
    for (int i = 0; i < nn; ++ i)
        lose[i] = l[i];
	return;
}
long long rec(long long pos, long long s)
{
    if(pos == nn)return s;
    if(s >= a[pos])return rec(win[pos], s+a[pos]);
    else return rec(lose[pos], s+b[pos]);
}
long long simulate(int x, int z)
{

	return rec(x, z);
}

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