제출 #134972

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
134972		nxteru	철로 (IOI14_rail)	C++14	30 / 100	86 ms	776 KiB

rail

#include "rail.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
#define F first
#define S second
#define PB push_back
int mad,mic;
vector<P>p;
int h[5005];
set<int>cr,dr;
void findLocation(int n, int f, int l[], int t[]){
	l[0]=f,t[0]=1;
	cr.insert(f);
	for(int i=1;i<n;i++)p.PB(P(getDistance(0,i),i));
	sort(p.begin(),p.end());
	mad=p[0].S;
	l[p[0].S]=f+p[0].F;
	h[p[0].S]=p[0].F;
	t[p[0].S]=2;
	dr.insert(l[p[0].S]);
	for(int i=1;i<p.size();i++){
		int d=p[i].F,x=p[i].S;
		h[x]=d;
		int a=getDistance(mic,x),b=getDistance(mad,x);
		auto o=cr.upper_bound(l[mic]+a);
		if(o!=cr.begin())o--;
		if(d==f+l[mic]+a-2*(*o)&&b>h[mad]&&l[mad]-l[mic]>a){
			l[x]=l[mic]+a;
			t[x]=2;
		}else if(b>l[mad]-l[mic]&&(a!=d+f-l[mic]||a-b==2*l[p[0].S]-l[mic]-l[mad])){
			l[x]=l[mad]-b;
			t[x]=1;
		}else{
			o=dr.upper_bound(l[mad]-b);
			if(o!=dr.end()&&d==2*(*o)-f-(l[mad]-b)){
				l[x]=l[mad]-b;
				t[x]=1;
			}else{
				l[x]=l[mic]+a;
				t[x]=2;
			}
		}
		if(t[x]==1){
			cr.insert(l[x]);
			if(l[mic]>l[x])mic=x;
		}else{
			dr.insert(l[x]);
			if(l[mad]<l[x])mad=x;
		}
	}
}

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

rail.cpp: In function 'void findLocation(int, int, int*, int*)':
rail.cpp:22:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=1;i<p.size();i++){
              ~^~~~~~~~~

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