Submission #443537

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
443537	2021-07-10 17:32:17	JvThunder	Dungeons Game (IOI21_dungeons)	C++17	100 / 100	2796 ms	915540 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>
#define fr first
#define sc second
typedef long long ll;
using namespace std;
int bs = 5;
const int nop = 5;
const int noa = 19;
int IN = 1e9+7;
ll a[400005] = {0};
pair<int,pair<int,ll>> jump[nop][noa][400005];
int N;
vector<int> S,P,W,L; 
void init(int n, vector<int> s, vector<int> p, vector<int> w, vector<int> l) 
{
  S = s; P = p; W = w; L = l; N = n;
  S.push_back(IN);
  P.push_back(IN);
  W.push_back(n);
  L.push_back(n);
  for(int i=n-1; i>=0; i--) a[i] = a[W[i]] + S[i];
  for(int ph=0; ph<nop; ph++)
  {
    ll l = 1<<(bs*ph);
    ll r = 1<<(bs*(ph+1));
    for(int i=0; i<=n; i++) 
    {
      if ((l<S[i] && S[i]<r) || i==n) jump[ph][0][i] = {L[i], {S[i], P[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