oj.uz

답안 #735235

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
735235 2023-05-03T18:16:00 Z myrcella 철로 (IOI14_rail) C++17
100 / 100
 87 ms 4556 KB 
//by szh
#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define ll long long
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}

#include "rail.h"

const int maxn = 1e6+10;;
int dis0[maxn],dis1[maxn],dis2[maxn];
int mark[maxn];

void findLocation(int N, int first, int location[], int stype[])
{
	rep(i,0,N) stype[i]=-1;
	location[0] = first;
	stype[0] = 1;
	int pos=1;
	rep(i,1,N) {
		int tmp = getDistance(i,0);
		dis0[i] = tmp;
		if (dis0[i]<dis0[pos]) pos=i;
	}
	location[pos] = first + dis0[pos];
	memset(mark,-1,sizeof(mark));
	mark[location[0]] = 1;
	stype[pos] = 2;
	debug(location[pos]);
	rep(i,0,N) {
		if (i==pos) continue;
		dis1[i] = getDistance(i,pos);
	}
	vector <pii> lft,rit;
	rep(i,1,N) if (stype[i]==-1) {
		if (dis0[i] == dis1[i] + dis1[0]) {
			if (dis1[i]<dis0[pos]) location[i] = location[pos] - dis1[i], stype[i] = 1, mark[location[i]] =1;
			else lft.pb({dis1[i],i});
		}
		else rit.pb({dis0[i],i});
	}
	sort(ALL(lft));
	int cmin = 0;
	for (auto itt:lft) {
		int it = itt.se;
		int hi = getDistance(it,cmin);
//		debug(hi);debug(dis1[it]);
		int tmp = dis1[cmin] + hi - dis1[it];
		tmp/=2;
//		debug(location[cmin]+tmp);
		if (mark[location[cmin] + tmp]==1) {
			stype[it] = 2;
			location[it] = location[cmin] + hi;
		}
		else {
			stype[it] = 1, location[it] = location[pos] - dis1[it];
			cmin = it;
			mark[location[it]] = 1;
		}
	}
	memset(mark,-1,sizeof(mark));
	mark[location[pos]] = 1;
	sort(ALL(rit));
	int dmax = pos;
	for (auto itt:rit) {
		int it = itt.se;
		int hi = getDistance(it,dmax);
		int tmp = dis0[dmax] + hi - dis0[it];
		tmp/=2;
		if (mark[location[dmax] - tmp]==1) {
			stype[it] = 1;
			location[it] = location[dmax] - hi;
		}
		else {
			stype[it] = 2, location[it] = first + dis0[it];
			dmax = it;
			mark[location[it]] = 1;
		}
	}
	return;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
22.0 / 22.0

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

Subtask #3
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 75 ms 4476 KB Output is correct
2 Correct 81 ms 4480 KB Output is correct
3 Correct 72 ms 4472 KB Output is correct
4 Correct 70 ms 4480 KB Output is correct
5 Correct 73 ms 4472 KB Output is correct
6 Correct 72 ms 4472 KB Output is correct
7 Correct 80 ms 4472 KB Output is correct
8 Correct 71 ms 4444 KB Output is correct
9 Correct 75 ms 4476 KB Output is correct
10 Correct 70 ms 4484 KB Output is correct

Subtask #4
44.0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 75 ms 4476 KB Output is correct
2 Correct 69 ms 4472 KB Output is correct
3 Correct 71 ms 4492 KB Output is correct
4 Correct 73 ms 4484 KB Output is correct
5 Correct 84 ms 4480 KB Output is correct
6 Correct 87 ms 4476 KB Output is correct
7 Correct 69 ms 4472 KB Output is correct
8 Correct 72 ms 4476 KB Output is correct
9 Correct 78 ms 4484 KB Output is correct
10 Correct 78 ms 4552 KB Output is correct
11 Correct 68 ms 4488 KB Output is correct
12 Correct 68 ms 4480 KB Output is correct
13 Correct 69 ms 4556 KB Output is correct
14 Correct 70 ms 4476 KB Output is correct
15 Correct 71 ms 4476 KB Output is correct
16 Correct 71 ms 4480 KB Output is correct
17 Correct 73 ms 4556 KB Output is correct
18 Correct 74 ms 4472 KB Output is correct
19 Correct 73 ms 4540 KB Output is correct
20 Correct 75 ms 4476 KB Output is correct