Submission #425073

#	Time	Username	Problem	Language	Result	Execution time	Memory
425073		Theo830	Toy Train (IOI17_train)	C++17	5 / 100	10 ms	2152 KiB

train

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9;
ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<int,int>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
#include "train.h"
ll comp[5005];
bool v[5005];
vector<vll>adj;
vll nodes;
void solve(ll idx){
    nodes.pb(idx);
    for(auto x:adj[idx]){
        if(!v[x]){
            v[x] = 1;
            solve(x);
        }
    }
}
vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) {
	vector<int> res(a.size());
	ll n = a.size();
	ll m = u.size();
	adj.assign(n+5,vll());
	f(i,0,m){
        adj[u[i]].pb(v[i]);
	}
	f(i,0,n){
	    vll neo;
        if(adj[i].size() == 2){
            sort(all(adj[i]));
            if((a[i] && r[i]) || (!a[i] && !r[i])){
                neo.pb(adj[i][0]);
            }
            else{
                neo.pb(adj[i][1]);
            }
        }
        else{
            neo = adj[i];
        }
        adj[i] = neo;
	}
	assert(adj[n-1][0] == n-1);
	for(ll i = n-1;i >= 0;i--){
        comp[i] = i;
        comp[i] = comp[adj[i][0]];
	}
	f(i,0,n){
	    res[i] = r[comp[i]];
	}
	return res;
}
/*
int main(){
	int n, m;
	assert(2 == scanf("%d %d", &n, &m));

	vector<int> a(n), r(n), u(m), v(m);

	for(int i = 0; i < n; i++)
		assert(1 == scanf("%d", &a[i]));

	for(int i = 0; i < n; i++)
		assert(1 == scanf("%d", &r[i]));

	for(int i = 0; i < m; i++)
		assert(2 == scanf("%d %d", &u[i], &v[i]));

	vector<int> res = who_wins(a, r, u, v);

	for(int i = 0; i < (int)res.size(); i++)
		printf(i ? " %d" : "%d", res[i]);
	printf("\n");

	return 0;
}
*/

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