oj.uz

답안 #607431

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
607431 2022-07-26T17:18:05 Z JeanBombeur 장난감 기차 (IOI17_train) C++17
100 / 100
 289 ms 1236 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 CurNodes[MAX_NOEUDS];
int sz = 0;
int Copy[MAX_NOEUDS];
int szCopy = 0;

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 = 0; i < sz; i ++)
    {
        int id = CurNodes[i];
        Calc[id] = false;
        Pris[id] = false;
        Deg[id] = DegI[id];
    }
    return;
}
 
void Add(int noeud) {
    if (Calc[noeud])
        return;
    Calc[noeud] = true;
    int _sz = Remonte[noeud].size();
    for (int i = 0; i < _sz; i ++)
    {
        int dest = Remonte[noeud][i];
        if (!Pris[dest] && (Arezou[dest] || -- Deg[dest] == 0))
        {
            File[fin ++] = dest;
            Pris[dest] = true;
        }
    }
    return;
}

bool Bfs() {
    for (int i = 0; i < sz; i ++)
    {
        int id = CurNodes[i];
        if (DP[id] && Charge[id])
            Add(id);
    }
    while (deb < fin)
    {
        Add(File[deb ++]);
    }
    bool isOver = true;
    szCopy = 0;
    for (int i = 0; i < sz; i ++)
    {
        int id = CurNodes[i];
        if (DP[id] && !Pris[id])
        {
            DP[id] = false;
            isOver = false;
            Pris[id] = true;
        }
        else
            Copy[szCopy ++] = id;
    }
    for (int i = 0; i < szCopy; i ++)
    {
        CurNodes[i] = Copy[i];
    }
    sz = szCopy;
    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[sz ++] = i;
    }
    for (int i = 0; i < nbAretes; i ++)
    {
        Remonte[Right[i]].push_back(Left[i]);
        DegI[Left[i]] ++;
    }
    Reset();
    while (!Bfs())
        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 852 KB Output is correct
5 Correct 5 ms 852 KB Output is correct
6 Correct 5 ms 832 KB Output is correct
7 Correct 4 ms 852 KB Output is correct
8 Correct 5 ms 872 KB Output is correct
9 Correct 4 ms 852 KB Output is correct
10 Correct 4 ms 832 KB Output is correct
11 Correct 4 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 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 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 57 ms 1164 KB Output is correct
2 Correct 96 ms 1144 KB Output is correct
3 Correct 110 ms 1156 KB Output is correct
4 Correct 7 ms 1108 KB Output is correct
5 Correct 9 ms 1152 KB Output is correct
6 Correct 9 ms 1108 KB Output is correct
7 Correct 7 ms 1108 KB Output is correct
8 Correct 7 ms 1124 KB Output is correct
9 Correct 6 ms 1108 KB Output is correct
10 Correct 6 ms 1108 KB Output is correct
11 Correct 6 ms 1116 KB Output is correct
12 Correct 5 ms 1108 KB Output is correct
13 Correct 7 ms 1108 KB Output is correct
14 Correct 7 ms 1108 KB Output is correct
15 Correct 7 ms 1108 KB Output is correct
16 Correct 9 ms 1108 KB Output is correct
17 Correct 7 ms 1108 KB Output is correct
18 Correct 160 ms 920 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 980 KB Output is correct
2 Correct 6 ms 1108 KB Output is correct
3 Correct 6 ms 1108 KB Output is correct
4 Correct 7 ms 1116 KB Output is correct
5 Correct 6 ms 1128 KB Output is correct
6 Correct 7 ms 1108 KB Output is correct
7 Correct 7 ms 1108 KB Output is correct
8 Correct 7 ms 1108 KB Output is correct
9 Correct 7 ms 1108 KB Output is correct
10 Correct 6 ms 1108 KB Output is correct
11 Correct 7 ms 1108 KB Output is correct
12 Correct 6 ms 1108 KB Output is correct
13 Correct 6 ms 1108 KB Output is correct
14 Correct 7 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 8 ms 1236 KB Output is correct
3 Correct 7 ms 1132 KB Output is correct
4 Correct 6 ms 1108 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 3 ms 868 KB Output is correct
7 Correct 4 ms 852 KB Output is correct
8 Correct 5 ms 852 KB Output is correct
9 Correct 4 ms 852 KB Output is correct
10 Correct 2 ms 596 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 852 KB Output is correct
5 Correct 5 ms 852 KB Output is correct
6 Correct 5 ms 832 KB Output is correct
7 Correct 4 ms 852 KB Output is correct
8 Correct 5 ms 872 KB Output is correct
9 Correct 4 ms 852 KB Output is correct
10 Correct 4 ms 832 KB Output is correct
11 Correct 4 ms 852 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 468 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 57 ms 1164 KB Output is correct
33 Correct 96 ms 1144 KB Output is correct
34 Correct 110 ms 1156 KB Output is correct
35 Correct 7 ms 1108 KB Output is correct
36 Correct 9 ms 1152 KB Output is correct
37 Correct 9 ms 1108 KB Output is correct
38 Correct 7 ms 1108 KB Output is correct
39 Correct 7 ms 1124 KB Output is correct
40 Correct 6 ms 1108 KB Output is correct
41 Correct 6 ms 1108 KB Output is correct
42 Correct 6 ms 1116 KB Output is correct
43 Correct 5 ms 1108 KB Output is correct
44 Correct 7 ms 1108 KB Output is correct
45 Correct 7 ms 1108 KB Output is correct
46 Correct 7 ms 1108 KB Output is correct
47 Correct 9 ms 1108 KB Output is correct
48 Correct 7 ms 1108 KB Output is correct
49 Correct 160 ms 920 KB Output is correct
50 Correct 5 ms 980 KB Output is correct
51 Correct 6 ms 1108 KB Output is correct
52 Correct 6 ms 1108 KB Output is correct
53 Correct 7 ms 1116 KB Output is correct
54 Correct 6 ms 1128 KB Output is correct
55 Correct 7 ms 1108 KB Output is correct
56 Correct 7 ms 1108 KB Output is correct
57 Correct 7 ms 1108 KB Output is correct
58 Correct 7 ms 1108 KB Output is correct
59 Correct 6 ms 1108 KB Output is correct
60 Correct 7 ms 1108 KB Output is correct
61 Correct 6 ms 1108 KB Output is correct
62 Correct 6 ms 1108 KB Output is correct
63 Correct 7 ms 1108 KB Output is correct
64 Correct 6 ms 1108 KB Output is correct
65 Correct 8 ms 1236 KB Output is correct
66 Correct 7 ms 1132 KB Output is correct
67 Correct 6 ms 1108 KB Output is correct
68 Correct 1 ms 468 KB Output is correct
69 Correct 3 ms 868 KB Output is correct
70 Correct 4 ms 852 KB Output is correct
71 Correct 5 ms 852 KB Output is correct
72 Correct 4 ms 852 KB Output is correct
73 Correct 2 ms 596 KB Output is correct
74 Correct 4 ms 852 KB Output is correct
75 Correct 113 ms 1144 KB Output is correct
76 Correct 140 ms 1108 KB Output is correct
77 Correct 155 ms 1144 KB Output is correct
78 Correct 157 ms 1144 KB Output is correct
79 Correct 157 ms 1108 KB Output is correct
80 Correct 7 ms 1108 KB Output is correct
81 Correct 7 ms 1108 KB Output is correct
82 Correct 7 ms 1108 KB Output is correct
83 Correct 9 ms 1108 KB Output is correct
84 Correct 8 ms 1140 KB Output is correct
85 Correct 7 ms 1108 KB Output is correct
86 Correct 9 ms 1168 KB Output is correct
87 Correct 7 ms 1108 KB Output is correct
88 Correct 12 ms 1108 KB Output is correct
89 Correct 7 ms 1108 KB Output is correct
90 Correct 14 ms 1140 KB Output is correct
91 Correct 16 ms 1236 KB Output is correct
92 Correct 26 ms 1136 KB Output is correct
93 Correct 23 ms 1128 KB Output is correct
94 Correct 21 ms 1132 KB Output is correct
95 Correct 25 ms 1120 KB Output is correct
96 Correct 58 ms 1076 KB Output is correct
97 Correct 162 ms 1124 KB Output is correct
98 Correct 289 ms 1104 KB Output is correct
99 Correct 286 ms 1100 KB Output is correct
100 Correct 150 ms 912 KB Output is correct