Submission #760783

#	Time	Username	Problem	Language	Result	Execution time	Memory
760783		tolbi	Dungeons Game (IOI21_dungeons)	C++17	0 / 100	1775 ms	2097152 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<int32_t> s,p,w,l;
int n;
vector<vector<vector<int>>> st;
vector<vector<vector<int>>> val;
set<int> ele;
map<int,int> mp;
const int LOG = 60;
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;
	for (int i = 0; i < s.size(); ++i)
	{
		ele.insert(s[i]);
	}
	ele.insert(0);
	int ind = 0;
	vector<int> revmp;
	for (auto it : ele){
		mp[it]=ind++;
		revmp.push_back(it);
	}
	st.resize(ind,vector<vector<int>>(n,vector<int>(LOG,-1)));
	val.resize(ind,vector<vector<int>>(n,vector<int>(LOG,-1)));
	for (int i = 0; i < st.size(); i++){
		for (int j = 0; j < n-1; j++){
			if (s[j]<=revmp[i]){
				st[i][j][0]=w[j];
				val[i][j][0]=s[j];
			}
			else {
				st[i][j][0]=l[j];
				val[i][j][0]=p[j];
			}
		}
		for (int bit = 1; bit < LOG; bit++){
			for (int node = 0; node < n; node++){
				if (st[i][node][bit-1]==-1) continue;
				st[i][node][bit]=st[i][st[i][node][bit-1]][bit-1];
				val[i][node][bit]=val[i][node][bit-1]+val[i][st[i][node][bit-1]][bit-1];
				if (i<st.size()-1 && val[i][node][bit]>=revmp[i+1]-revmp[i]){
					st[i][node][bit]=val[i][node][bit]=-1;
				}
			}
		}
	}
}
int bk(int x){
	auto it = ele.lower_bound(x+1);
	it--;
	return *it;
}
int sonr(int x){
	auto it = ele.lower_bound(x+1);
	if (it==ele.end()) return INF;
	return *it;
}
bool overf(int a, int b){
	return (b>(INF-a));
}
int64_t simulate(int32_t x, int32_t z) {
	int cur = mp[bk(z)];
	int cc = sonr(z);
	for (int bit = LOG-1; bit >= 0; bit--){
		if (st[cur][x][bit]==-1) continue;
		if (!overf(val[cur][x][bit],z) && val[cur][x][bit]+z<cc){
			z+=val[cur][x][bit];
			x=st[cur][x][bit];
		}
	}
	if (x==n-1) return z;
	if (z>=s[x]){
		z+=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 'void init(int32_t, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
dungeons.cpp:41:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |  for (int i = 0; i < s.size(); ++i)
      |                  ~~^~~~~~~~~~
dungeons.cpp:54:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::vector<std::vector<long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |  for (int i = 0; i < st.size(); i++){
      |                  ~~^~~~~~~~~~~
dungeons.cpp:70:10: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::vector<std::vector<long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |     if (i<st.size()-1 && val[i][node][bit]>=revmp[i+1]-revmp[i]){
      |         ~^~~~~~~~~~~~

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