Submission #795540

#	Time	Username	Problem	Language	Result	Execution time	Memory
795540		fatemetmhr	장난감 기차 (IOI17_train)	C++17	23 / 100	1844 ms	26060 KiB

train

//  ~ Be Name Khoda ~  //
 
#include "train.h"
#include <bits/stdc++.h>
//#pragma GCC optimize ("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops,Ofast")
 
using namespace std;
 
typedef long long ll;
 
#define pb       push_back
#define mp       make_pair
#define all(x)   x.begin(), x.end()
#define fi       first
#define se       second
 
const int maxn  =  1e6   + 10;
const int maxn5 =  5e3   + 10;
const int maxnt =  1.2e6 + 10;
const int maxn3 =  1e3   + 10;
const int mod   =  1e9   + 7;
const ll  inf   =  1e18;
 
int cnt[maxn5], q[maxn5], cntkeep[maxn5];
vector <int> adj[maxn5], jda[maxn5], ret;
bool mark[maxn5], good[maxn5], keep[maxn5], remo[maxn5][maxn5];
int n, m;
 
std::vector<int> who_wins(std::vector<int> a, std::vector<int> ch, std::vector<int> u, std::vector<int> v) {
	n = a.size(); 
	m = u.size();
	for(int i = 0; i < n; i++){
		adj[i].clear();
		jda[i].clear();
	}
	ret.clear();
	memset(mark, false, sizeof mark);
	memset(good, false, sizeof good);
	memset(keep, false, sizeof keep);
	memset(remo, false, sizeof remo);
	memset(cnt, 0, sizeof cnt);
 	for(int i = 0; i < m; i++){
 		adj[u[i]].pb(v[i]);
 		jda[v[i]].pb(u[i]);
 		cnt[u[i]]++;
 	}
 	while(true){
	 	int x = -1;
		for(int i = 0; i < n; i++){
			keep[i] = good[i];
			cntkeep[i] = cnt[i];
		}
		for(int i = 0; i < n; i++) if(!good[i] && ch[i])
			x = i;
		if(x == -1)
			break;
	 	int l = 0, r = 0;
	 	for(auto u : jda[x]) if(!good[u]){
	 		if(a[u]){
	 			q[r++] = u;
	 			good[u] = true;
	 		}
	 		else if(cnt[u] > 1){
	 			cnt[u]--;
	 			remo[u][x] = true;
	 		}
	 		else{
	 			q[r++] = u;
	 			good[u] = true;
	 		}
	 	}
	 	while(l < r){
	 		int v = q[l++];
		 	for(auto u : jda[v]) if(!good[u]){
		 		if(a[u]){
		 			q[r++] = u;
		 			good[u] = true;
		 		}
		 		else if(cnt[u] > 1){
		 			cnt[u]--;
		 			remo[u][v] = true;
		 		}
		 		else{
		 			q[r++] = u;
		 			good[u] = true;
		 		}
		 	}
	 	}
	 	for(int i = 0; i < n; i++){
	 		vector <int> tmp;
	 		for(auto u : adj[i]) if(!remo[i][u])
	 			tmp.pb(u);
	 		adj[i] = tmp;
	 		tmp.clear();
	 		for(auto u : jda[i]) if(!remo[u][i])
	 			tmp.pb(u);
	 		jda[i] = tmp;
	 	}
	 	if(!good[x]){
	 		ch[x] = false;
	 		for(int i = 0; i < n; i++)
	 			good[i] = keep[i];
	 	}
 	}
 
	for(int i = 0; i < n; i++)
		ret.pb(good[i]);
 	return ret;
}
 
 
 
 
 
 
 
 
 
 
 

• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 11 / 11
• Subtask 4: 0 / 11
• Subtask 5: 12 / 12
• Subtask 6: 0 / 51