oj.uz

답안 #616016

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
616016 2022-07-31T18:07:06 Z JeanBombeur 장난감 기차 (IOI17_train) C++17
100 / 100
 291 ms 1192 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];
 
vector <int> CurNodes;
 
int DegI[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 : CurNodes)
    {
        Calc[i] = false;
        Pris[i] = false;
        Deg[i] = DegI[i];
    }
    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 rebuild) {
    for (int i : CurNodes)
    {
        if (DP[i] && Charge[i])
            Add(i);
    }
    while (deb < fin)
    {
        Add(File[deb ++]);
    }
    bool isOver = true;
    vector <int> nv;
    for (int i : CurNodes)
    {
        if (DP[i] && !Pris[i])
        {
            DP[i] = false;
            isOver = false;
            Pris[i] = true;
        }
        else
            nv.push_back(i);
    }
    CurNodes = nv;
    if (!rebuild)
    {
        for (int i : CurNodes)
        {
            nv.clear();
            for (int dest : Remonte[i])
                if (DP[dest])
                    nv.push_back(dest);
            Remonte[i] = nv;
        }
    }
    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];
        DP[i] = true;
        CurNodes.push_back(i);
    }
    for (int i = 0; i < nbAretes; i ++)
    {
        Remonte[Right[i]].push_back(Left[i]);
        DegI[Left[i]] ++;
    }
    int cnt = 0;
    Reset();
    while (!Bfs((++ cnt) % 30))
        Reset();
        
    vector <int> Ans;
    for (int i = 0; i < nbNoeuds; i ++)
    {
        Ans.push_back(DP[i]);
    }
	return Ans;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 1108 KB Output is correct
2 Correct 100 ms 1180 KB Output is correct
3 Correct 118 ms 1184 KB Output is correct
4 Correct 6 ms 1108 KB Output is correct
5 Correct 9 ms 1108 KB Output is correct
6 Correct 7 ms 1108 KB Output is correct
7 Correct 6 ms 1108 KB Output is correct
8 Correct 6 ms 1108 KB Output is correct
9 Correct 5 ms 1108 KB Output is correct
10 Correct 5 ms 1108 KB Output is correct
11 Correct 5 ms 1108 KB Output is correct
12 Correct 6 ms 1036 KB Output is correct
13 Correct 6 ms 1108 KB Output is correct
14 Correct 6 ms 1108 KB Output is correct
15 Correct 6 ms 1192 KB Output is correct
16 Correct 6 ms 1132 KB Output is correct
17 Correct 6 ms 1108 KB Output is correct
18 Correct 157 ms 952 KB Output is correct

Subtask #4
11.0 / 11.0

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

Subtask #5
12.0 / 12.0

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

Subtask #6
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 852 KB Output is correct
2 Correct 5 ms 852 KB Output is correct
3 Correct 5 ms 852 KB Output is correct
4 Correct 5 ms 932 KB Output is correct
5 Correct 5 ms 852 KB Output is correct
6 Correct 5 ms 852 KB Output is correct
7 Correct 4 ms 852 KB Output is correct
8 Correct 5 ms 904 KB Output is correct
9 Correct 4 ms 852 KB Output is correct
10 Correct 3 ms 852 KB Output is correct
11 Correct 3 ms 852 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 60 ms 1108 KB Output is correct
33 Correct 100 ms 1180 KB Output is correct
34 Correct 118 ms 1184 KB Output is correct
35 Correct 6 ms 1108 KB Output is correct
36 Correct 9 ms 1108 KB Output is correct
37 Correct 7 ms 1108 KB Output is correct
38 Correct 6 ms 1108 KB Output is correct
39 Correct 6 ms 1108 KB Output is correct
40 Correct 5 ms 1108 KB Output is correct
41 Correct 5 ms 1108 KB Output is correct
42 Correct 5 ms 1108 KB Output is correct
43 Correct 6 ms 1036 KB Output is correct
44 Correct 6 ms 1108 KB Output is correct
45 Correct 6 ms 1108 KB Output is correct
46 Correct 6 ms 1192 KB Output is correct
47 Correct 6 ms 1132 KB Output is correct
48 Correct 6 ms 1108 KB Output is correct
49 Correct 157 ms 952 KB Output is correct
50 Correct 5 ms 980 KB Output is correct
51 Correct 7 ms 1072 KB Output is correct
52 Correct 6 ms 1108 KB Output is correct
53 Correct 7 ms 1108 KB Output is correct
54 Correct 7 ms 1108 KB Output is correct
55 Correct 6 ms 1108 KB Output is correct
56 Correct 6 ms 1108 KB Output is correct
57 Correct 7 ms 1108 KB Output is correct
58 Correct 7 ms 1112 KB Output is correct
59 Correct 6 ms 1120 KB Output is correct
60 Correct 7 ms 1136 KB Output is correct
61 Correct 6 ms 1108 KB Output is correct
62 Correct 6 ms 1108 KB Output is correct
63 Correct 5 ms 1108 KB Output is correct
64 Correct 6 ms 1108 KB Output is correct
65 Correct 6 ms 1108 KB Output is correct
66 Correct 6 ms 1108 KB Output is correct
67 Correct 5 ms 1064 KB Output is correct
68 Correct 1 ms 468 KB Output is correct
69 Correct 3 ms 852 KB Output is correct
70 Correct 4 ms 852 KB Output is correct
71 Correct 4 ms 852 KB Output is correct
72 Correct 4 ms 852 KB Output is correct
73 Correct 2 ms 468 KB Output is correct
74 Correct 4 ms 852 KB Output is correct
75 Correct 113 ms 1152 KB Output is correct
76 Correct 134 ms 1184 KB Output is correct
77 Correct 166 ms 1180 KB Output is correct
78 Correct 161 ms 1180 KB Output is correct
79 Correct 171 ms 1188 KB Output is correct
80 Correct 9 ms 1140 KB Output is correct
81 Correct 6 ms 1132 KB Output is correct
82 Correct 8 ms 1108 KB Output is correct
83 Correct 8 ms 1128 KB Output is correct
84 Correct 8 ms 1180 KB Output is correct
85 Correct 10 ms 1108 KB Output is correct
86 Correct 9 ms 1132 KB Output is correct
87 Correct 6 ms 1108 KB Output is correct
88 Correct 10 ms 1180 KB Output is correct
89 Correct 7 ms 1108 KB Output is correct
90 Correct 16 ms 1108 KB Output is correct
91 Correct 15 ms 1180 KB Output is correct
92 Correct 28 ms 1108 KB Output is correct
93 Correct 22 ms 1108 KB Output is correct
94 Correct 23 ms 1108 KB Output is correct
95 Correct 25 ms 1108 KB Output is correct
96 Correct 58 ms 1108 KB Output is correct
97 Correct 166 ms 1108 KB Output is correct
98 Correct 280 ms 1144 KB Output is correct
99 Correct 291 ms 1132 KB Output is correct
100 Correct 162 ms 852 KB Output is correct