oj.uz

답안 #261980

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
261980 2020-08-12T08:45:29 Z Alexa2001 장난감 기차 (IOI17_train) C++17
100 / 100
 376 ms 34428 KB 
#include "train.h"
#include <bits/stdc++.h>

using namespace std;

const int Nmax = 5005;

int n, m;
int cnt[Nmax], Sz[Nmax];
vector<int> ans, a, r, v, go[Nmax];

bool reach[Nmax];


void solve()
{
    if(v.empty()) return;

    queue<int> q;

    for(auto node : v)
    {
        assert(Sz[node]);
        assert(a[node] != -1);

        if(r[node])
        {
            q.push(node);
            reach[node] = 1;
        }
        else reach[node] = 0;

        cnt[node] = 0;
    }

    while(q.size())
    {
        int node = q.front();
        q.pop();

        for(auto it : go[node])
            if(a[it] != -1)
            {
                ++cnt[it];
                if( !reach[it] && ((a[it] && cnt[it] == 1) || (!a[it] && cnt[it] == Sz[it])) )
                {
                    q.push(it);
                    reach[it] = 1;
                }
            }
    }

    int nr = 0;
    for(auto it : v)
        if(reach[it]) ++nr;

    if(nr == v.size()) /// toate sunt castigatoare
    {
        for(auto it : v)
            ans[it] = 1, a[it] = -1;
        return;
    }

    for(auto node : v)
    {
        if(!reach[node])
        {
            q.push(node);
            reach[node] = 1;
        }
        else reach[node] = 0;

        cnt[node] = 0;
    }

    while(q.size())
    {
        int node = q.front();
        q.pop();

        for(auto it : go[node])
            if(a[it] != -1)
            {
                ++cnt[it];
                if(!reach[it] && ((!a[it] && cnt[it] == 1) || (a[it] && cnt[it] == Sz[it]) ))
                {
                    q.push(it);
                    reach[it] = 1;
                }
            }
    }

    vector<int> vv;

    for(auto node : v)
        if(reach[node]) /// it este pierzator si il scot
        {
            for(auto it : go[node])
                --Sz[it];
            a[node] = -1;
        }
        else vv.push_back(node);

    swap(v, vv);

    solve();
}

vector<int> who_wins(vector<int> A, vector<int> R, vector<int> U, vector<int> V)
{
    r = R;
    a = A;
    n = a.size();
    m = U.size();

    v.resize(n);
    iota(v.begin(), v.end(), 0);

    int i;
    for(i=0; i<m; ++i)
        go[V[i]].push_back(U[i]), ++Sz[U[i]];

    ans.resize(n);

    solve();
    return ans;
}

Compilation message

train.cpp: In function 'void solve()':
train.cpp:57:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(nr == v.size()) /// toate sunt castigatoare
        ~~~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 484 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 116 ms 11512 KB Output is correct
2 Correct 202 ms 18816 KB Output is correct
3 Correct 257 ms 22648 KB Output is correct
4 Correct 9 ms 1152 KB Output is correct
5 Correct 10 ms 1280 KB Output is correct
6 Correct 10 ms 1152 KB Output is correct
7 Correct 9 ms 1152 KB Output is correct
8 Correct 10 ms 1152 KB Output is correct
9 Correct 9 ms 1152 KB Output is correct
10 Correct 11 ms 1152 KB Output is correct
11 Correct 9 ms 1152 KB Output is correct
12 Correct 8 ms 1152 KB Output is correct
13 Correct 11 ms 1152 KB Output is correct
14 Correct 9 ms 1152 KB Output is correct
15 Correct 9 ms 1152 KB Output is correct
16 Correct 9 ms 1152 KB Output is correct
17 Correct 9 ms 1152 KB Output is correct
18 Correct 320 ms 34296 KB Output is correct

Subtask #4
11.0 / 11.0

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

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 1196 KB Output is correct
2 Correct 9 ms 1440 KB Output is correct
3 Correct 10 ms 1404 KB Output is correct
4 Correct 9 ms 1280 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 5 ms 896 KB Output is correct
7 Correct 6 ms 1024 KB Output is correct
8 Correct 6 ms 1024 KB Output is correct
9 Correct 8 ms 1024 KB Output is correct
10 Correct 2 ms 640 KB Output is correct
11 Correct 6 ms 1024 KB Output is correct

Subtask #6
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1024 KB Output is correct
2 Correct 6 ms 1024 KB Output is correct
3 Correct 6 ms 1024 KB Output is correct
4 Correct 6 ms 1024 KB Output is correct
5 Correct 6 ms 1024 KB Output is correct
6 Correct 5 ms 1024 KB Output is correct
7 Correct 5 ms 896 KB Output is correct
8 Correct 6 ms 1024 KB Output is correct
9 Correct 5 ms 896 KB Output is correct
10 Correct 5 ms 896 KB Output is correct
11 Correct 6 ms 1024 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 484 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 116 ms 11512 KB Output is correct
33 Correct 202 ms 18816 KB Output is correct
34 Correct 257 ms 22648 KB Output is correct
35 Correct 9 ms 1152 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 10 ms 1152 KB Output is correct
38 Correct 9 ms 1152 KB Output is correct
39 Correct 10 ms 1152 KB Output is correct
40 Correct 9 ms 1152 KB Output is correct
41 Correct 11 ms 1152 KB Output is correct
42 Correct 9 ms 1152 KB Output is correct
43 Correct 8 ms 1152 KB Output is correct
44 Correct 11 ms 1152 KB Output is correct
45 Correct 9 ms 1152 KB Output is correct
46 Correct 9 ms 1152 KB Output is correct
47 Correct 9 ms 1152 KB Output is correct
48 Correct 9 ms 1152 KB Output is correct
49 Correct 320 ms 34296 KB Output is correct
50 Correct 8 ms 1152 KB Output is correct
51 Correct 8 ms 1152 KB Output is correct
52 Correct 9 ms 1152 KB Output is correct
53 Correct 9 ms 1152 KB Output is correct
54 Correct 9 ms 1152 KB Output is correct
55 Correct 9 ms 1152 KB Output is correct
56 Correct 9 ms 1152 KB Output is correct
57 Correct 9 ms 1152 KB Output is correct
58 Correct 8 ms 1152 KB Output is correct
59 Correct 9 ms 1152 KB Output is correct
60 Correct 11 ms 1152 KB Output is correct
61 Correct 9 ms 1200 KB Output is correct
62 Correct 9 ms 1152 KB Output is correct
63 Correct 11 ms 1152 KB Output is correct
64 Correct 10 ms 1196 KB Output is correct
65 Correct 9 ms 1440 KB Output is correct
66 Correct 10 ms 1404 KB Output is correct
67 Correct 9 ms 1280 KB Output is correct
68 Correct 1 ms 512 KB Output is correct
69 Correct 5 ms 896 KB Output is correct
70 Correct 6 ms 1024 KB Output is correct
71 Correct 6 ms 1024 KB Output is correct
72 Correct 8 ms 1024 KB Output is correct
73 Correct 2 ms 640 KB Output is correct
74 Correct 6 ms 1024 KB Output is correct
75 Correct 165 ms 19320 KB Output is correct
76 Correct 220 ms 19320 KB Output is correct
77 Correct 261 ms 22776 KB Output is correct
78 Correct 258 ms 22904 KB Output is correct
79 Correct 267 ms 22776 KB Output is correct
80 Correct 10 ms 1408 KB Output is correct
81 Correct 10 ms 1408 KB Output is correct
82 Correct 10 ms 1408 KB Output is correct
83 Correct 11 ms 1408 KB Output is correct
84 Correct 11 ms 1408 KB Output is correct
85 Correct 10 ms 1408 KB Output is correct
86 Correct 12 ms 1408 KB Output is correct
87 Correct 10 ms 1408 KB Output is correct
88 Correct 13 ms 1536 KB Output is correct
89 Correct 10 ms 1408 KB Output is correct
90 Correct 15 ms 1664 KB Output is correct
91 Correct 13 ms 1664 KB Output is correct
92 Correct 22 ms 2176 KB Output is correct
93 Correct 23 ms 2168 KB Output is correct
94 Correct 22 ms 2176 KB Output is correct
95 Correct 23 ms 2296 KB Output is correct
96 Correct 83 ms 5496 KB Output is correct
97 Correct 245 ms 21484 KB Output is correct
98 Correct 376 ms 30456 KB Output is correct
99 Correct 371 ms 34424 KB Output is correct
100 Correct 312 ms 34428 KB Output is correct