oj.uz

Submission #94444

# Submission time Handle Problem Language Result Execution time Memory
94444 2019-01-18T14:08:25 Z fjzzq2002 Rail (IOI14_rail) C++14
100 / 100
 99 ms 1784 KB 
#include "rail.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
#define fi first
#define se second
#define pb push_back
map<pii,int> ms;
int qry(int a,int b)
{
	if(a==b) return 0;
	if(a>b) swap(a,b);
	if(ms.count(pii(a,b)))
		return ms[pii(a,b)];
	return ms[pii(a,b)]=getDistance(a,b);
}
int d1[5005],d2[5005];
void findLocation(int n, int x, int l[], int s[])
{
	l[0]=x; s[0]=1;
	if(n==1) return;
	for(int i=0;i<n;++i)
		d1[i]=qry(0,i);
	int r;
	{
	pii mi(2e9,2e9);
	for(int i=1;i<n;++i)
		mi=min(mi,pii(d1[i],i));
	r=mi.se;
	}
	l[r]=x+d1[r]; s[r]=2;
	for(int i=0;i<n;++i) d2[i]=qry(r,i);
	vector<pii> L,R;
	for(int t=1;t<n;++t) if(t!=r)
	{
		pii u(d1[t],t);
		if(d1[t]==d1[r]+d2[t])
		{
			if(d2[t]<=d1[r])
				l[t]=l[r]-d2[t], s[t]=1;
			else L.pb(u);
		}
		else R.pb(u);
	}
	sort(L.begin(),L.end());
	sort(R.begin(),R.end());
	{
	set<int> xs;
	xs.insert(l[r]);
	int g=r;
	for(auto _:R)
	{
		int t=_.se;
		int dt=(d1[g]+qry(g,t)-d1[t])/2;
		if(xs.count(l[g]-dt))
			l[t]=l[g]-qry(g,t), s[t]=1;
		else
			l[t]=l[0]+d1[t], s[t]=2,
			g=t, xs.insert(l[t]);
//		cerr<<t<<"w"<<l[t]<<" "<<s[t]<<"\n";
	}
	}
	{
	set<int> xs;
	xs.insert(l[0]);
	int g=0;
	for(auto _:L)
	{
		int t=_.se;
		int dt=(d2[g]+qry(g,t)-d2[t])/2;
		if(xs.count(l[g]+dt))
			l[t]=l[g]+qry(g,t), s[t]=2;
		else
			l[t]=l[r]-d2[t], s[t]=1,
			g=t, xs.insert(l[t]);
	}
	}
//	for(auto u:L)
//		cerr<<u.se<<",";cerr<<"L\n";
//	for(auto u:R)
//		cerr<<u.se<<",";cerr<<"R\n";
//	cerr<<0<<"w"<<r<<"\n";
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory 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 #2
22.0 / 22.0

# Verdict Execution time Memory 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 348 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 0 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 1624 KB Output is correct
2 Correct 81 ms 1556 KB Output is correct
3 Correct 86 ms 1528 KB Output is correct
4 Correct 84 ms 1572 KB Output is correct
5 Correct 89 ms 1784 KB Output is correct
6 Correct 79 ms 1656 KB Output is correct
7 Correct 85 ms 1656 KB Output is correct
8 Correct 89 ms 1528 KB Output is correct
9 Correct 80 ms 1656 KB Output is correct
10 Correct 84 ms 1528 KB Output is correct

Subtask #4
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 1656 KB Output is correct
2 Correct 92 ms 1536 KB Output is correct
3 Correct 82 ms 1532 KB Output is correct
4 Correct 78 ms 1532 KB Output is correct
5 Correct 80 ms 1656 KB Output is correct
6 Correct 83 ms 1660 KB Output is correct
7 Correct 97 ms 1656 KB Output is correct
8 Correct 79 ms 1656 KB Output is correct
9 Correct 77 ms 1528 KB Output is correct
10 Correct 92 ms 1528 KB Output is correct
11 Correct 83 ms 1656 KB Output is correct
12 Correct 96 ms 1660 KB Output is correct
13 Correct 80 ms 1556 KB Output is correct
14 Correct 99 ms 1632 KB Output is correct
15 Correct 81 ms 1628 KB Output is correct
16 Correct 96 ms 1528 KB Output is correct
17 Correct 86 ms 1700 KB Output is correct
18 Correct 94 ms 1656 KB Output is correct
19 Correct 84 ms 1628 KB Output is correct
20 Correct 82 ms 1572 KB Output is correct