제출 #706397

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
706397		jamezzz	철로 (IOI14_rail)	C++17	30 / 100	109 ms	624 KiB

rail

#include "rail.h"
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(),x.end()
typedef pair<int,int> ii;

#define maxn 1005

int dist[maxn];
vector<int> stuff[maxn];
vector<ii> v,l,r;

void findLocation(int N,int first,int location[],int stype[]){
	location[0]=first;stype[0]=1;
	for(int i=1;i<N;++i){
		location[i]=-1;
		dist[i]=getDistance(0,i);
		v.pb({dist[i],i});
	}
	sort(all(v),greater<ii>());
	//printf("v: ");
	//for(auto[a,b]:v)printf("(%d %d) ",a,b);
	//printf("\n");
	
	int second=v.back().se;
	location[second]=first+dist[second];
	stype[second]=2;
	v.pop_back();
	
	while(!v.empty()){
		auto[d,x]=v.back();
		v.pop_back();
		if(dist[x]==dist[second]+getDistance(second,x))l.pb({d,x});
		else r.pb({d,x});
	}
	//printf("l: ");
	//for(auto[a,b]:l)printf("(%d %d) ",a,b);
	//printf("\n");
	//printf("r: ");
	//for(auto[a,b]:r)printf("(%d %d) ",a,b);
	//printf("\n");
	
	int pv=-1;
	for(int i=0;i<r.size();++i){
		//printf("%d: %d %d, pv=%d\n",i,r[i].fi,r[i].se,pv);
		auto[_,x]=r[i];
		if(pv==-1){
			location[x]=first+dist[x];
			stype[x]=2;
			pv=x;
			continue;
		}
		int tmp=getDistance(pv,x);
		if(dist[x]==dist[pv]+tmp){
			location[x]=location[pv]-tmp;
			stype[x]=1;
		}
		else{
			int extra=(dist[pv]+tmp-dist[x])/2;
			bool found=false;
			//printf("extra %d\n",extra);
			for(int i=0;i<N;++i){
				if(location[i]!=-1&&location[i]==location[pv]-extra){
					//printf("found: %d\n",i);
					found=true;
					if(stype[i]==1){
						location[x]=first+dist[x];
						stype[x]=2;
						pv=x;
					}
					else{
						location[x]=location[pv]-tmp;
						stype[x]=1;
					}
					break;
				}
			}
			if(!found){
				location[x]=first+dist[x];
				stype[x]=2;
				pv=x;
			}
		}
	}
	
	pv=-1;
	for(int i=0;i<l.size();++i){
		//printf("%d: %d %d, pv=%d\n",i,l[i].fi,l[i].se,pv);
		auto[_,x]=l[i];
		if(pv==-1){
			location[x]=location[second]-dist[x]+dist[second];
			stype[x]=1;
			pv=x;
			continue;
		}
		int tmp=getDistance(pv,x);
		if(dist[x]==dist[pv]+tmp){
			location[x]=location[pv]+tmp;
			stype[x]=2;
		}
		else{
			int extra=(dist[pv]+tmp-dist[x])/2;
			//printf("extra %d (%d+%d-%d)/2\n",extra,dist[pv],tmp,dist[x]);
			bool found=false;
			for(int i=0;i<N;++i){
				if(location[i]!=-1&&location[i]==location[pv]+extra){
					//printf("found: %d\n",i);
					found=true;
					if(stype[i]==1){
						location[x]=location[pv]+tmp;
						stype[x]=2;
						pv=x;
					}
					else{
						location[x]=location[second]-dist[x]+dist[second];
						stype[x]=1;
						pv=x;
					}
					break;
				}
			}
			if(!found){
				location[x]=location[second]-dist[x]+dist[second];
				stype[x]=1;
				pv=x;
			}
		}
	}
	
	//printf("ans:\n");
	//for(int i=0;i<N;++i)printf("%d ",location[i]);printf("\n");
	//for(int i=0;i<N;++i)printf("%d ",stype[i]);printf("\n");
}

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

rail.cpp: In function 'void findLocation(int, int, int*, int*)':
rail.cpp:48:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |  for(int i=0;i<r.size();++i){
      |              ~^~~~~~~~~
rail.cpp:91:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |  for(int i=0;i<l.size();++i){
      |              ~^~~~~~~~~

• Subtask 1: 8 / 8
• Subtask 2: 22 / 22
• Subtask 3: 0 / 26
• Subtask 4: 0 / 44