oj.uz

답안 #832653

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
832653 2023-08-21T13:01:49 Z finn__ 장난감 기차 (IOI17_train) C++17
100 / 100
 282 ms 1324 KB 
#include "train.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v)
{
    size_t const n = a.size(), m = u.size();

    vector<vector<int>> rg(n);
    vector<int> degree(n);
    for (size_t i = 0; i < m; ++i)
        rg[v[i]].push_back(u[i]), degree[u[i]]++;
    vector<bool> deleted(n);

    auto reaching_set = [&](vector<int> const &s, bool who)
    {
        vector<bool> in_the_set(n);
        vector<int> degree_to_the_set(n);
        queue<int> q;
        for (int const &u : s)
            in_the_set[u] = 1, q.push(u);

        while (!q.empty())
        {
            auto const u = q.front();
            q.pop();

            for (auto const &v : rg[u])
                if (!deleted[v] && !in_the_set[v])
                {
                    if (a[v] != who)
                        degree_to_the_set[v]++;
                    if (a[v] == who || degree_to_the_set[v] == degree[v])
                    {
                        in_the_set[v] = 1;
                        q.push(v);
                    }
                }
        }

        return in_the_set;
    };

    size_t l = n;
    vector<int> w(n);
    while (l)
    {
        vector<int> charge_stations;
        for (int i = 0; i < n; ++i)
            if (!deleted[i] && r[i])
                charge_stations.push_back(i);
        auto reaches_charge = reaching_set(charge_stations, 1);

        if (count(reaches_charge.begin(), reaches_charge.end(), 1) == l)
        {
            for (int i = 0; i < n; ++i)
                if (!deleted[i])
                    w[i] = 1;
            break;
        }

        vector<int> doesnt_reach_charge;
        for (int i = 0; i < n; ++i)
            if (!deleted[i] && !reaches_charge[i])
                doesnt_reach_charge.push_back(i);
        auto winning_for_b = reaching_set(doesnt_reach_charge, 0);
        for (int i = 0; i < n; ++i)
            if (winning_for_b[i])
            {
                deleted[i] = 1;
                --l;
                for (auto const &v : rg[i])
                    degree[v]--;
            }
    }

    return w;
}

Compilation message

train.cpp: In function 'std::vector<int> who_wins(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:49:27: warning: comparison of integer expressions of different signedness: 'int' and 'const size_t' {aka 'const long unsigned int'} [-Wsign-compare]
   49 |         for (int i = 0; i < n; ++i)
      |                         ~~^~~
train.cpp:54:68: warning: comparison of integer expressions of different signedness: 'std::__iterator_traits<std::_Bit_iterator, void>::difference_type' {aka 'long int'} and 'size_t' {aka 'long unsigned int'} [-Wsign-compare]
   54 |         if (count(reaches_charge.begin(), reaches_charge.end(), 1) == l)
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
train.cpp:56:31: warning: comparison of integer expressions of different signedness: 'int' and 'const size_t' {aka 'const long unsigned int'} [-Wsign-compare]
   56 |             for (int i = 0; i < n; ++i)
      |                             ~~^~~
train.cpp:63:27: warning: comparison of integer expressions of different signedness: 'int' and 'const size_t' {aka 'const long unsigned int'} [-Wsign-compare]
   63 |         for (int i = 0; i < n; ++i)
      |                         ~~^~~
train.cpp:67:27: warning: comparison of integer expressions of different signedness: 'int' and 'const size_t' {aka 'const long unsigned int'} [-Wsign-compare]
   67 |         for (int i = 0; i < n; ++i)
      |                         ~~^~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 852 KB Output is correct
2 Correct 4 ms 852 KB Output is correct
3 Correct 3 ms 852 KB Output is correct
4 Correct 3 ms 852 KB Output is correct
5 Correct 3 ms 820 KB Output is correct
6 Correct 3 ms 852 KB Output is correct
7 Correct 3 ms 860 KB Output is correct
8 Correct 3 ms 852 KB Output is correct
9 Correct 3 ms 852 KB Output is correct
10 Correct 3 ms 820 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 300 KB Output is correct
2 Correct 0 ms 300 KB Output is correct
3 Correct 0 ms 220 KB Output is correct
4 Correct 1 ms 216 KB Output is correct
5 Correct 0 ms 216 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 296 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 300 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 216 KB Output is correct
20 Correct 1 ms 212 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 1296 KB Output is correct
2 Correct 84 ms 1236 KB Output is correct
3 Correct 107 ms 1236 KB Output is correct
4 Correct 5 ms 1216 KB Output is correct
5 Correct 6 ms 1236 KB Output is correct
6 Correct 6 ms 1236 KB Output is correct
7 Correct 5 ms 1240 KB Output is correct
8 Correct 5 ms 1208 KB Output is correct
9 Correct 5 ms 1236 KB Output is correct
10 Correct 5 ms 1236 KB Output is correct
11 Correct 5 ms 1236 KB Output is correct
12 Correct 4 ms 1236 KB Output is correct
13 Correct 5 ms 1236 KB Output is correct
14 Correct 5 ms 1236 KB Output is correct
15 Correct 5 ms 1236 KB Output is correct
16 Correct 5 ms 1208 KB Output is correct
17 Correct 5 ms 1236 KB Output is correct
18 Correct 143 ms 980 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1108 KB Output is correct
2 Correct 5 ms 1096 KB Output is correct
3 Correct 5 ms 1204 KB Output is correct
4 Correct 5 ms 1216 KB Output is correct
5 Correct 6 ms 1208 KB Output is correct
6 Correct 5 ms 1196 KB Output is correct
7 Correct 5 ms 1236 KB Output is correct
8 Correct 5 ms 1208 KB Output is correct
9 Correct 5 ms 1164 KB Output is correct
10 Correct 8 ms 1204 KB Output is correct
11 Correct 7 ms 1236 KB Output is correct
12 Correct 5 ms 1236 KB Output is correct
13 Correct 11 ms 1236 KB Output is correct
14 Correct 5 ms 1172 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1212 KB Output is correct
2 Correct 5 ms 1244 KB Output is correct
3 Correct 5 ms 1252 KB Output is correct
4 Correct 5 ms 1096 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 3 ms 852 KB Output is correct
7 Correct 3 ms 828 KB Output is correct
8 Correct 4 ms 852 KB Output is correct
9 Correct 4 ms 852 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 3 ms 820 KB Output is correct

Subtask #6
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 852 KB Output is correct
2 Correct 4 ms 852 KB Output is correct
3 Correct 3 ms 852 KB Output is correct
4 Correct 3 ms 852 KB Output is correct
5 Correct 3 ms 820 KB Output is correct
6 Correct 3 ms 852 KB Output is correct
7 Correct 3 ms 860 KB Output is correct
8 Correct 3 ms 852 KB Output is correct
9 Correct 3 ms 852 KB Output is correct
10 Correct 3 ms 820 KB Output is correct
11 Correct 3 ms 852 KB Output is correct
12 Correct 1 ms 300 KB Output is correct
13 Correct 0 ms 300 KB Output is correct
14 Correct 0 ms 220 KB Output is correct
15 Correct 1 ms 216 KB Output is correct
16 Correct 0 ms 216 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 296 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 300 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 216 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 47 ms 1296 KB Output is correct
33 Correct 84 ms 1236 KB Output is correct
34 Correct 107 ms 1236 KB Output is correct
35 Correct 5 ms 1216 KB Output is correct
36 Correct 6 ms 1236 KB Output is correct
37 Correct 6 ms 1236 KB Output is correct
38 Correct 5 ms 1240 KB Output is correct
39 Correct 5 ms 1208 KB Output is correct
40 Correct 5 ms 1236 KB Output is correct
41 Correct 5 ms 1236 KB Output is correct
42 Correct 5 ms 1236 KB Output is correct
43 Correct 4 ms 1236 KB Output is correct
44 Correct 5 ms 1236 KB Output is correct
45 Correct 5 ms 1236 KB Output is correct
46 Correct 5 ms 1236 KB Output is correct
47 Correct 5 ms 1208 KB Output is correct
48 Correct 5 ms 1236 KB Output is correct
49 Correct 143 ms 980 KB Output is correct
50 Correct 4 ms 1108 KB Output is correct
51 Correct 5 ms 1096 KB Output is correct
52 Correct 5 ms 1204 KB Output is correct
53 Correct 5 ms 1216 KB Output is correct
54 Correct 6 ms 1208 KB Output is correct
55 Correct 5 ms 1196 KB Output is correct
56 Correct 5 ms 1236 KB Output is correct
57 Correct 5 ms 1208 KB Output is correct
58 Correct 5 ms 1164 KB Output is correct
59 Correct 8 ms 1204 KB Output is correct
60 Correct 7 ms 1236 KB Output is correct
61 Correct 5 ms 1236 KB Output is correct
62 Correct 11 ms 1236 KB Output is correct
63 Correct 5 ms 1172 KB Output is correct
64 Correct 5 ms 1212 KB Output is correct
65 Correct 5 ms 1244 KB Output is correct
66 Correct 5 ms 1252 KB Output is correct
67 Correct 5 ms 1096 KB Output is correct
68 Correct 1 ms 340 KB Output is correct
69 Correct 3 ms 852 KB Output is correct
70 Correct 3 ms 828 KB Output is correct
71 Correct 4 ms 852 KB Output is correct
72 Correct 4 ms 852 KB Output is correct
73 Correct 1 ms 468 KB Output is correct
74 Correct 3 ms 820 KB Output is correct
75 Correct 96 ms 1276 KB Output is correct
76 Correct 115 ms 1316 KB Output is correct
77 Correct 158 ms 1316 KB Output is correct
78 Correct 146 ms 1324 KB Output is correct
79 Correct 152 ms 1236 KB Output is correct
80 Correct 5 ms 1236 KB Output is correct
81 Correct 6 ms 1212 KB Output is correct
82 Correct 6 ms 1208 KB Output is correct
83 Correct 6 ms 1236 KB Output is correct
84 Correct 6 ms 1236 KB Output is correct
85 Correct 6 ms 1236 KB Output is correct
86 Correct 6 ms 1236 KB Output is correct
87 Correct 7 ms 1236 KB Output is correct
88 Correct 7 ms 1236 KB Output is correct
89 Correct 6 ms 1236 KB Output is correct
90 Correct 10 ms 1236 KB Output is correct
91 Correct 8 ms 1212 KB Output is correct
92 Correct 14 ms 1236 KB Output is correct
93 Correct 15 ms 1236 KB Output is correct
94 Correct 16 ms 1236 KB Output is correct
95 Correct 16 ms 1312 KB Output is correct
96 Correct 53 ms 1292 KB Output is correct
97 Correct 169 ms 1312 KB Output is correct
98 Correct 282 ms 1276 KB Output is correct
99 Correct 249 ms 1288 KB Output is correct
100 Correct 149 ms 980 KB Output is correct