제출 #1009569

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

dungeons

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

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> tii;

#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define LSOne(s) ((s)&(-s))

ll INF=1e18+10;
int inf=1e9+10;
ll M=1e9+7;

int n;
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;
	return;
}

long long simulate(int x, int z) {
	if(x==n)return z;
	if(z<s[x])return simulate(l[x],z+p[x]);
	else return simulate(w[x],z+s[x]);
	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