oj.uz

답안 #121219

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
121219 2019-06-26T08:16:23 Z Rudy420 철로 (IOI14_rail) C++17
100 / 100
 80 ms 760 KB 
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define ll long long
#define pi pair<int,int>
#define pl pair<ll,ll>
#define pd pair<double,double>
#define ld long double
#define pld pair<ld,ld>
#define lg length()
#define sz size()
#define vi vector<int>
#define vl vector<ll>
#define vp vector<pi>
#define vpl vector<pl>
#define pb push_back
#define INF 1000000005
#define LINF 1000000000000000005
#ifdef LOCAL_DEFINE
    mt19937 rng(69);
#else
    seed_seq seq{
        (uint64_t) chrono::duration_cast<chrono::nanoseconds>(chrono::high_resolution_clock::now().time_since_epoch()).count(),
        //(uint64_t) __builtin_ia32_rdtsc(),
        //(uint64_t) (uintptr_t) make_unique<char>().get()
    };
    mt19937 rng(seq);
#endif

#include "rail.h"


void findLocation(int n, int x, int p[], int t[])
{
    if(n==1){
        p[0]=x; t[0]=1;
        return;
    }
    int a[n+5],b[n+5];
    for(int i=1;i<n;i++) a[i]=getDistance(0,i);
    int mn=INF,y=-1;
    for(int i=1;i<n;i++){
        if(a[i]<mn) mn=a[i],y=i;
    }
    for(int i=0;i<n;i++){
        if(i==y) continue;
        b[i]=getDistance(y,i);
    }
    mn=INF;
	int z=-1;
    for(int i=0;i<n;i++){
    	if(i==y) continue;
        if(b[i]<mn) mn=b[i],z=i;
    }
    int diff=b[z]-a[y];
    p[z]=x-diff;
    p[y]=p[z]+b[z];
    t[z]=1;
    t[y]=2;
    for(int i=0;i<n;i++){
        a[i]+=diff;
    }
    vector <pi> l,r;
	vector <int> u,v;
    for(int i=0;i<n;i++){
        if(i==y || i==z) continue;
        if(i==0) a[i]=2*(p[y]-p[z])-diff;
        if(a[i]>b[i]) l.pb({b[i],i});
        else r.pb({a[i],i});
    }
    
	sort(l.begin(),l.end());
	u.pb(p[z]);
	int f=z;
	for(pi i : l){
		int d=getDistance(i.y,f);
		p[i.y]=p[f]+d;
		if(p[i.y]>=p[z]){
			p[i.y]=p[y]-b[i.y];
			t[i.y]=1;
			u.pb(p[i.y]);
			f=i.y;
		}
		int c=*(lower_bound(u.begin(),u.end(),p[i.y],greater<int>()));
		if(b[i.y]==p[i.y]+p[y]-2*c && p[i.y]!=c){
			t[i.y]=2;
		}
		else{
			p[i.y]=p[y]-b[i.y];
			t[i.y]=1;
			u.pb(p[i.y]);
			f=i.y;
		}
	}
	
	sort(r.begin(),r.end());
	v.pb(p[y]);
	f=y;
	for(pi i : r){
		int d=getDistance(i.y,f);
		p[i.y]=p[f]-d;
		if(p[i.y]<=p[y]){
			p[i.y]=p[z]+a[i.y];
			t[i.y]=2;
			v.pb(p[i.y]);
			f=i.y;
		}
		int c=*(lower_bound(v.begin(),v.end(),p[i.y]));
		if(a[i.y]==2*c-p[i.y]-p[z] && p[i.y]!=c){
			t[i.y]=1;
		}
		else{
			p[i.y]=p[z]+a[i.y];
			t[i.y]=2;
			v.pb(p[i.y]);
			f=i.y;
		}
	}
}

Subtask #1
8.0 / 8.0

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

Subtask #2
22.0 / 22.0

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

Subtask #3
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 75 ms 632 KB Output is correct
2 Correct 71 ms 504 KB Output is correct
3 Correct 79 ms 640 KB Output is correct
4 Correct 72 ms 632 KB Output is correct
5 Correct 72 ms 632 KB Output is correct
6 Correct 70 ms 632 KB Output is correct
7 Correct 76 ms 636 KB Output is correct
8 Correct 70 ms 636 KB Output is correct
9 Correct 73 ms 596 KB Output is correct
10 Correct 76 ms 552 KB Output is correct

Subtask #4
44.0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 640 KB Output is correct
2 Correct 74 ms 632 KB Output is correct
3 Correct 73 ms 676 KB Output is correct
4 Correct 74 ms 632 KB Output is correct
5 Correct 77 ms 632 KB Output is correct
6 Correct 76 ms 632 KB Output is correct
7 Correct 78 ms 632 KB Output is correct
8 Correct 75 ms 632 KB Output is correct
9 Correct 80 ms 760 KB Output is correct
10 Correct 75 ms 636 KB Output is correct
11 Correct 76 ms 504 KB Output is correct
12 Correct 74 ms 504 KB Output is correct
13 Correct 72 ms 596 KB Output is correct
14 Correct 72 ms 504 KB Output is correct
15 Correct 71 ms 600 KB Output is correct
16 Correct 75 ms 632 KB Output is correct
17 Correct 72 ms 632 KB Output is correct
18 Correct 69 ms 504 KB Output is correct
19 Correct 72 ms 632 KB Output is correct
20 Correct 73 ms 504 KB Output is correct