제출 #1345006

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1345006		akqxolotl	던전 (IOI21_dungeons)	C++20	0 / 100	1 ms	580 KiB

dungeons

#include "dungeons.h"
#include <vector>
//Segment Tree is a State of Mind
#include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr<<#x<<" is "<<x<<endl;
#define debugp(x,y) cerr<<#x<<' '<<#y<<" is "<<x<<' '<<y<<endl;
#define debugl(x) cerr<<#x<<" is ";for(auto p:x)cerr<<p<<" ";cerr<<endl;
#define debugpl(x) cerr<<#x<<" is ";for(auto p:x)cerr<<p.first<<" "<<p.second<<" , ";cerr<<endl;

//#define int long long
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef pair<int,pii> ipii;
#define pb push_back
#define fi first
#define se second
#define sz(x) (int)(x).size()
#define rdint(x,y) rnd()%(y-x+1)+x

const int inf=4e18+5;
const int mod=1e9+7;
const int mod2=998244353;
const int mod3=1e9+9;
const int maxn=5e4+5;

vi ss,pp,ww,ll;
int nn,ts;
int par[maxn][24];
int ps[maxn][24];
int d[maxn];//dis from end

void dcmp(){
	for(int k=1;k<24;k++){
		for(int i=0;i<nn;i++){
			par[i][k]=par[par[i][k-1]][k-1];
			ps[i][k]=ps[i][k-1]+ps[par[i][k-1]][k-1];
		}
	}
}

pii bsta(int x,int z){
	for(int k=23;k>=0;k--){
		if(par[x][k]!=nn&&z+ps[x][k]<ts){
			z+=ps[x][k];
			x=par[x][k];
		}
	}
	return {par[x][0],z+ps[x][0]};
}

vi adj[maxn];

void dfs(int x){
	d[x]=d[ww[x]]+1;
	for(auto i:adj[x])dfs(i);
}

void init(int n, std::vector<int> s, std::vector<int> p, std::vector<int> w, std::vector<int> l) {
	ss=s;
	ts=s[0];
	pp=p;
	ww=w;
	ll=l;
	nn=n;
	for(int i=0;i<n;i++){
		par[i][0]=l[i];
		ps[i][0]=p[i];
	}
	for(int i=0;i<n;i++){
		adj[w[i]].pb(i);
	}
	dcmp();
	for(auto i:adj[n])dfs(i);
	return;
}

long long simulate(int x, int z) {
	auto [nx,nz]=bsta(x,z);
	//debugp(nx,nz)
	//debug(d[nx])
	return nz+d[nx]*ts;
}

컴파일 시 표준 에러 (stderr) 메시지

dungeons.cpp:21:19: warning: overflow in conversion from 'double' to 'int' changes value from '4.0e+18' to '2147483647' [-Woverflow]
   21 | const int inf=4e18+5;
      |               ~~~~^~

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