oj.uz

답안 #408064

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
408064 2021-05-19T05:50:29 Z balbit 장난감 기차 (IOI17_train) C++14
49 / 100
 449 ms 32708 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> win2(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,n) g[i].clear(), rg[i].clear();
	memset(win, 0, sizeof win);
	memset(safe, 0, sizeof safe);
	memset(notcyc, 0, sizeof notcyc);
    REP(i,SZ(UU)) {
        g[UU[i]].pb(VV[i]);
        rg[VV[i]].pb(UU[i]);
    }
//    return res;
    REP(round, 3)
    REP(T, n) {
        if (res[T]) continue;
        // T is target node
        if (!station[T]) continue;
        // who = 1: any is required to win
        REP(i,n) safe[i] = SZ(g[i]);
        memset(win, 0, sizeof win);
        win[T] = 1;
        queue<int> q;
        REP(i,n) if (res[i] || i==T) q.push(i);
        while (!q.empty() ){
            int v = q.front(); q.pop();
            for (int u : rg[v]) {
                if (!win[u]) {
                    if (who[u] == 1) {
                        // any required
//                        bug(u, who[u]);
                        win[u] = 1; q.push(u);
                    }else{
                        -- safe[u];
                        if (safe[u] == 0) {
                            q.push(u);
                            win[u] = 1;
                        }
                    }
                }
            }
        }
//        continue;
        bool ok = 0;
        if (who[T] == 1) {
            // any required
            for (int u : g[T]) {
                if (win[u]) {
                    ok = 1; break;
                }
            }
        }else{
            ok = 1;
            for (int u : g[T]) {
                if (!win[u]) {
//                    bug(T, u, win[u]);
                    ok=0; break;
                }
            }
        }
//        bug(T, ok);
        if (ok) {
            REP(i,n) {
//                bug(i, win[i]);
                if (win[i]) res[i] = 1;
            }
        }
    }
	return res;
}

bitset<maxn> fren[maxn];
vector<int> love[maxn];
int nlove[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,n) g[i].clear(), rg[i].clear();
	memset(win, 0, sizeof win);
	memset(safe, 0, sizeof safe);
	memset(notcyc, 0, sizeof notcyc);
	memset(nlove, 0, sizeof nlove);
    REP(i,n) love[i].clear();
    REP(i,SZ(UU)) {
        g[UU[i]].pb(VV[i]);
        rg[VV[i]].pb(UU[i]);
    }
//    return res;
     REP(T, n) {
//        if (res[T]) continue;
        // T is target node
        if (!station[T]) continue;
        // who = 1: any is required to win
        REP(i,n) safe[i] = SZ(g[i]);
        memset(win, 0, sizeof win);
        win[T] = 1;
        queue<int> q; q.push(T);
        while (!q.empty() ){
            int v = q.front(); q.pop();
            for (int u : rg[v]) {
                if (!win[u]) {
                    if (who[u] == 1) {
                        // any required
//                        bug(u, who[u]);
                        win[u] = 1; q.push(u);
                    }else{
                        -- safe[u];
                        if (safe[u] == 0) {
                            q.push(u);
                            win[u] = 1;
                        }
                    }
                }
            }
        }
        bool ok = 0;
        if (who[T] == 1) {
            // any required
            for (int u : g[T]) {
                if (win[u]) {
                    ok = 1; break;
                }
            }
        }else{
            ok = 1;
            for (int u : g[T]) {
                if (!win[u]) {
//                    bug(T, u, win[u]);
                    ok=0; break;
                }
            }
        }
        bug(T, ok);
        win[T] = ok;
        REP(i,n){
            if (win[i]) {
                love[T].pb(i);
                ++nlove[i];
//                bug(T,i);
            }
        }

    }
    {

        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);
                        }
                    }
                }
            }
        }
    }
    memset(win, 0, sizeof win);
    {
        queue<int> q;
        REP(i,n) {
            if (!notcyc[i] || (who[i] == 1 && nlove[i] == 0)) {
                bug(i, notcyc[i]);
                q.push(i);
                win[i] = 1;
            }
//            safe[i] = SZ(g[i]);
        }
        bitset<maxn> alive;
        alive.set();
        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);
                    }
                }
            }
            if (station[v]) {
                for (int u : love[v]) {
                    if (who[u] == 1 && (--nlove[u] <= 0) ) {
                        q.push(u); win[u] = 1;
                    }
                }
            }
        }

    }
    REP(i,n) res[i] = !win[i];
	return res;
}
#ifdef BALBIT
signed main() {
    int n,m; cin>>n>>m;
    REP(ffff, 1000) {
        vector<int >a,r;
        REP(i,n) a.pb(rand()%2);
        REP(i,n) {
            r.pb(rand()%2);
            if (r.back()) a[i] = 1;
        }
        vector<int> u,v;
        REP(i,m) {
            u.pb(rand()%n);
            if (i<n) u[i] = i;
            v.pb(rand()%n);
        }
        vector<int> r1 = win2(a,r,u,v);
        vector<int> r2 = who_wins(a,r,u,v);
        if (r1 != r2) {
            for (int x : r1) cout<<x<<' ';
            cout<<endl;
            for (int x : r2) cout<<x<<' ';
            cout<<endl;

            cout<<"A"<<endl;
            for (int x : a) cout<<x<<' ';
            cout<<endl;
            for (int x : r) cout<<x<<' ';
            cout<<endl;
            for (int x : u) cout<<x<<' ';
            cout<<endl;
            for (int x : v) cout<<x<<' ';
            cout<<endl;
            assert(0);
        }
    }
}
#endif
/*
2 4
0 1
1 0
0 0
0 1
1 0
1 1

*/

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 1396 KB Output is correct
2 Correct 62 ms 1356 KB Output is correct
3 Correct 66 ms 1380 KB Output is correct
4 Correct 64 ms 1364 KB Output is correct
5 Correct 68 ms 1304 KB Output is correct
6 Correct 56 ms 1348 KB Output is correct
7 Correct 67 ms 1300 KB Output is correct
8 Correct 60 ms 1536 KB Output is correct
9 Correct 56 ms 1228 KB Output is correct
10 Correct 61 ms 1312 KB Output is correct
11 Correct 57 ms 1396 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 716 KB Output is correct
2 Correct 1 ms 588 KB Output is correct
3 Correct 1 ms 736 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 1 ms 588 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 2 ms 668 KB Output is correct
11 Correct 1 ms 668 KB Output is correct
12 Correct 1 ms 588 KB Output is correct
13 Correct 1 ms 716 KB Output is correct
14 Correct 1 ms 668 KB Output is correct
15 Correct 1 ms 584 KB Output is correct
16 Correct 1 ms 588 KB Output is correct
17 Correct 2 ms 664 KB Output is correct
18 Correct 2 ms 716 KB Output is correct
19 Correct 1 ms 716 KB Output is correct
20 Correct 2 ms 588 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 106 ms 11572 KB Output is correct
2 Correct 167 ms 18880 KB Output is correct
3 Correct 184 ms 22732 KB Output is correct
4 Correct 449 ms 31128 KB Output is correct
5 Correct 93 ms 7444 KB Output is correct
6 Correct 34 ms 2980 KB Output is correct
7 Correct 431 ms 32228 KB Output is correct
8 Correct 15 ms 1740 KB Output is correct
9 Correct 12 ms 1704 KB Output is correct
10 Correct 16 ms 1892 KB Output is correct
11 Correct 11 ms 1680 KB Output is correct
12 Correct 12 ms 1588 KB Output is correct
13 Correct 10 ms 1740 KB Output is correct
14 Correct 13 ms 1824 KB Output is correct
15 Correct 12 ms 1740 KB Output is correct
16 Correct 13 ms 1800 KB Output is correct
17 Correct 12 ms 1740 KB Output is correct
18 Correct 358 ms 32708 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 106 ms 1524 KB Output is correct
2 Correct 11 ms 1520 KB Output is correct
3 Correct 13 ms 1720 KB Output is correct
4 Correct 61 ms 1744 KB Output is correct
5 Correct 14 ms 1700 KB Output is correct
6 Correct 15 ms 1692 KB Output is correct
7 Correct 17 ms 1612 KB Output is correct
8 Correct 28 ms 1672 KB Output is correct
9 Correct 107 ms 1624 KB Output is correct
10 Correct 98 ms 1740 KB Output is correct
11 Correct 104 ms 1720 KB Output is correct
12 Correct 90 ms 1740 KB Output is correct
13 Correct 10 ms 1740 KB Output is correct
14 Correct 10 ms 1608 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 1740 KB Output is correct
2 Correct 13 ms 1744 KB Output is correct
3 Correct 12 ms 1740 KB Output is correct
4 Correct 14 ms 1612 KB Output is correct
5 Correct 2 ms 716 KB Output is correct
6 Correct 6 ms 1276 KB Output is correct
7 Correct 8 ms 1424 KB Output is correct
8 Correct 10 ms 1352 KB Output is correct
9 Correct 8 ms 1356 KB Output is correct
10 Correct 3 ms 844 KB Output is correct
11 Correct 10 ms 1356 KB Output is correct

Subtask #6
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 1396 KB Output is correct
2 Correct 62 ms 1356 KB Output is correct
3 Correct 66 ms 1380 KB Output is correct
4 Correct 64 ms 1364 KB Output is correct
5 Correct 68 ms 1304 KB Output is correct
6 Correct 56 ms 1348 KB Output is correct
7 Correct 67 ms 1300 KB Output is correct
8 Correct 60 ms 1536 KB Output is correct
9 Correct 56 ms 1228 KB Output is correct
10 Correct 61 ms 1312 KB Output is correct
11 Correct 57 ms 1396 KB Output is correct
12 Correct 2 ms 716 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 1 ms 736 KB Output is correct
15 Correct 1 ms 588 KB Output is correct
16 Correct 1 ms 588 KB Output is correct
17 Correct 2 ms 588 KB Output is correct
18 Correct 1 ms 588 KB Output is correct
19 Correct 1 ms 588 KB Output is correct
20 Correct 1 ms 588 KB Output is correct
21 Correct 2 ms 668 KB Output is correct
22 Correct 1 ms 668 KB Output is correct
23 Correct 1 ms 588 KB Output is correct
24 Correct 1 ms 716 KB Output is correct
25 Correct 1 ms 668 KB Output is correct
26 Correct 1 ms 584 KB Output is correct
27 Correct 1 ms 588 KB Output is correct
28 Correct 2 ms 664 KB Output is correct
29 Correct 2 ms 716 KB Output is correct
30 Correct 1 ms 716 KB Output is correct
31 Correct 2 ms 588 KB Output is correct
32 Correct 106 ms 11572 KB Output is correct
33 Correct 167 ms 18880 KB Output is correct
34 Correct 184 ms 22732 KB Output is correct
35 Correct 449 ms 31128 KB Output is correct
36 Correct 93 ms 7444 KB Output is correct
37 Correct 34 ms 2980 KB Output is correct
38 Correct 431 ms 32228 KB Output is correct
39 Correct 15 ms 1740 KB Output is correct
40 Correct 12 ms 1704 KB Output is correct
41 Correct 16 ms 1892 KB Output is correct
42 Correct 11 ms 1680 KB Output is correct
43 Correct 12 ms 1588 KB Output is correct
44 Correct 10 ms 1740 KB Output is correct
45 Correct 13 ms 1824 KB Output is correct
46 Correct 12 ms 1740 KB Output is correct
47 Correct 13 ms 1800 KB Output is correct
48 Correct 12 ms 1740 KB Output is correct
49 Correct 358 ms 32708 KB Output is correct
50 Correct 106 ms 1524 KB Output is correct
51 Correct 11 ms 1520 KB Output is correct
52 Correct 13 ms 1720 KB Output is correct
53 Correct 61 ms 1744 KB Output is correct
54 Correct 14 ms 1700 KB Output is correct
55 Correct 15 ms 1692 KB Output is correct
56 Correct 17 ms 1612 KB Output is correct
57 Correct 28 ms 1672 KB Output is correct
58 Correct 107 ms 1624 KB Output is correct
59 Correct 98 ms 1740 KB Output is correct
60 Correct 104 ms 1720 KB Output is correct
61 Correct 90 ms 1740 KB Output is correct
62 Correct 10 ms 1740 KB Output is correct
63 Correct 10 ms 1608 KB Output is correct
64 Correct 11 ms 1740 KB Output is correct
65 Correct 13 ms 1744 KB Output is correct
66 Correct 12 ms 1740 KB Output is correct
67 Correct 14 ms 1612 KB Output is correct
68 Correct 2 ms 716 KB Output is correct
69 Correct 6 ms 1276 KB Output is correct
70 Correct 8 ms 1424 KB Output is correct
71 Correct 10 ms 1352 KB Output is correct
72 Correct 8 ms 1356 KB Output is correct
73 Correct 3 ms 844 KB Output is correct
74 Correct 10 ms 1356 KB Output is correct
75 Correct 154 ms 18668 KB Output is correct
76 Correct 232 ms 18880 KB Output is correct
77 Correct 308 ms 22676 KB Output is correct
78 Correct 307 ms 22620 KB Output is correct
79 Correct 262 ms 22624 KB Output is correct
80 Incorrect 240 ms 14564 KB 3rd lines differ - on the 3rd token, expected: '1', found: '0'
81 Halted 0 ms 0 KB -