답안 #725379

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
725379 2023-04-17T11:02:10 Z SanguineChameleon 게임 (APIO22_game) C++17
컴파일 오류
0 ms 0 KB
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
 
const int maxN = 3e5 + 20;
int block;
int max_in[maxN];
int min_out[maxN];
vector<int> adj1[maxN];
vector<int> adj2[maxN];
bool done = false;
int n, k;
 
void init(int _n, int _k) {
	n = _n;
	k = _k;
	block = 1;
	for (int i = 0; i < k; i++) {
		max_in[i] = i - 1;
		min_out[i] = i;
	}
	for (int i = k; i < n; i++) {
		max_in[i] = -1;
		min_out[i] = k;
	}
}

void update_in(int u, int val);
void update_out(int u, int val);

void update_in(int u, int val) {
	if (done) {
		return;
	}
	if (val <= max_in[u]) {
		return;
	}
	bool diff = (max_in[u] / block) < (val / block);
	bool same = (max_in[u] / block) == (min_out[u] / block);
	max_in[u] = val;
	if (max_in[u] >= min_out[u]) {
		done = true;
		return;
	}
	if (diff || same) {
		for (auto v: adj1[u]) {
			update_in(v, max_in[u]);
		}
		for (auto v: adj2[u]) {
			update_out(v, min_out[u]);
		}
	}
}
 
void update_out(int u, int val) {
	if (done) {
		return;
	}
	if (val >= min_out[u]) {
		return;
	}
	bool update = ((min_out[u] / block) > (val / block) || (max_in[u] / block) == (min_out[u] / block));
	min_out[u] = val;
	if (max_in[u] >= min_out[u]) {
		done = true;
		return;
	}
	if (diff || same) {
		for (auto v: adj1[u]) {
			update_in(v, max_in[u]);
		}
		for (auto v: adj2[u]) {
			update_out(v, min_out[u]);
		}
	}
}
 
int add_teleporter(int u, int v) {
	update_in(v, max(max_in[u], (u < k ? u : -1)));
	update_out(u, min_out[v]);
	adj1[u].push_back(v);
	adj2[v].push_back(u);
	return done;
}

Compilation message

game.cpp: In function 'void update_out(int, int)':
game.cpp:68:6: error: 'diff' was not declared in this scope
   68 |  if (diff || same) {
      |      ^~~~
game.cpp:68:14: error: 'same' was not declared in this scope
   68 |  if (diff || same) {
      |              ^~~~
game.cpp:62:7: warning: unused variable 'update' [-Wunused-variable]
   62 |  bool update = ((min_out[u] / block) > (val / block) || (max_in[u] / block) == (min_out[u] / block));
      |       ^~~~~~