oj.uz

답안 #287599

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
287599 2020-08-31T20:56:27 Z evpipis 장난감 기차 (IOI17_train) C++11
100 / 100
 1018 ms 1664 KB 
#include <bits/stdc++.h>
#include "train.h"

using namespace std;

#define pb push_back
typedef vector<int> vi;

const int len = 5005;
int vis[len], block[len], bel[len], deg[len], n;
vector<int> adj[len];

void print(vi vec){
    for (int i = 0; i < vec.size(); i++)
        printf(" %d", vec[i]);
    printf("\n");
}

vi operator-(vi a, vi b){
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());

    vi res;
    for (int i = 0, j = 0; i < a.size(); i++){
        while (j < b.size() && b[j] < a[i])
            j++;

        if (j == b.size() || b[j] > a[i])
            res.pb(a[i]);
    }

    return res;
}

vi func(int sub, vi base){
    //printf("ins func: sub = %d, base =", sub), print(base);
    for (int u = 0; u < n; u++)
        vis[u] = deg[u] = 0;
    for (int u = 0; u < n; u++){
        if (block[u]) continue;

        for (auto v: adj[u])
            if (!block[v])
                deg[v]++;
    }

    //for (int u = 0; u  < n; u++)
      //  printf("u = %d, deg = %d\n", u, deg[u]);

    queue<int> myq;
    for (auto u: base)
        vis[u] = 1, myq.push(u);

    while (!myq.empty()){
        int u = myq.front();
        myq.pop();

        for (auto v: adj[u]){
            if (block[v] || vis[v])
                continue;

            if (bel[v] == sub)
                vis[v] = 1, myq.push(v);
            else{
                deg[v]--;
                if (!deg[v])
                    vis[v] = 1, myq.push(v);
            }
        }
    }

    vi res;
    for (int i = 0; i < n; i++)
        if (!block[i] && vis[i])
            res.pb(i);
    //printf("and res ="), print(res);
    return res;
}

vi who_wins(vi B, vi spec, vi U, vi V) {
    n = B.size();

    for (int i = 0; i < U.size(); i++){
        int a = U[i], b = V[i];
        adj[b].pb(a);
    }

    vi graph;
    for (int i = 0; i < n; i++)
        graph.pb(i), block[i] = 0, bel[i] = B[i];

    while (!graph.empty()){
        vi reach, rest;

        for (auto u: graph)
            if (spec[u])
                reach.pb(u);

        reach = func(1, reach);
        rest = func(0, graph-reach);

        /*printf("graph:"), print(graph);
        printf("reach:"), print(reach);
        printf("rest:"), print(rest);*/

        if (rest.size() == 0)
            break;

        for (auto u: rest)
            block[u] = 1;
        graph = graph-rest;
    }

    vi res(n, 0);
    for (auto u: graph)
        res[u] = 1;
	return res;
}
/*
3 6
1 0 0
0 1 0
0 0
0 1
1 0
1 2
2 2
2 1

5 9
1 1 1 1 1
0 0 0 0 0
0 0
0 1
1 0
1 2
1 3
2 2
3 0
4 2
4 3
*/

Compilation message

train.cpp: In function 'void print(vi)':
train.cpp:14:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |     for (int i = 0; i < vec.size(); i++)
      |                     ~~^~~~~~~~~~~~
train.cpp: In function 'vi operator-(vi, vi)':
train.cpp:24:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |     for (int i = 0, j = 0; i < a.size(); i++){
      |                            ~~^~~~~~~~~~
train.cpp:25:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |         while (j < b.size() && b[j] < a[i])
      |                ~~^~~~~~~~~~
train.cpp:28:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |         if (j == b.size() || b[j] > a[i])
      |             ~~^~~~~~~~~~~
train.cpp: In function 'vi who_wins(vi, vi, vi, vi)':
train.cpp:83:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |     for (int i = 0; i < U.size(); i++){
      |                     ~~^~~~~~~~~~
train.cpp:115:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  115 |     for (auto u: graph)
      |     ^~~
train.cpp:117:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  117 |  return res;
      |  ^~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 287 ms 1656 KB Output is correct
2 Correct 515 ms 1536 KB Output is correct
3 Correct 663 ms 1616 KB Output is correct
4 Correct 10 ms 1504 KB Output is correct
5 Correct 11 ms 1532 KB Output is correct
6 Correct 12 ms 1408 KB Output is correct
7 Correct 11 ms 1408 KB Output is correct
8 Correct 10 ms 1408 KB Output is correct
9 Correct 9 ms 1440 KB Output is correct
10 Correct 10 ms 1536 KB Output is correct
11 Correct 9 ms 1408 KB Output is correct
12 Correct 9 ms 1408 KB Output is correct
13 Correct 10 ms 1408 KB Output is correct
14 Correct 10 ms 1536 KB Output is correct
15 Correct 9 ms 1408 KB Output is correct
16 Correct 12 ms 1408 KB Output is correct
17 Correct 9 ms 1408 KB Output is correct
18 Correct 815 ms 1272 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 1280 KB Output is correct
2 Correct 9 ms 1408 KB Output is correct
3 Correct 10 ms 1400 KB Output is correct
4 Correct 10 ms 1512 KB Output is correct
5 Correct 11 ms 1408 KB Output is correct
6 Correct 10 ms 1408 KB Output is correct
7 Correct 10 ms 1408 KB Output is correct
8 Correct 11 ms 1408 KB Output is correct
9 Correct 9 ms 1408 KB Output is correct
10 Correct 9 ms 1408 KB Output is correct
11 Correct 9 ms 1520 KB Output is correct
12 Correct 9 ms 1408 KB Output is correct
13 Correct 10 ms 1408 KB Output is correct
14 Correct 9 ms 1408 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 1408 KB Output is correct
2 Correct 10 ms 1408 KB Output is correct
3 Correct 11 ms 1536 KB Output is correct
4 Correct 9 ms 1408 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 5 ms 1024 KB Output is correct
7 Correct 6 ms 1024 KB Output is correct
8 Correct 7 ms 1152 KB Output is correct
9 Correct 7 ms 1024 KB Output is correct
10 Correct 2 ms 640 KB Output is correct
11 Correct 6 ms 1024 KB Output is correct

Subtask #6
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 1024 KB Output is correct
2 Correct 8 ms 1060 KB Output is correct
3 Correct 8 ms 1020 KB Output is correct
4 Correct 7 ms 1024 KB Output is correct
5 Correct 6 ms 1024 KB Output is correct
6 Correct 7 ms 1024 KB Output is correct
7 Correct 5 ms 1024 KB Output is correct
8 Correct 8 ms 1144 KB Output is correct
9 Correct 6 ms 1024 KB Output is correct
10 Correct 6 ms 1024 KB Output is correct
11 Correct 5 ms 1024 KB Output is correct
12 Correct 0 ms 512 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 1 ms 512 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 1 ms 512 KB Output is correct
22 Correct 1 ms 512 KB Output is correct
23 Correct 1 ms 512 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 512 KB Output is correct
26 Correct 0 ms 512 KB Output is correct
27 Correct 1 ms 512 KB Output is correct
28 Correct 1 ms 512 KB Output is correct
29 Correct 1 ms 512 KB Output is correct
30 Correct 1 ms 512 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 287 ms 1656 KB Output is correct
33 Correct 515 ms 1536 KB Output is correct
34 Correct 663 ms 1616 KB Output is correct
35 Correct 10 ms 1504 KB Output is correct
36 Correct 11 ms 1532 KB Output is correct
37 Correct 12 ms 1408 KB Output is correct
38 Correct 11 ms 1408 KB Output is correct
39 Correct 10 ms 1408 KB Output is correct
40 Correct 9 ms 1440 KB Output is correct
41 Correct 10 ms 1536 KB Output is correct
42 Correct 9 ms 1408 KB Output is correct
43 Correct 9 ms 1408 KB Output is correct
44 Correct 10 ms 1408 KB Output is correct
45 Correct 10 ms 1536 KB Output is correct
46 Correct 9 ms 1408 KB Output is correct
47 Correct 12 ms 1408 KB Output is correct
48 Correct 9 ms 1408 KB Output is correct
49 Correct 815 ms 1272 KB Output is correct
50 Correct 8 ms 1280 KB Output is correct
51 Correct 9 ms 1408 KB Output is correct
52 Correct 10 ms 1400 KB Output is correct
53 Correct 10 ms 1512 KB Output is correct
54 Correct 11 ms 1408 KB Output is correct
55 Correct 10 ms 1408 KB Output is correct
56 Correct 10 ms 1408 KB Output is correct
57 Correct 11 ms 1408 KB Output is correct
58 Correct 9 ms 1408 KB Output is correct
59 Correct 9 ms 1408 KB Output is correct
60 Correct 9 ms 1520 KB Output is correct
61 Correct 9 ms 1408 KB Output is correct
62 Correct 10 ms 1408 KB Output is correct
63 Correct 9 ms 1408 KB Output is correct
64 Correct 11 ms 1408 KB Output is correct
65 Correct 10 ms 1408 KB Output is correct
66 Correct 11 ms 1536 KB Output is correct
67 Correct 9 ms 1408 KB Output is correct
68 Correct 1 ms 512 KB Output is correct
69 Correct 5 ms 1024 KB Output is correct
70 Correct 6 ms 1024 KB Output is correct
71 Correct 7 ms 1152 KB Output is correct
72 Correct 7 ms 1024 KB Output is correct
73 Correct 2 ms 640 KB Output is correct
74 Correct 6 ms 1024 KB Output is correct
75 Correct 428 ms 1428 KB Output is correct
76 Correct 541 ms 1656 KB Output is correct
77 Correct 698 ms 1604 KB Output is correct
78 Correct 701 ms 1664 KB Output is correct
79 Correct 695 ms 1536 KB Output is correct
80 Correct 10 ms 1512 KB Output is correct
81 Correct 10 ms 1408 KB Output is correct
82 Correct 12 ms 1408 KB Output is correct
83 Correct 11 ms 1532 KB Output is correct
84 Correct 12 ms 1532 KB Output is correct
85 Correct 11 ms 1408 KB Output is correct
86 Correct 12 ms 1532 KB Output is correct
87 Correct 10 ms 1408 KB Output is correct
88 Correct 16 ms 1524 KB Output is correct
89 Correct 11 ms 1408 KB Output is correct
90 Correct 21 ms 1508 KB Output is correct
91 Correct 19 ms 1516 KB Output is correct
92 Correct 38 ms 1536 KB Output is correct
93 Correct 41 ms 1520 KB Output is correct
94 Correct 39 ms 1512 KB Output is correct
95 Correct 42 ms 1512 KB Output is correct
96 Correct 155 ms 1408 KB Output is correct
97 Correct 607 ms 1656 KB Output is correct
98 Correct 958 ms 1508 KB Output is correct
99 Correct 1018 ms 1408 KB Output is correct
100 Correct 816 ms 1152 KB Output is correct