oj.uz

Submission #427553

# Submission time Handle Problem Language Result Execution time Memory
427553 2021-06-14T17:01:39 Z JeanBombeur Toy Train (IOI17_train) C++17
100 / 100
 629 ms 1356 KB 
#include <iostream>
#include <cstdio>
#include <vector>
#include "train.h"
using namespace std;

const int MAX_NOEUDS = (5000);

vector <int> Remonte[MAX_NOEUDS];

bool DP[MAX_NOEUDS];

bool Arezou[MAX_NOEUDS];
bool Charge[MAX_NOEUDS];

bool Calc[MAX_NOEUDS];
bool Pris[MAX_NOEUDS];

int Deg[MAX_NOEUDS];

int File[MAX_NOEUDS];
int deb = 0, fin = 0;

int nbNoeuds, nbAretes;

void Reset() {
    deb = 0, fin = 0;
    for (int i = 0; i < nbNoeuds; i ++)
    {
        Calc[i] = false;
        Pris[i] = false;
        Deg[i] = 0;
    }
    for (int i = 0; i < nbNoeuds; i ++)
    {
        for (int dest : Remonte[i])
            Deg[dest] ++;
    }
    return;
}

void Add(int noeud) {
    if (Calc[noeud])
        return;
    Calc[noeud] = true;
    for (int dest : Remonte[noeud])
    {
        if (!Pris[dest] && (Arezou[dest] || -- Deg[dest] == 0))
        {
            File[fin ++] = dest;
            Pris[dest] = true;
        }
    }
    return;
}

bool Bfs(bool first) {
    for (int i = 0; i < nbNoeuds; i ++)
    {
        if (DP[i] && Charge[i])
            Add(i);
    }
    while (deb < fin)
    {
        Add(File[deb ++]);
    }
    if (first)
    {
        for (int i = 0; i < nbNoeuds; i ++)
        {
            DP[i] = Pris[i];
        }
        return false;
    }
    bool isOver = true;
    for (int i = 0; i < nbNoeuds; i ++)
    {
        if (DP[i] && !Pris[i])
        {
            DP[i] = false;
            isOver = false;
        }
    }
    return isOver;
}

vector<int> who_wins(vector<int> Proprio, vector<int> Energie, vector<int> Left, vector<int> Right) {
    
    nbNoeuds = Proprio.size();
    nbAretes = Left.size();
    for (int i = 0; i < nbNoeuds; i ++)
    {
        Arezou[i] = Proprio[i];
        Charge[i] = Energie[i];
        if (Charge[i])
            DP[i] = true;
    }
    for (int i = 0; i < nbAretes; i ++)
    {
        Remonte[Right[i]].push_back(Left[i]);
    }
    Reset();
    Bfs(true);
    Reset();
    while (!Bfs(false))
        Reset();
        
    vector <int> Ans;
    for (int i = 0; i < nbNoeuds; i ++)
    {
        Ans.push_back(DP[i]);
    }
	return Ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 844 KB Output is correct
2 Correct 7 ms 844 KB Output is correct
3 Correct 9 ms 972 KB Output is correct
4 Correct 8 ms 896 KB Output is correct
5 Correct 7 ms 892 KB Output is correct
6 Correct 7 ms 844 KB Output is correct
7 Correct 8 ms 1100 KB Output is correct
8 Correct 7 ms 844 KB Output is correct
9 Correct 6 ms 844 KB Output is correct
10 Correct 5 ms 844 KB Output is correct
11 Correct 4 ms 844 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 1100 KB Output is correct
2 Correct 213 ms 1080 KB Output is correct
3 Correct 294 ms 1068 KB Output is correct
4 Correct 8 ms 1120 KB Output is correct
5 Correct 12 ms 1228 KB Output is correct
6 Correct 11 ms 1228 KB Output is correct
7 Correct 9 ms 1228 KB Output is correct
8 Correct 8 ms 1292 KB Output is correct
9 Correct 8 ms 1200 KB Output is correct
10 Correct 8 ms 1228 KB Output is correct
11 Correct 8 ms 1236 KB Output is correct
12 Correct 7 ms 1228 KB Output is correct
13 Correct 8 ms 1228 KB Output is correct
14 Correct 12 ms 1356 KB Output is correct
15 Correct 10 ms 1228 KB Output is correct
16 Correct 9 ms 1324 KB Output is correct
17 Correct 8 ms 1232 KB Output is correct
18 Correct 369 ms 1028 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 972 KB Output is correct
2 Correct 11 ms 1176 KB Output is correct
3 Correct 8 ms 1208 KB Output is correct
4 Correct 10 ms 1272 KB Output is correct
5 Correct 8 ms 1320 KB Output is correct
6 Correct 9 ms 1228 KB Output is correct
7 Correct 9 ms 1228 KB Output is correct
8 Correct 8 ms 1228 KB Output is correct
9 Correct 9 ms 1228 KB Output is correct
10 Correct 9 ms 1356 KB Output is correct
11 Correct 9 ms 1228 KB Output is correct
12 Correct 9 ms 1356 KB Output is correct
13 Correct 11 ms 1336 KB Output is correct
14 Correct 10 ms 1168 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1100 KB Output is correct
2 Correct 11 ms 1228 KB Output is correct
3 Correct 8 ms 1228 KB Output is correct
4 Correct 8 ms 1228 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 4 ms 844 KB Output is correct
7 Correct 5 ms 928 KB Output is correct
8 Correct 6 ms 972 KB Output is correct
9 Correct 6 ms 972 KB Output is correct
10 Correct 2 ms 588 KB Output is correct
11 Correct 5 ms 972 KB Output is correct

Subtask #6
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 844 KB Output is correct
2 Correct 7 ms 844 KB Output is correct
3 Correct 9 ms 972 KB Output is correct
4 Correct 8 ms 896 KB Output is correct
5 Correct 7 ms 892 KB Output is correct
6 Correct 7 ms 844 KB Output is correct
7 Correct 8 ms 1100 KB Output is correct
8 Correct 7 ms 844 KB Output is correct
9 Correct 6 ms 844 KB Output is correct
10 Correct 5 ms 844 KB Output is correct
11 Correct 4 ms 844 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 420 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 392 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 420 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 420 KB Output is correct
28 Correct 1 ms 416 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 416 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 113 ms 1100 KB Output is correct
33 Correct 213 ms 1080 KB Output is correct
34 Correct 294 ms 1068 KB Output is correct
35 Correct 8 ms 1120 KB Output is correct
36 Correct 12 ms 1228 KB Output is correct
37 Correct 11 ms 1228 KB Output is correct
38 Correct 9 ms 1228 KB Output is correct
39 Correct 8 ms 1292 KB Output is correct
40 Correct 8 ms 1200 KB Output is correct
41 Correct 8 ms 1228 KB Output is correct
42 Correct 8 ms 1236 KB Output is correct
43 Correct 7 ms 1228 KB Output is correct
44 Correct 8 ms 1228 KB Output is correct
45 Correct 12 ms 1356 KB Output is correct
46 Correct 10 ms 1228 KB Output is correct
47 Correct 9 ms 1324 KB Output is correct
48 Correct 8 ms 1232 KB Output is correct
49 Correct 369 ms 1028 KB Output is correct
50 Correct 9 ms 972 KB Output is correct
51 Correct 11 ms 1176 KB Output is correct
52 Correct 8 ms 1208 KB Output is correct
53 Correct 10 ms 1272 KB Output is correct
54 Correct 8 ms 1320 KB Output is correct
55 Correct 9 ms 1228 KB Output is correct
56 Correct 9 ms 1228 KB Output is correct
57 Correct 8 ms 1228 KB Output is correct
58 Correct 9 ms 1228 KB Output is correct
59 Correct 9 ms 1356 KB Output is correct
60 Correct 9 ms 1228 KB Output is correct
61 Correct 9 ms 1356 KB Output is correct
62 Correct 11 ms 1336 KB Output is correct
63 Correct 10 ms 1168 KB Output is correct
64 Correct 8 ms 1100 KB Output is correct
65 Correct 11 ms 1228 KB Output is correct
66 Correct 8 ms 1228 KB Output is correct
67 Correct 8 ms 1228 KB Output is correct
68 Correct 1 ms 460 KB Output is correct
69 Correct 4 ms 844 KB Output is correct
70 Correct 5 ms 928 KB Output is correct
71 Correct 6 ms 972 KB Output is correct
72 Correct 6 ms 972 KB Output is correct
73 Correct 2 ms 588 KB Output is correct
74 Correct 5 ms 972 KB Output is correct
75 Correct 189 ms 1264 KB Output is correct
76 Correct 256 ms 1300 KB Output is correct
77 Correct 340 ms 1276 KB Output is correct
78 Correct 361 ms 1296 KB Output is correct
79 Correct 335 ms 1280 KB Output is correct
80 Correct 9 ms 1236 KB Output is correct
81 Correct 9 ms 1228 KB Output is correct
82 Correct 13 ms 1228 KB Output is correct
83 Correct 11 ms 1328 KB Output is correct
84 Correct 11 ms 1228 KB Output is correct
85 Correct 12 ms 1228 KB Output is correct
86 Correct 13 ms 1332 KB Output is correct
87 Correct 9 ms 1228 KB Output is correct
88 Correct 18 ms 1228 KB Output is correct
89 Correct 9 ms 1268 KB Output is correct
90 Correct 23 ms 1228 KB Output is correct
91 Correct 27 ms 1280 KB Output is correct
92 Correct 45 ms 1284 KB Output is correct
93 Correct 37 ms 1264 KB Output is correct
94 Correct 39 ms 1228 KB Output is correct
95 Correct 55 ms 1276 KB Output is correct
96 Correct 90 ms 1312 KB Output is correct
97 Correct 362 ms 1268 KB Output is correct
98 Correct 585 ms 1240 KB Output is correct
99 Correct 629 ms 1228 KB Output is correct
100 Correct 362 ms 972 KB Output is correct