oj.uz

Submission #386169

# Submission time Handle Problem Language Result Execution time Memory
386169 2021-04-05T22:09:53 Z AmineWeslati Rail (IOI14_rail) C++14
100 / 100
 160 ms 98964 KB 
//Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e9;
const int MX = 5000 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}
#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin); 
    freopen("output.txt", "w", stdout);
#endif
}
/////////////////////////ONLY CLEAN CODES ALLOWED/////////////////////////

#ifndef LOCAL
#include "rail.h"
#endif

#ifdef LOCAL
int getDistance(int u, int v){
	return 0;
}
#endif


int N,x[MX],ty[MX],X,d[MX][MX]; 

int get(int i, int j){
	if(d[i][j]==-1){
		d[i][j]=d[j][i]=getDistance(i,j);
	}
	return d[i][j];
}

void det_X(){
	int mn=INF;
	FOR(i,1,N){
		if(ckmin(mn,get(0,i))) X=i;
	}
	x[X]=x[0]+get(0,X);
	ty[X]=2;
}

vi l,m,r; 
void divide(){
	FOR(Y,1,N) if(Y!=X){
		if(get(0,X)+get(X,Y)==get(0,Y)){
			if(get(X,Y)<get(0,X)) m.pb(Y);
			else l.pb(Y);
		}	
		else{
			r.pb(Y);
		}
	}
}


void solve_mid(){
	for(int Z: m){
		ty[Z]=1;
		x[Z]=x[X]-get(X,Z);
	}
}


bool cmpR(int i, int j){
	return get(0,i)<get(0,j);
}
void solve_right(){
	sort(all(r),cmpR);

	vi tyD={X};
	int Y=X; 
	for(int Z: r){
		int z=(-get(0,Z)+get(0,Y)+get(Y,Z))/2;

		int found=0;
		for(int u: tyD) if(x[Y]-x[u]==z) 
			found=1;

		if(found){
			ty[Z]=1;
			x[Z]=x[Y]-get(Y,Z);
		}
		else{
			ty[Z]=2; tyD.pb(Z);
			x[Z]=x[0]+get(0,Z);

			assert(x[Z]>x[Y]); Y=Z;
		}
	}
}

bool cmpL(int i, int j){
	return get(X,i)<get(X,j);
}
void solve_left(){
	sort(all(l),cmpL);

	vi tyC={0};
	int Y=0;

	for(int Z: l){
		int z=(-get(X,Z)+get(X,Y)+get(Y,Z))/2;

		int found=0;
		for(int u: tyC){
			if(x[u]-x[Y]==z) found=1;
		}

		if(found){
			ty[Z]=2;
			x[Z]=x[Y]+get(Y,Z);
		}
		else{
			ty[Z]=1; tyC.pb(Z);
			x[Z]=x[X]-get(X,Z);
			assert(x[Z]<x[Y]); Y=Z;
		}
	}
}

void findLocation(int N, int fir, int xx[], int tyy[]){
	::N=N; 
	memset(d,-1,sizeof(d));
	FOR(i,0,N) d[i][i]=0;

	x[0]=fir; ty[0]=1;
	if(N==1) return;

	det_X();
	divide();

	solve_mid();
	solve_right();
	solve_left();

	FOR(i,0,N) xx[i]=x[i],tyy[i]=ty[i];
}


#ifdef LOCAL
int main(){
	IO();

}
#endif

//Change your approach 
/*
4
4
1 2
2 5
1 3
1 1
*/

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 98540 KB Output is correct
2 Correct 55 ms 98668 KB Output is correct
3 Correct 50 ms 98540 KB Output is correct
4 Correct 50 ms 98540 KB Output is correct
5 Correct 49 ms 98540 KB Output is correct
6 Correct 50 ms 98540 KB Output is correct
7 Correct 55 ms 98668 KB Output is correct
8 Correct 60 ms 98540 KB Output is correct
9 Correct 50 ms 98540 KB Output is correct
10 Correct 49 ms 98540 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 98540 KB Output is correct
2 Correct 50 ms 98540 KB Output is correct
3 Correct 50 ms 98540 KB Output is correct
4 Correct 50 ms 98540 KB Output is correct
5 Correct 50 ms 98560 KB Output is correct
6 Correct 49 ms 98540 KB Output is correct
7 Correct 50 ms 98540 KB Output is correct
8 Correct 50 ms 98540 KB Output is correct
9 Correct 54 ms 98540 KB Output is correct
10 Correct 51 ms 98568 KB Output is correct

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 139 ms 98964 KB Output is correct
2 Correct 138 ms 98836 KB Output is correct
3 Correct 137 ms 98924 KB Output is correct
4 Correct 137 ms 98796 KB Output is correct
5 Correct 148 ms 98868 KB Output is correct
6 Correct 141 ms 98796 KB Output is correct
7 Correct 138 ms 98796 KB Output is correct
8 Correct 140 ms 98924 KB Output is correct
9 Correct 136 ms 98924 KB Output is correct
10 Correct 138 ms 98796 KB Output is correct

Subtask #4
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 147 ms 98796 KB Output is correct
2 Correct 147 ms 98796 KB Output is correct
3 Correct 139 ms 98836 KB Output is correct
4 Correct 137 ms 98868 KB Output is correct
5 Correct 142 ms 98796 KB Output is correct
6 Correct 139 ms 98924 KB Output is correct
7 Correct 145 ms 98924 KB Output is correct
8 Correct 160 ms 98924 KB Output is correct
9 Correct 140 ms 98796 KB Output is correct
10 Correct 138 ms 98796 KB Output is correct
11 Correct 137 ms 98812 KB Output is correct
12 Correct 159 ms 98796 KB Output is correct
13 Correct 138 ms 98796 KB Output is correct
14 Correct 144 ms 98796 KB Output is correct
15 Correct 150 ms 98924 KB Output is correct
16 Correct 138 ms 98796 KB Output is correct
17 Correct 139 ms 98796 KB Output is correct
18 Correct 138 ms 98796 KB Output is correct
19 Correct 139 ms 98924 KB Output is correct
20 Correct 145 ms 98964 KB Output is correct