제출 #793959

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
793959		mathematik	Dungeons Game (IOI21_dungeons)	C++17	0 / 100	7 ms	7892 KiB

dungeons

#include "dungeons.h"
#include <bits/stdc++.h>
#define ll long long
 
using namespace std;
 
int binary[25][100000][25][3];//index, +, max excluded

int safe_add(int a, int b) {
 	if (a > INT_MAX - b)
 		return INT_MAX;
 	return a + b;
}
 
int safe_sub(int a, int b) {
 	return max(a - b, 0);
}

int N;
 
void init(int n, vector<int> s, vector<int> p, vector<int> w, vector<int> l) {
	s.push_back(0);
	p.push_back(0);
	w.push_back(n);
	l.push_back(n);
	n++;

	N = n;
 
	for (int range = 0; range < 25; range++)
	{
		ll r = 1 << range;
 
		for (int i = 0; i < n; i++)
		{
			if (s[i] <= r) {
				binary[range][i][0][0] = w[i];
				binary[range][i][0][1] = s[i];
				binary[range][i][0][2] = LLONG_MAX;
			} else {
				binary[range][i][0][0] = l[i];
				binary[range][i][0][1] = p[i];
				binary[range][i][0][2] = s[i];
			}
		}
		
		for (int i = 1; i < 25; i++)
		{
			for (int ind = 0; ind < n; ind++)
			{
				int pointer = binary[range][ind][i - 1][0];
				binary[range][ind][i][0] = binary[range][pointer][i - 1][0];
				binary[range][ind][i][1] = safe_add(binary[range][ind][i - 1][1], binary[range][pointer][i - 1][1]);
				binary[range][ind][i][2] = min(binary[range][ind][i - 1][2], safe_sub(binary[range][pointer][i - 1][2], binary[range][ind][i - 1][1]));
			}
		}
	}
}
 
long long simulate(int x, int z) {
	ll t = z;
 
	for (int r = 0; r <= 24; r++)
	{
		for (int s = 24; s >= 0; s--)
		{
			while (binary[r][x][s][2] > t && x != N - 1 && binary[r][x][s][1] != INT_MAX) {
				t += binary[r][x][s][1];
				x = binary[r][x][s][0];
			}
		}
	}
	return t;
}

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

dungeons.cpp: In function 'void init(int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
dungeons.cpp:39:30: warning: overflow in conversion from 'long long int' to 'int' changes value from '9223372036854775807' to '-1' [-Woverflow]
   39 |     binary[range][i][0][2] = LLONG_MAX;
      |                              ^~~~~~~~~

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