oj.uz

답안 #135012

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
135012 2019-07-23T14:17:09 Z nxteru 철로 (IOI14_rail) C++14
100 / 100
 89 ms 928 KB 
#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);
		o--;
		if(b==l[mad]-*o+l[mic]+a-*o)l[x]=l[mic]+a,t[x]=2;
		else{
			o=dr.upper_bound(l[mad]-b);
			if(o!=dr.end()&&a==*o-(l[mad]-b)+*o-l[mic])l[x]=l[mad]-b,t[x]=1;
			else if(d==l[p[0].S]*2-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;
		}
	}
}

Compilation message

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.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct

Subtask #3
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 768 KB Output is correct
2 Correct 87 ms 772 KB Output is correct
3 Correct 85 ms 760 KB Output is correct
4 Correct 86 ms 732 KB Output is correct
5 Correct 87 ms 860 KB Output is correct
6 Correct 87 ms 888 KB Output is correct
7 Correct 88 ms 888 KB Output is correct
8 Correct 86 ms 888 KB Output is correct
9 Correct 86 ms 888 KB Output is correct
10 Correct 87 ms 888 KB Output is correct

Subtask #4
44.0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 88 ms 756 KB Output is correct
2 Correct 89 ms 888 KB Output is correct
3 Correct 85 ms 760 KB Output is correct
4 Correct 89 ms 760 KB Output is correct
5 Correct 85 ms 860 KB Output is correct
6 Correct 87 ms 760 KB Output is correct
7 Correct 86 ms 888 KB Output is correct
8 Correct 86 ms 860 KB Output is correct
9 Correct 86 ms 888 KB Output is correct
10 Correct 86 ms 892 KB Output is correct
11 Correct 87 ms 796 KB Output is correct
12 Correct 85 ms 888 KB Output is correct
13 Correct 88 ms 764 KB Output is correct
14 Correct 85 ms 884 KB Output is correct
15 Correct 87 ms 760 KB Output is correct
16 Correct 86 ms 760 KB Output is correct
17 Correct 86 ms 888 KB Output is correct
18 Correct 85 ms 760 KB Output is correct
19 Correct 86 ms 928 KB Output is correct
20 Correct 85 ms 888 KB Output is correct