제출 #438432

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
438432	2021-06-28 02:13:23	mango_lassi	Dungeons Game (IOI21_dungeons)	C++17	100 / 100	5064 ms	707556 KiB

dungeons

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "dungeons.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 4 * (int)1e5;
const int C0 = 8;
const int C1 = 1;
const int H = 24;
const ll INF = 1e9 + 7;
pair<int, pair<ll, ll>> jmp[N + 1][H / C0][H / C1];
ll add[N + 1];
ll str[N + 1];
ll bns[N + 1];
int wt[N + 1];
int lt[N + 1];
int n;
pair<int, ll> advance(pair<int, ll> cur) {
  if (str[cur.first] > cur.second) return {lt[cur.first], bns[cur.first] + cur.second};
  else return {wt[cur.first], str[cur.first] + cur.second};
}
void init(int n_, vector<int> s, vector<int> p, vector<int> w, vector<int> l) {
  n = n_;
  for (int i = 0; i < n; ++i) str[i] = s[i];
  for (int i = 0; i < n; ++i) bns[i] = p[i];
  for (int i = 0; i < n; ++i) wt[i] = w[i];
  for (int i = 0; i < n; ++i) lt[i] = l[i];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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