oj.uz

Submission #290919

# Submission time Handle Problem Language Result Execution time Memory
290919 2020-09-04T14:43:55 Z Kastanda Toy Train (IOI17_train) C++11
100 / 100
 624 ms 1900 KB 
// M
#include<bits/stdc++.h>
#include "train.h"
using namespace std;
const int N = 5005;
int n, m, A[N], R[N], Z[N], F[N], D[N];
vector < int > in[N], out[N];

vector < int > who_wins(vector < int > _A, vector < int > _R, vector < int > _U, vector < int > _V)
{
        n = (int)_A.size();
        m = (int)_U.size();
        for (int i = 0; i < n; i ++)
                A[i] = _A[i];
        for (int i = 0; i < n; i ++)
                R[i] = _R[i];
        for (int i = 0; i < m; i ++)
        {
                out[_U[i]].push_back(_V[i]);
                in[_V[i]].push_back(_U[i]);
        }


        for (int __ = 0;; __ ++)
        {
                queue < int > qu;
                memset(D, 0, sizeof(D));
                memset(Z, 0, sizeof(Z));
                for (int i = 0; i < n; i ++)
                        if (R[i] && !F[i])
                                Z[i] = 1, qu.push(i);
                while (qu.size())
                {
                        int v = qu.front();
                        qu.pop();
                        for (int u : in[v])
                                if (!Z[u] && !F[u])
                                {
                                        if (A[u])
                                                Z[u] = 1, qu.push(u);
                                        else
                                        {
                                                D[u] ++;
                                                if (D[u] == (int)out[u].size())
                                                        Z[u] = 1, qu.push(u);
                                        }
                                }
                }

                memset(D, 0, sizeof(D));
                bool yodeloohoo = 0;
                for (int i = 0; i < n; i ++)
                        if (!Z[i] && !F[i])
                                F[i] = 1, yodeloohoo = 1;
                if (!yodeloohoo)
                        break;
                for (int i = 0; i < n; i ++)
                        if (F[i]) qu.push(i);
                while (qu.size())
                {
                        int v = qu.front();
                        qu.pop();
                        for (int u : in[v])
                                if (!F[u])
                                {
                                        if (!A[u])
                                                F[u] = 1, qu.push(u);
                                        else
                                        {
                                                D[u] ++;
                                                if (D[u] == (int)out[u].size())
                                                        F[u] = 1, qu.push(u);
                                        }
                                }
                }
        }

        vector < int > Rs;
        for (int i = 0; i < n; i ++)
                Rs.push_back(F[i] == 0);
        return Rs;

}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1152 KB Output is correct
2 Correct 7 ms 1408 KB Output is correct
3 Correct 7 ms 1280 KB Output is correct
4 Correct 6 ms 1280 KB Output is correct
5 Correct 6 ms 1280 KB Output is correct
6 Correct 6 ms 1280 KB Output is correct
7 Correct 5 ms 1280 KB Output is correct
8 Correct 6 ms 1280 KB Output is correct
9 Correct 6 ms 1280 KB Output is correct
10 Correct 6 ms 1280 KB Output is correct
11 Correct 5 ms 1280 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 1 ms 640 KB Output is correct
3 Correct 1 ms 640 KB Output is correct
4 Correct 1 ms 640 KB Output is correct
5 Correct 1 ms 640 KB Output is correct
6 Correct 1 ms 620 KB Output is correct
7 Correct 1 ms 640 KB Output is correct
8 Correct 1 ms 640 KB Output is correct
9 Correct 1 ms 640 KB Output is correct
10 Correct 1 ms 640 KB Output is correct
11 Correct 1 ms 640 KB Output is correct
12 Correct 1 ms 640 KB Output is correct
13 Correct 1 ms 640 KB Output is correct
14 Correct 1 ms 640 KB Output is correct
15 Correct 1 ms 640 KB Output is correct
16 Correct 1 ms 640 KB Output is correct
17 Correct 1 ms 640 KB Output is correct
18 Correct 1 ms 640 KB Output is correct
19 Correct 1 ms 640 KB Output is correct
20 Correct 1 ms 640 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 1624 KB Output is correct
2 Correct 175 ms 1788 KB Output is correct
3 Correct 250 ms 1784 KB Output is correct
4 Correct 12 ms 1792 KB Output is correct
5 Correct 11 ms 1792 KB Output is correct
6 Correct 12 ms 1792 KB Output is correct
7 Correct 11 ms 1784 KB Output is correct
8 Correct 10 ms 1792 KB Output is correct
9 Correct 9 ms 1664 KB Output is correct
10 Correct 10 ms 1664 KB Output is correct
11 Correct 10 ms 1664 KB Output is correct
12 Correct 9 ms 1664 KB Output is correct
13 Correct 11 ms 1792 KB Output is correct
14 Correct 15 ms 1696 KB Output is correct
15 Correct 11 ms 1792 KB Output is correct
16 Correct 11 ms 1664 KB Output is correct
17 Correct 11 ms 1792 KB Output is correct
18 Correct 392 ms 1364 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1408 KB Output is correct
2 Correct 9 ms 1408 KB Output is correct
3 Correct 11 ms 1568 KB Output is correct
4 Correct 11 ms 1536 KB Output is correct
5 Correct 11 ms 1536 KB Output is correct
6 Correct 10 ms 1536 KB Output is correct
7 Correct 10 ms 1536 KB Output is correct
8 Correct 14 ms 1408 KB Output is correct
9 Correct 9 ms 1408 KB Output is correct
10 Correct 15 ms 1536 KB Output is correct
11 Correct 10 ms 1536 KB Output is correct
12 Correct 16 ms 1536 KB Output is correct
13 Correct 11 ms 1536 KB Output is correct
14 Correct 10 ms 1408 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1536 KB Output is correct
2 Correct 11 ms 1440 KB Output is correct
3 Correct 16 ms 1536 KB Output is correct
4 Correct 10 ms 1408 KB Output is correct
5 Correct 1 ms 640 KB Output is correct
6 Correct 5 ms 1152 KB Output is correct
7 Correct 6 ms 1152 KB Output is correct
8 Correct 8 ms 1152 KB Output is correct
9 Correct 7 ms 1280 KB Output is correct
10 Correct 2 ms 768 KB Output is correct
11 Correct 7 ms 1280 KB Output is correct

Subtask #6
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1152 KB Output is correct
2 Correct 7 ms 1408 KB Output is correct
3 Correct 7 ms 1280 KB Output is correct
4 Correct 6 ms 1280 KB Output is correct
5 Correct 6 ms 1280 KB Output is correct
6 Correct 6 ms 1280 KB Output is correct
7 Correct 5 ms 1280 KB Output is correct
8 Correct 6 ms 1280 KB Output is correct
9 Correct 6 ms 1280 KB Output is correct
10 Correct 6 ms 1280 KB Output is correct
11 Correct 5 ms 1280 KB Output is correct
12 Correct 1 ms 640 KB Output is correct
13 Correct 1 ms 640 KB Output is correct
14 Correct 1 ms 640 KB Output is correct
15 Correct 1 ms 640 KB Output is correct
16 Correct 1 ms 640 KB Output is correct
17 Correct 1 ms 620 KB Output is correct
18 Correct 1 ms 640 KB Output is correct
19 Correct 1 ms 640 KB Output is correct
20 Correct 1 ms 640 KB Output is correct
21 Correct 1 ms 640 KB Output is correct
22 Correct 1 ms 640 KB Output is correct
23 Correct 1 ms 640 KB Output is correct
24 Correct 1 ms 640 KB Output is correct
25 Correct 1 ms 640 KB Output is correct
26 Correct 1 ms 640 KB Output is correct
27 Correct 1 ms 640 KB Output is correct
28 Correct 1 ms 640 KB Output is correct
29 Correct 1 ms 640 KB Output is correct
30 Correct 1 ms 640 KB Output is correct
31 Correct 1 ms 640 KB Output is correct
32 Correct 86 ms 1624 KB Output is correct
33 Correct 175 ms 1788 KB Output is correct
34 Correct 250 ms 1784 KB Output is correct
35 Correct 12 ms 1792 KB Output is correct
36 Correct 11 ms 1792 KB Output is correct
37 Correct 12 ms 1792 KB Output is correct
38 Correct 11 ms 1784 KB Output is correct
39 Correct 10 ms 1792 KB Output is correct
40 Correct 9 ms 1664 KB Output is correct
41 Correct 10 ms 1664 KB Output is correct
42 Correct 10 ms 1664 KB Output is correct
43 Correct 9 ms 1664 KB Output is correct
44 Correct 11 ms 1792 KB Output is correct
45 Correct 15 ms 1696 KB Output is correct
46 Correct 11 ms 1792 KB Output is correct
47 Correct 11 ms 1664 KB Output is correct
48 Correct 11 ms 1792 KB Output is correct
49 Correct 392 ms 1364 KB Output is correct
50 Correct 10 ms 1408 KB Output is correct
51 Correct 9 ms 1408 KB Output is correct
52 Correct 11 ms 1568 KB Output is correct
53 Correct 11 ms 1536 KB Output is correct
54 Correct 11 ms 1536 KB Output is correct
55 Correct 10 ms 1536 KB Output is correct
56 Correct 10 ms 1536 KB Output is correct
57 Correct 14 ms 1408 KB Output is correct
58 Correct 9 ms 1408 KB Output is correct
59 Correct 15 ms 1536 KB Output is correct
60 Correct 10 ms 1536 KB Output is correct
61 Correct 16 ms 1536 KB Output is correct
62 Correct 11 ms 1536 KB Output is correct
63 Correct 10 ms 1408 KB Output is correct
64 Correct 11 ms 1536 KB Output is correct
65 Correct 11 ms 1440 KB Output is correct
66 Correct 16 ms 1536 KB Output is correct
67 Correct 10 ms 1408 KB Output is correct
68 Correct 1 ms 640 KB Output is correct
69 Correct 5 ms 1152 KB Output is correct
70 Correct 6 ms 1152 KB Output is correct
71 Correct 8 ms 1152 KB Output is correct
72 Correct 7 ms 1280 KB Output is correct
73 Correct 2 ms 768 KB Output is correct
74 Correct 7 ms 1280 KB Output is correct
75 Correct 149 ms 1784 KB Output is correct
76 Correct 245 ms 1772 KB Output is correct
77 Correct 326 ms 1756 KB Output is correct
78 Correct 330 ms 1788 KB Output is correct
79 Correct 328 ms 1784 KB Output is correct
80 Correct 11 ms 1664 KB Output is correct
81 Correct 15 ms 1792 KB Output is correct
82 Correct 12 ms 1792 KB Output is correct
83 Correct 12 ms 1792 KB Output is correct
84 Correct 15 ms 1792 KB Output is correct
85 Correct 12 ms 1664 KB Output is correct
86 Correct 12 ms 1792 KB Output is correct
87 Correct 13 ms 1792 KB Output is correct
88 Correct 14 ms 1792 KB Output is correct
89 Correct 11 ms 1792 KB Output is correct
90 Correct 18 ms 1792 KB Output is correct
91 Correct 23 ms 1792 KB Output is correct
92 Correct 32 ms 1788 KB Output is correct
93 Correct 38 ms 1784 KB Output is correct
94 Correct 38 ms 1784 KB Output is correct
95 Correct 33 ms 1792 KB Output is correct
96 Correct 83 ms 1656 KB Output is correct
97 Correct 390 ms 1784 KB Output is correct
98 Correct 587 ms 1692 KB Output is correct
99 Correct 624 ms 1900 KB Output is correct
100 Correct 394 ms 1400 KB Output is correct