oj.uz

Submission #425767

# Submission time Handle Problem Language Result Execution time Memory
425767 2021-06-13T11:12:25 Z Blistering_Barnacles Toy Train (IOI17_train) C++11
0 / 100
 2000 ms 14284 KB 
#include "train.h"
//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//The saddest thing about betrayal? is that it never comes from your enemies
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef int ll;
ll q, dp[100005], a[555555] , b[555555], k, l, m, n, o, p;
map < ll , ll > mp;
vll adj[555555];
const ll mod = 1e9+7;
str s;
vi o1 , o2 ;
vll cur ;
ll vis[555555] , nxt[555555] ;
vll charging ;
ll solve(){
    for(auto u : charging){
        for(ll j = 0 ; j < n ; j++){
            vis[j] = 0 ;
        }
        queue < ll > q ;
        q.push(u) ;
        while(!q.empty()){
            ll cur = q.front() ;
            q.pop() ;
            if(!vis[cur]){
                vis[cur]++ ;
                q.push(nxt[cur]) ;
            }
            else if(cur == u)R 1 ;
        }
    }
    R 0 ;
}
    vi ans ;
ll mem(ll i , ll cnt){
    if(cnt == n){
        R solve() ;
    }
    ll op = 0 ;
    if(a[i]){
        op = 0 ;
        for(auto u : adj[i]){
            nxt[i] = u ;
            op |= mem(u , cnt + 1) ;
        }
        ans[i] |= op ;
    }
    else {
        op = 1 ;
        for(auto u : adj[i]){
            nxt[i] = u ;
            op &= mem(u , cnt + 1) ;
        }
        ans[i] &= op ;
    }
    R op ;
}
vector<int> who_wins(std::vector<int> who, std::vector<int> charge, std::vector<int> u, std::vector<int> v) {
    n = sz(who) , m = sz(u) ;
    vll op ;
    for(ll i = 0 ; i < m ; i++){
        adj[u[i]].pb(v[i]) ;
    }
    for(ll i = 0 ; i < n ; i++){
        if(charge[i])charging.pb(i) ;
        a[i] = who[i] ;
    }
    ans.resize(n) ;
    for(ll i = 0 ; i < n ; i++)ans[i] = !who[i] ;
    mem(1 , 0) ;
    R ans ;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2093 ms 14028 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2098 ms 13260 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2082 ms 14284 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2054 ms 14152 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2092 ms 14284 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 51.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2093 ms 14028 KB Time limit exceeded
2 Halted 0 ms 0 KB -