Submission #1056391

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1056391	2024-08-13 09:11:00	Huseyn123	Dungeons Game (IOI21_dungeons)	C++17	11 / 100	7064 ms	1194804 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 <bits/stdc++.h> 
#include "dungeons.h"
        #pragma GCC optimize("O3,unroll-loops")
        #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#define INF LLONG_MAX
using namespace std;
typedef long long ll;
const int lgb=8;
const int lg=6;
ll st0[25][lg][400001];
ll st1[25][lg][400001];
int st2[25][lg][400001];
vector<int> S,P,W,L;
int N;
void init(int n, vector<int> s, vector<int> p, vector<int> w, vector<int> l) {
  s.push_back(0);
  N=n;
  S=s; 
  P=p; 
  W=w; 
  L=l;
  for(int i=0;i<25;i++){
    for(int z=0;z<n;z++){
      if(s[z]<(1<<i)){
        st0[i][0][z]=s[z];
        if(w[z]!=n && s[w[z]]<(1<<i)){
          st1[i][0][z]=-INF;
        }
        else{
          st1[i][0][z]=s[z]-s[w[z]];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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