제출 #115409

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
115409		faustaadp	철로 (IOI14_rail)	C++17	56 / 100	2125 ms	98936 KiB

rail

#include "rail.h"
#include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
int i,d[5001][5001],cal,j;
pair<int,short int> A[5001];
vector<pair<int,int> > isi;
int pos[5050];
int tipe[5050];
int z[5050];
int mu[5050];
void findLocation(int N, int first, int location[], int stype[])
{
	//if(N>100)
	//	while(1);
	pos[0]=first;
	tipe[0]=1;
//	if(N==1)
//		return ;
	for(i=0;i<N;i++)
		for(j=i+1;j<N;j++)
		{
			d[i][j]=getDistance(i,j);
			d[j][i]=d[i][j];
		}
	for(i=0;i<N;i++)
	{
		for(j=0;j<N;j++)
			A[j]=mp(d[i][j],j);
		sort(A,A+N);
		mu[i]=A[1].se;
	//	cout<<i<<" "<<A[i][1].se<<"()\n";
	}
	for(i=0;i<N;i++)
		for(j=i+1;j<N;j++)
			if(mu[i]==j&&mu[j]==i)
				isi.pb(mp(i,j));
	for(i=0;i<isi.size();i++)
	{
		if(isi[i].fi==mu[0]||isi[i].se==mu[0])
		{
			if(isi[i].fi==mu[0])
				swap(isi[i].fi,isi[i].se);
			swap(isi[0],isi[i]);
			break;
		}
	}
	tipe[isi[0].fi]=1;
	tipe[isi[0].se]=2;

	pos[isi[0].se]=pos[0]+d[0][isi[0].se];
	pos[isi[0].fi]=pos[isi[0].se]-d[isi[0].se][isi[0].fi];
	for(i=1;i<isi.size();i++)
	{
	//	cout<<"( <3 ) "<<isi[i].fi<<" "<<isi[i].se<<"\n";
	//	x[0][pas]+
		if(d[isi[0].fi][isi[i].fi]==(d[isi[0].fi][isi[0].se]+d[isi[0].se][isi[i].fi]))
		{
			if(d[isi[0].fi][isi[i].fi]>d[isi[0].fi][isi[i].se])
				swap(isi[i].fi,isi[i].se);
			pos[isi[i].fi]=pos[isi[0].se]-d[isi[0].se][isi[i].fi];
			pos[isi[i].se]=pos[isi[i].fi]+d[isi[i].se][isi[i].fi];
		}
		else
		{
			if(d[isi[0].fi][isi[i].fi]<d[isi[0].fi][isi[i].se])
				swap(isi[i].fi,isi[i].se);
			pos[isi[i].se]=pos[isi[0].fi]+d[isi[0].fi][isi[i].se];
			pos[isi[i].fi]=pos[isi[i].se]-d[isi[i].se][isi[i].fi];
		}
		tipe[isi[i].fi]=1;
		tipe[isi[i].se]=2;
	}
	for(i=0;i<isi.size();i++)
	{
		z[isi[i].fi]=1;
		z[isi[i].se]=1;
	//	cout<<isi[i].fi<<" "<<isi[i].se<<"_\n";
	}
	for(i=0;i<isi.size();i++)
	{
		//break;
		for(j=0;j<N;j++)
		{
			if(z[j])continue;
			if(mu[j]==isi[i].se)
			{
				tipe[j]=1;
				pos[j]=pos[isi[i].se]-d[j][isi[i].se];
			}
		}
		for(j=0;j<N;j++)
		{
			if(z[j])continue;
			if(mu[j]==isi[i].fi)
			{
				tipe[j]=2;
				pos[j]=pos[isi[i].fi]+d[j][isi[i].fi];
			}
		}
		//cout<<"( <3 )\n"<<isi[i].fi<<" "<<isi[i].se<<"\n";
		//cout<<pos[isi[i].fi]<<" "<<pos[isi[i].se]<<"\n";
		//cout<<"\n";
	}
	for(i=0;i<N;i++)
	{
	//	cout<<i<<"  "<<tipe[i]<<" "<<pos[i]<<"\n";
		location[i]=pos[i];
		stype[i]=tipe[i];
	}
}	
	

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

rail.cpp: In function 'void findLocation(int, int, int*, int*)':
rail.cpp:42:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(i=0;i<isi.size();i++)
          ~^~~~~~~~~~~
rail.cpp:57:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(i=1;i<isi.size();i++)
          ~^~~~~~~~~~~
rail.cpp:78:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(i=0;i<isi.size();i++)
          ~^~~~~~~~~~~
rail.cpp:84:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(i=0;i<isi.size();i++)
          ~^~~~~~~~~~~

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