Submission #754747

#	Time	Username	Problem	Language	Result	Execution time	Memory
754747		tolbi	Dungeons Game (IOI21_dungeons)	C++17	0 / 100	1 ms	596 KiB

dungeons

#pragma optimize("Bismillahirrahmanirrahim")
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//Allahuekber
//ahmet23 orz...
//FatihSultanMehmedHan
//YavuzSultanSelimHan
//AbdulHamidHan
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
#define author tolbi
#include<bits/stdc++.h>
using namespace std;
template<typename T> vector<int32_t> normalize(vector<T> &rt){vector<int32_t> arr(rt.size());for (int i = 0; i < rt.size(); i++){arr[i]=rt[i];}return arr;}
#define endl '\n'
#define int long long
#define vint(x) vector<int> x
#define cinarr(x) for (auto &it : x) cin>>it;
#define coutarr(x) for (auto &it : x) cout<<it<<" ";cout<<endl;
#define sortarr(x) sort(x.begin(), x.end())
#define sortrarr(x) sort(x.rbegin(), x.rend())
#define rev(x) reverse(x.begin(), x.end())
#define deci(x) int x;cin>>x;
#define decstr(x) string x;cin>>x;
#define tol(bi) (1LL<<((int)(bi)))
#define lsb(x) (x&-x)
const int MOD = 1e9+7;
const int64_t INF = LONG_LONG_MAX;
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
#include "dungeons.h"
vector<vector<int>> st;
vector<vector<int>> stc;
map<int,vector<vector<int>>> stm;
map<int,vector<vector<int>>> stcm;
vector<int32_t> s,p,w,l;
int n, LOG;
vector<int> par;
vector<int> uzk;
void init(int32_t _n, vector<int32_t> _s, vector<int32_t> _p, vector<int32_t> _w, vector<int32_t> _l) {
	n=_n+1;
	s=_s,p=_p,w=_w,l=_l;
	par.resize(n);
	iota(par.begin(), par.end(), 0);
	uzk.resize(n,0);
	LOG=30;
}
int find(int node){
	if (par[node]==node) return node;
	find(par[node]);
	uzk[node]=uzk[par[node]]+uzk[node];
	par[node]=find(par[node]);
}
int64_t simulate(int32_t x, int32_t z) {
	if (x==n-1) return z;
	if (find(x)!=x){
		z+=uzk[x];
		x=find(x);
	}
	if (z>=s[x]){
		z+=s[x];
		par[x]=w[x];
		uzk[x]=s[x];
		x=w[x];
	}
	else {
		z+=p[x];
		x=l[x];
	}
	return simulate(x,z);
}

Compilation message (stderr)

dungeons.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    1 | #pragma optimize("Bismillahirrahmanirrahim")
      | 
dungeons.cpp: In function 'long long int find(long long int)':
dungeons.cpp:51:11: warning: control reaches end of non-void function [-Wreturn-type]
   51 |  par[node]=find(par[node]);

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