oj.uz

Submission #216572

# Submission time Handle Problem Language Result Execution time Memory
216572 2020-03-27T14:33:56 Z maroonrk Toy Train (IOI17_train) C++17
100 / 100
 347 ms 1532 KB 
#include "train.h"
#include <bits/stdc++.h>
using namespace std;

using ll=long long;

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define si(x) int(x.size())
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif

template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

using pi=pair<int,int>;
using vi=vc<int>;

template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.a<<","<<p.b<<"}";
}

template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}

#define mp make_pair
#define mt make_tuple
#define one(x) memset(x,-1,sizeof(x))
#define zero(x) memset(x,0,sizeof(x))
#ifdef LOCAL
void dmpr(ostream&os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ";
	dmpr(os,args...);
}
#define dmp2(...) dmpr(cerr,__LINE__,##__VA_ARGS__)
#else
#define dmp2(...) void(0)
#endif

using uint=unsigned;
using ull=unsigned long long;

template<class t,size_t n>
ostream& operator<<(ostream&os,const array<t,n>&a){
	return os<<vc<t>(all(a));
}

template<int i,class T>
void print_tuple(ostream&,const T&){
}

template<int i,class T,class H,class ...Args>
void print_tuple(ostream&os,const T&t){
	if(i)os<<",";
	os<<get<i>(t);
	print_tuple<i+1,T,Args...>(os,t);
}

template<class ...Args>
ostream& operator<<(ostream&os,const tuple<Args...>&t){
	os<<"{";
	print_tuple<0,tuple<Args...>,Args...>(os,t);
	return os<<"}";
}

template<class t>
void print(t x,int suc=1){
	cout<<x;
	if(suc==1)
		cout<<"\n";
	if(suc==2)
		cout<<" ";
}

ll read(){
	ll i;
	cin>>i;
	return i;
}

vi readvi(int n,int off=0){
	vi v(n);
	rep(i,n)v[i]=read()+off;
	return v;
}

template<class T>
void print(const vector<T>&v,int suc=1){
	rep(i,v.size())
		print(v[i],i==int(v.size())-1?suc:2);
}

string readString(){
	string s;
	cin>>s;
	return s;
}

template<class T>
T sq(const T& t){
	return t*t;
}

//#define CAPITAL
void yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<"\n";
	#else
	cout<<"Yes"<<"\n";
	#endif
	if(ex)exit(0);
}
void no(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<"\n";
	#else
	cout<<"No"<<"\n";
	#endif
	if(ex)exit(0);
}
void possible(bool ex=true){
	#ifdef CAPITAL
	cout<<"POSSIBLE"<<"\n";
	#else
	cout<<"Possible"<<"\n";
	#endif
	if(ex)exit(0);
}
void impossible(bool ex=true){
	#ifdef CAPITAL
	cout<<"IMPOSSIBLE"<<"\n";
	#else
	cout<<"Impossible"<<"\n";
	#endif
	if(ex)exit(0);
}

constexpr ll ten(int n){
	return n==0?1:ten(n-1)*10;
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

int topbit(signed t){
	return t==0?-1:31-__builtin_clz(t);
}
int topbit(ll t){
	return t==0?-1:63-__builtin_clzll(t);
}
int botbit(signed a){
	return a==0?32:__builtin_ctz(a);
}
int botbit(ll a){
	return a==0?64:__builtin_ctzll(a);
}
int popcount(signed t){
	return __builtin_popcount(t);
}
int popcount(ll t){
	return __builtin_popcountll(t);
}
bool ispow2(int i){
	return i&&(i&-i)==i;
}
ll mask(int i){
	return (ll(1)<<i)-1;
}

bool inc(int a,int b,int c){
	return a<=b&&b<=c;
}

template<class t> void mkuni(vc<t>&v){
	sort(all(v));
	v.erase(unique(all(v)),v.ed);
}

ll rand_int(ll l, ll r) { //[l, r]
	#ifdef LOCAL
	static mt19937_64 gen;
	#else
	static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
	#endif
	return uniform_int_distribution<ll>(l, r)(gen);
}

template<class t>
void myshuffle(vc<t>&a){
	rep(i,si(a))swap(a[i],a[rand_int(0,i)]);
}

template<class t>
int lwb(const vc<t>&v,const t&a){
	return lower_bound(all(v),a)-v.bg;
}

vi who_wins(vi a,vi r,vi u,vi v){
	int n=si(a);
	vvc<int> g(n);
	vi deg_raw(n);
	rep(i,si(u)){
		g[v[i]].pb(u[i]);
		deg_raw[u[i]]++;
	}
	while(1){
		vi deg=deg_raw;
		vi res(n,-1);
		vi q(n);
		int head=0,tail=0;
		bool skip=false;
		auto decide=[&](int i,int x){
			if(skip&&r[i])return;
			for(auto j:g[i])if(res[j]==-1){
				if(x==a[j]||--deg[j]==0){
					res[j]=x;
					q[tail++]=j;
				}
			}
		};
		rep(i,n)if(r[i]){
			decide(i,1);
		}
		skip=true;
		while(head<tail){
			int i=q[head++];
			decide(i,res[i]);
		}
		bool ok=true;
		rep(i,n){
			if(res[i]==-1)res[i]=0;
			if(res[i]==0&&r[i]){
				ok=false;
				r[i]=0;
			}
		}
		if(ok)return res;
	}
	assert(false);
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 896 KB Output is correct
2 Correct 10 ms 896 KB Output is correct
3 Correct 11 ms 1024 KB Output is correct
4 Correct 10 ms 896 KB Output is correct
5 Correct 10 ms 896 KB Output is correct
6 Correct 10 ms 896 KB Output is correct
7 Correct 10 ms 896 KB Output is correct
8 Correct 10 ms 896 KB Output is correct
9 Correct 10 ms 896 KB Output is correct
10 Correct 9 ms 896 KB Output is correct
11 Correct 8 ms 896 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 256 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 4 ms 256 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 5 ms 256 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 256 KB Output is correct
18 Correct 5 ms 256 KB Output is correct
19 Correct 5 ms 256 KB Output is correct
20 Correct 5 ms 256 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 1400 KB Output is correct
2 Correct 95 ms 1400 KB Output is correct
3 Correct 136 ms 1400 KB Output is correct
4 Correct 13 ms 1280 KB Output is correct
5 Correct 15 ms 1408 KB Output is correct
6 Correct 14 ms 1280 KB Output is correct
7 Correct 12 ms 1280 KB Output is correct
8 Correct 12 ms 1280 KB Output is correct
9 Correct 12 ms 1280 KB Output is correct
10 Correct 15 ms 1408 KB Output is correct
11 Correct 11 ms 1280 KB Output is correct
12 Correct 12 ms 1280 KB Output is correct
13 Correct 12 ms 1280 KB Output is correct
14 Correct 13 ms 1408 KB Output is correct
15 Correct 12 ms 1280 KB Output is correct
16 Correct 12 ms 1280 KB Output is correct
17 Correct 13 ms 1280 KB Output is correct
18 Correct 175 ms 1024 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1152 KB Output is correct
2 Correct 12 ms 1280 KB Output is correct
3 Correct 13 ms 1280 KB Output is correct
4 Correct 13 ms 1280 KB Output is correct
5 Correct 13 ms 1280 KB Output is correct
6 Correct 12 ms 1280 KB Output is correct
7 Correct 13 ms 1280 KB Output is correct
8 Correct 11 ms 1280 KB Output is correct
9 Correct 14 ms 1280 KB Output is correct
10 Correct 13 ms 1280 KB Output is correct
11 Correct 12 ms 1280 KB Output is correct
12 Correct 13 ms 1408 KB Output is correct
13 Correct 12 ms 1280 KB Output is correct
14 Correct 12 ms 1280 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1408 KB Output is correct
2 Correct 12 ms 1408 KB Output is correct
3 Correct 12 ms 1408 KB Output is correct
4 Correct 12 ms 1280 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 8 ms 896 KB Output is correct
7 Correct 9 ms 896 KB Output is correct
8 Correct 10 ms 1024 KB Output is correct
9 Correct 10 ms 896 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 9 ms 896 KB Output is correct

Subtask #6
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 896 KB Output is correct
2 Correct 10 ms 896 KB Output is correct
3 Correct 11 ms 1024 KB Output is correct
4 Correct 10 ms 896 KB Output is correct
5 Correct 10 ms 896 KB Output is correct
6 Correct 10 ms 896 KB Output is correct
7 Correct 10 ms 896 KB Output is correct
8 Correct 10 ms 896 KB Output is correct
9 Correct 10 ms 896 KB Output is correct
10 Correct 9 ms 896 KB Output is correct
11 Correct 8 ms 896 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 5 ms 256 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 4 ms 256 KB Output is correct
20 Correct 5 ms 256 KB Output is correct
21 Correct 4 ms 256 KB Output is correct
22 Correct 5 ms 256 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 256 KB Output is correct
26 Correct 5 ms 256 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 256 KB Output is correct
29 Correct 5 ms 256 KB Output is correct
30 Correct 5 ms 256 KB Output is correct
31 Correct 5 ms 256 KB Output is correct
32 Correct 59 ms 1400 KB Output is correct
33 Correct 95 ms 1400 KB Output is correct
34 Correct 136 ms 1400 KB Output is correct
35 Correct 13 ms 1280 KB Output is correct
36 Correct 15 ms 1408 KB Output is correct
37 Correct 14 ms 1280 KB Output is correct
38 Correct 12 ms 1280 KB Output is correct
39 Correct 12 ms 1280 KB Output is correct
40 Correct 12 ms 1280 KB Output is correct
41 Correct 15 ms 1408 KB Output is correct
42 Correct 11 ms 1280 KB Output is correct
43 Correct 12 ms 1280 KB Output is correct
44 Correct 12 ms 1280 KB Output is correct
45 Correct 13 ms 1408 KB Output is correct
46 Correct 12 ms 1280 KB Output is correct
47 Correct 12 ms 1280 KB Output is correct
48 Correct 13 ms 1280 KB Output is correct
49 Correct 175 ms 1024 KB Output is correct
50 Correct 11 ms 1152 KB Output is correct
51 Correct 12 ms 1280 KB Output is correct
52 Correct 13 ms 1280 KB Output is correct
53 Correct 13 ms 1280 KB Output is correct
54 Correct 13 ms 1280 KB Output is correct
55 Correct 12 ms 1280 KB Output is correct
56 Correct 13 ms 1280 KB Output is correct
57 Correct 11 ms 1280 KB Output is correct
58 Correct 14 ms 1280 KB Output is correct
59 Correct 13 ms 1280 KB Output is correct
60 Correct 12 ms 1280 KB Output is correct
61 Correct 13 ms 1408 KB Output is correct
62 Correct 12 ms 1280 KB Output is correct
63 Correct 12 ms 1280 KB Output is correct
64 Correct 12 ms 1408 KB Output is correct
65 Correct 12 ms 1408 KB Output is correct
66 Correct 12 ms 1408 KB Output is correct
67 Correct 12 ms 1280 KB Output is correct
68 Correct 5 ms 384 KB Output is correct
69 Correct 8 ms 896 KB Output is correct
70 Correct 9 ms 896 KB Output is correct
71 Correct 10 ms 1024 KB Output is correct
72 Correct 10 ms 896 KB Output is correct
73 Correct 6 ms 512 KB Output is correct
74 Correct 9 ms 896 KB Output is correct
75 Correct 114 ms 1348 KB Output is correct
76 Correct 142 ms 1408 KB Output is correct
77 Correct 190 ms 1532 KB Output is correct
78 Correct 186 ms 1400 KB Output is correct
79 Correct 186 ms 1400 KB Output is correct
80 Correct 12 ms 1280 KB Output is correct
81 Correct 13 ms 1280 KB Output is correct
82 Correct 14 ms 1280 KB Output is correct
83 Correct 14 ms 1280 KB Output is correct
84 Correct 14 ms 1280 KB Output is correct
85 Correct 14 ms 1408 KB Output is correct
86 Correct 15 ms 1280 KB Output is correct
87 Correct 13 ms 1280 KB Output is correct
88 Correct 18 ms 1280 KB Output is correct
89 Correct 13 ms 1408 KB Output is correct
90 Correct 24 ms 1280 KB Output is correct
91 Correct 22 ms 1280 KB Output is correct
92 Correct 35 ms 1280 KB Output is correct
93 Correct 32 ms 1280 KB Output is correct
94 Correct 31 ms 1280 KB Output is correct
95 Correct 35 ms 1280 KB Output is correct
96 Correct 66 ms 1280 KB Output is correct
97 Correct 209 ms 1380 KB Output is correct
98 Correct 333 ms 1280 KB Output is correct
99 Correct 347 ms 1280 KB Output is correct
100 Correct 173 ms 1024 KB Output is correct