oj.uz

Submission #407829

# Submission time Handle Problem Language Result Execution time Memory
407829 2021-05-19T04:45:14 Z balbit Toy Train (IOI17_train) C++14
11 / 100
 13 ms 1612 KB 
#include "train.h"

#include <bits/stdc++.h>
using namespace std;
//#define BALBIT
#define ll long long
#define y1 zck_is_king
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define REP(i,n) for (int i = 0; i<n; ++i)
#define RREP(i,n) for (int i = n-1; i>=0; --i)
#define REP1(i,n) for (int i = 1; i<=n; ++i)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif

const int iinf = 1e9+10;
const ll inf = 1ll<<60;
const ll mod = 1e9+7 ;


void GG(){cout<<"0\n"; exit(0);}

ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
    ll re=1;
    while (n>0){
        if (n&1) re = re*a %mo;
        a = a*a %mo;
        n>>=1;
    }
    return re;
}

ll inv (ll b, ll mo = mod){
    if (b==1) return b;
    return (mo-mo/b) * inv(mo%b,mo) % mo;
}

const int maxn = 5e3+5;

bool win[maxn];
int safe[maxn]; // safe edges coming out of this node
vector<int> g[maxn];
bool notcyc[maxn];
vector<int> rg[maxn];


std::vector<int> who_wins(std::vector<int> who, std::vector<int> station, std::vector<int> UU, std::vector<int> VV) {
	int n = SZ(who);
	std::vector<int> res(n);
    REP(i,SZ(UU)) {
        g[UU[i]].pb(VV[i]);
        rg[VV[i]].pb(UU[i]);
    }
//    return res;
    {
        queue<int> q;
        REP(i,n) {
            if (station[i]) q.push(i), notcyc[i] = 1;
            else safe[i] = SZ(g[i]);
        }
        // create things that aren't zero-cycles
        while (!q.empty() ) {
            int v = q.front(); q.pop();
            for (int u : rg[v]) {
                if (!notcyc[u]) {
                    if (who[u] == 1) {
                        // i like stations!
                        notcyc[u] = 1; q.push(u);
                    }else{
                        --safe[u];
                        if( safe[u] == 0) {
                            notcyc[u] = 1; q.push(u);
                        }
                    }
                }
            }
        }
    }
    {
        queue<int> q;
        REP(i,n) {
            if (!notcyc[i]) {
                q.push(i);
                win[i] = 1;
            }
            safe[i] = SZ(g[i]);
        }
        while (!q.empty() ) {
            int v = q.front(); q.pop();
            for (int u : rg[v]) {
                if (!win[u]) {
                    if (who[u] == 0) {
                        // i hate stations!
                        win[u] = 1; q.push(u);
                    }else{
                        --safe[u];
                        if( safe[u] == 0) {
                            win[u] = 1; q.push(u);
                        }
                    }
                }
            }
        }

    }
    REP(i,n) res[i] = !win[i];
	return res;
}



/*
2 4
0 1
1 0
0 0
0 1
1 0
1 1

*/

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 972 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Incorrect 1 ms 460 KB 3rd lines differ - on the 4th token, expected: '0', found: '1'
5 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 1356 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1228 KB Output is correct
2 Correct 11 ms 1484 KB Output is correct
3 Correct 10 ms 1484 KB Output is correct
4 Correct 10 ms 1484 KB Output is correct
5 Correct 11 ms 1612 KB Output is correct
6 Correct 10 ms 1556 KB Output is correct
7 Correct 13 ms 1584 KB Output is correct
8 Correct 10 ms 1576 KB Output is correct
9 Correct 10 ms 1484 KB Output is correct
10 Correct 11 ms 1596 KB Output is correct
11 Correct 13 ms 1568 KB Output is correct
12 Correct 10 ms 1612 KB Output is correct
13 Correct 10 ms 1540 KB Output is correct
14 Correct 11 ms 1520 KB Output is correct

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1404 KB Output is correct
2 Correct 10 ms 1372 KB Output is correct
3 Correct 10 ms 1356 KB Output is correct
4 Correct 8 ms 1224 KB Output is correct
5 Correct 2 ms 532 KB Output is correct
6 Correct 5 ms 972 KB Output is correct
7 Correct 6 ms 1100 KB Output is correct
8 Incorrect 6 ms 1100 KB 3rd lines differ - on the 5th token, expected: '0', found: '1'
9 Halted 0 ms 0 KB -

Subtask #6
0 / 51.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 972 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -