제출 #1103918

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1103918		epicci23	게임 (APIO22_game)	C++17	100 / 100	778 ms	36692 KiB

game

#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include "game.h"
#define SIZE 300005

using namespace std;

vector <int> vec[SIZE];
vector <int> rvec[SIZE];
int left[SIZE],right[SIZE];
queue <int> que;
int mum;

void init(int n, int k)
{
	mum=1;
	while(mum<k+2) mum<<=1;
	for(int i=0;i<k;i++) left[i]=i+1,right[i]=i+2;
	for(int i=k;i<n;i++) left[i]=0,right[i]=mum;
	for(int i=0;i<n;i++)
	{
		vec[i].clear();
		rvec[i].clear();
	}
	while(!que.empty()) que.pop();
}
bool check(int u,int v)
{
	if(right[v]<=left[u]) return true;
	if((left[v]+right[v])/2<=left[u])
	{
		left[v]=(left[v]+right[v])/2;
		que.push(v);
	}
	if(right[v]<=(left[u]+right[u])/2)
	{
		right[u]=(left[u]+right[u])/2;
		que.push(u);
	}
	return false;
}
int add_teleporter(int u, int v)
{
	vec[u].push_back(v);
	rvec[v].push_back(u);
	if(check(u,v)) return 1;
	while(!que.empty())
	{
		int x=que.front();que.pop();
		if(left[x]+1==right[x]) return 1;
		for(int i=0;i<vec[x].size();i++)
		{
			int to=vec[x][i];
			if(check(x,to)) return 1;
		}
		for(int i=0;i<rvec[x].size();i++)
		{
			int to=rvec[x][i];
			if(check(to,x)) return 1;
		}
	}
	return 0;
}

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

game.cpp: In function 'int add_teleporter(int, int)':
game.cpp:55:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |   for(int i=0;i<vec[x].size();i++)
      |               ~^~~~~~~~~~~~~~
game.cpp:60:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |   for(int i=0;i<rvec[x].size();i++)
      |               ~^~~~~~~~~~~~~~~

• Subtask 1: 2 / 2
• Subtask 2: 10 / 10
• Subtask 3: 18 / 18
• Subtask 4: 30 / 30
• Subtask 5: 40 / 40