oj.uz

답안 #575124

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
575124 2022-06-09T17:21:17 Z definitelynotmee 장난감 기차 (IOI17_train) C++
37 / 100
 1046 ms 225004 KB 
#include<bits/stdc++.h>
#include"train.h"
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
template<typename T>
using matrix = vector<vector<T>>;

std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) {
	int owned = accumulate(all(a),0);
    int n = a.size(), m = u.size();
    vector<int> resp(n);
    matrix<int> g(n), rev(n);
    bool flag = 1;
    for(int i = 0; i < m; i++){
        g[u[i]].push_back(v[i]);
        rev[v[i]].push_back(u[i]);
        flag&=v[i] == u[i] || v[i] == u[i]+1;
    }
    if(owned == n){
        for(int i = 0; i < n; i++){
            if(!r[i])
                continue;
            vector<int> reach(n), reachedby(n);
            auto dfs =[&](int id, auto dfs)->void{
                reach[id] = 1;
                for(int i : g[id])
                    if(!reach[i]) dfs(i,dfs);
            };
            auto rdfs =[&](int id, auto dfs)->void{
                reachedby[id] = 1;
                for(int i : rev[id])
                    if(!reachedby[i]) dfs(i,dfs);
            };
            for(int j : g[i])
                dfs(j,dfs);
            for(int j : rev[i])
                rdfs(j,rdfs);
            if(reach[i]){
                for(int j = 0; j < n; j++)
                    resp[j]|=reachedby[j];
            }
        }       
        
    } else if(owned == 0){
        for(int i = 0; i < n; i++){
            if(r[i])
                continue;
            vector<int> reach(n), reachedby(n);
            auto dfs =[&](int id, auto dfs)->void{
                reach[id] = 1;
                for(int i : g[id])
                    if(!reach[i] && !r[i]) dfs(i,dfs);
            };
            auto rdfs =[&](int id, auto dfs)->void{
                reachedby[id] = 1;
                for(int i : rev[id])
                    if(!reachedby[i]) dfs(i,dfs);
            };
            for(int j : g[i])
                if(!r[j])dfs(j,dfs);
            for(int j : rev[i])
                rdfs(j,rdfs);
            if(reach[i]){
                for(int j = 0; j < n; j++)
                    resp[j]|=reachedby[j];
            }
        } 
        for(int& i : resp)
            i^=1;
    } else if(flag){
        for(int i = n-1; i >= 0; i--){
            int t1 = 0, t2 = 0;
            for(int j : g[i]){
                if(j == i)
                    t1 = 1;
                else if(j == i+1)
                    t2 = 1;
            }
            if(a[i]){
                if(t2){
                    resp[i] = resp[i+1];
                }
                if(t1 && r[i])
                    resp[i] = 1;
            } else {
                resp[i] = 1;
                if(t2){
                    resp[i] = resp[i+1];
                }
                if(t1 && !r[i])
                    resp[i] = 0;
            }
        }
    } else {
        vector<int> power(16,1);
        for(int i = 1; i < 16; i++)
            power[i] = power[i-1]*3;
        matrix<char> can(n,vector<char>(power[n],-1));
        auto getbit =[&](int x, int id){
            return( x%(power[id]*3)-x%power[id])/power[id];
        };
        auto solve=[&](int id, int mask, auto solve)->int{
            if(can[id][mask] != -1){
                return can[id][mask];
            }
            int resp = a[id]^1;
            for(int i : g[id]){
                int newmask = mask;
                int state = getbit(mask,i);
                if(state == 1){
                    // << 'a' << '\n';
                    if(!a[id]){
                        resp = 0;
                        break;
                    }
                } else if(state == 2){
                    // << 'b' << '\n';
                    if(a[id]){
                        resp = 1;
                        break;
                    }
                } else {
                    if(r[i]){
                        for(int j = 0; j < n; j++){
                            if(getbit(newmask,j) == 1){
                                newmask+=power[j];
                            }
                        }
                        newmask+=power[i]*2;
                    } else {
                        newmask+=power[i];
                    }
                    // << newmask << '\n';
                    int cur = solve(i,newmask,solve);
                    if(cur == a[id]){
                        resp = cur;
                        break;
                    }
                }
            }
            can[id][mask] = resp;
            return resp;
        };
        for(int i = 0; i < n; i++){
            int mask = power[i]*(1+r[i]);
            resp[i] = solve(i,mask,solve);
        }
    }
	return resp;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 980 KB Output is correct
2 Correct 4 ms 980 KB Output is correct
3 Correct 4 ms 980 KB Output is correct
4 Correct 4 ms 980 KB Output is correct
5 Correct 4 ms 980 KB Output is correct
6 Correct 4 ms 980 KB Output is correct
7 Correct 10 ms 980 KB Output is correct
8 Correct 10 ms 980 KB Output is correct
9 Correct 4 ms 980 KB Output is correct
10 Correct 3 ms 980 KB Output is correct
11 Correct 3 ms 1024 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 96 ms 224896 KB Output is correct
2 Correct 96 ms 224936 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 94 ms 224892 KB Output is correct
5 Correct 92 ms 224932 KB Output is correct
6 Correct 93 ms 224932 KB Output is correct
7 Correct 94 ms 224896 KB Output is correct
8 Correct 99 ms 224928 KB Output is correct
9 Correct 95 ms 224892 KB Output is correct
10 Correct 94 ms 224908 KB Output is correct
11 Correct 94 ms 224936 KB Output is correct
12 Correct 93 ms 224924 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 296 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 94 ms 224992 KB Output is correct
19 Correct 95 ms 224884 KB Output is correct
20 Correct 93 ms 225004 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 1560 KB Output is correct
2 Correct 91 ms 1548 KB Output is correct
3 Correct 131 ms 1612 KB Output is correct
4 Correct 524 ms 1460 KB Output is correct
5 Correct 93 ms 1428 KB Output is correct
6 Correct 79 ms 1412 KB Output is correct
7 Correct 517 ms 1376 KB Output is correct
8 Correct 8 ms 1364 KB Output is correct
9 Correct 7 ms 1364 KB Output is correct
10 Correct 11 ms 1316 KB Output is correct
11 Correct 7 ms 1244 KB Output is correct
12 Correct 7 ms 1236 KB Output is correct
13 Correct 8 ms 1392 KB Output is correct
14 Correct 10 ms 1388 KB Output is correct
15 Correct 8 ms 1492 KB Output is correct
16 Correct 8 ms 1364 KB Output is correct
17 Correct 8 ms 1616 KB Output is correct
18 Correct 298 ms 1108 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 1268 KB Output is correct
2 Correct 292 ms 1280 KB Output is correct
3 Correct 507 ms 1372 KB Output is correct
4 Correct 286 ms 1384 KB Output is correct
5 Correct 709 ms 1404 KB Output is correct
6 Correct 600 ms 1384 KB Output is correct
7 Correct 614 ms 1364 KB Output is correct
8 Correct 375 ms 1356 KB Output is correct
9 Correct 8 ms 1236 KB Output is correct
10 Correct 225 ms 1364 KB Output is correct
11 Correct 98 ms 1456 KB Output is correct
12 Correct 244 ms 1364 KB Output is correct
13 Correct 1046 ms 1428 KB Output is correct
14 Correct 586 ms 1356 KB Output is correct

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 8 ms 2772 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 980 KB Output is correct
2 Correct 4 ms 980 KB Output is correct
3 Correct 4 ms 980 KB Output is correct
4 Correct 4 ms 980 KB Output is correct
5 Correct 4 ms 980 KB Output is correct
6 Correct 4 ms 980 KB Output is correct
7 Correct 10 ms 980 KB Output is correct
8 Correct 10 ms 980 KB Output is correct
9 Correct 4 ms 980 KB Output is correct
10 Correct 3 ms 980 KB Output is correct
11 Correct 3 ms 1024 KB Output is correct
12 Correct 96 ms 224896 KB Output is correct
13 Correct 96 ms 224936 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 94 ms 224892 KB Output is correct
16 Correct 92 ms 224932 KB Output is correct
17 Correct 93 ms 224932 KB Output is correct
18 Correct 94 ms 224896 KB Output is correct
19 Correct 99 ms 224928 KB Output is correct
20 Correct 95 ms 224892 KB Output is correct
21 Correct 94 ms 224908 KB Output is correct
22 Correct 94 ms 224936 KB Output is correct
23 Correct 93 ms 224924 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 296 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 94 ms 224992 KB Output is correct
30 Correct 95 ms 224884 KB Output is correct
31 Correct 93 ms 225004 KB Output is correct
32 Correct 48 ms 1560 KB Output is correct
33 Correct 91 ms 1548 KB Output is correct
34 Correct 131 ms 1612 KB Output is correct
35 Correct 524 ms 1460 KB Output is correct
36 Correct 93 ms 1428 KB Output is correct
37 Correct 79 ms 1412 KB Output is correct
38 Correct 517 ms 1376 KB Output is correct
39 Correct 8 ms 1364 KB Output is correct
40 Correct 7 ms 1364 KB Output is correct
41 Correct 11 ms 1316 KB Output is correct
42 Correct 7 ms 1244 KB Output is correct
43 Correct 7 ms 1236 KB Output is correct
44 Correct 8 ms 1392 KB Output is correct
45 Correct 10 ms 1388 KB Output is correct
46 Correct 8 ms 1492 KB Output is correct
47 Correct 8 ms 1364 KB Output is correct
48 Correct 8 ms 1616 KB Output is correct
49 Correct 298 ms 1108 KB Output is correct
50 Correct 38 ms 1268 KB Output is correct
51 Correct 292 ms 1280 KB Output is correct
52 Correct 507 ms 1372 KB Output is correct
53 Correct 286 ms 1384 KB Output is correct
54 Correct 709 ms 1404 KB Output is correct
55 Correct 600 ms 1384 KB Output is correct
56 Correct 614 ms 1364 KB Output is correct
57 Correct 375 ms 1356 KB Output is correct
58 Correct 8 ms 1236 KB Output is correct
59 Correct 225 ms 1364 KB Output is correct
60 Correct 98 ms 1456 KB Output is correct
61 Correct 244 ms 1364 KB Output is correct
62 Correct 1046 ms 1428 KB Output is correct
63 Correct 586 ms 1356 KB Output is correct
64 Runtime error 8 ms 2772 KB Execution killed with signal 11
65 Halted 0 ms 0 KB -