oj.uz

답안 #291094

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
291094 2020-09-04T16:34:35 Z alexandra_udristoiu Split the Attractions (IOI19_split) C++14
100 / 100
 176 ms 17784 KB 
#include "split.h"
#include<vector>
#define DIM 100005
using namespace std;
static int viz[DIM], t[DIM], ind[5], d[DIM], e[DIM], niv[DIM];
static vector<int> v[DIM], sol;
static void dfs(int nod){
    d[nod] = 1;
    e[nod] = niv[nod];
    viz[nod] = 1;
    for(int i = 0; i < v[nod].size(); i++){
        int vecin = v[nod][i];
        if(viz[vecin] == 0){
            niv[vecin] = niv[nod] + 1;
            t[vecin] = nod;
            dfs(vecin);
            d[nod] += d[vecin];
            e[nod] = min(e[nod], e[vecin]);
        }
        else if(vecin != t[nod]){
            e[nod] = min(e[nod], niv[vecin]);
        }
    }
}
static void dfs2(int nod, int ind, int &s, int nr){
    if(s < nr){
        sol[nod] = ind;
        s++;
    }
    else{
        return;
    }
    for(int i = 0; i < v[nod].size(); i++){
        int vecin = v[nod][i];
        if(t[vecin] == nod){
            dfs2(vecin, ind, s, nr);
        }
    }
}
static void dfs3(int nod, int ind, int &s, int nr){
    if(s < nr){
        sol[nod] = ind;
        s++;
    }
    else{
        return;
    }
    for(int i = 0; i < v[nod].size(); i++){
        int vecin = v[nod][i];
        if(sol[vecin] == 0){
            dfs3(vecin, ind, s, nr);
        }
    }
}

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
    int i, j, sum, ok, sa, sb, nod, jj;
    ind[1] = 1;
    ind[2] = 2;
    ind[3] = 3;
    if(a > b){
        swap(a, b);
        swap(ind[1], ind[2]);
    }
    if(a > c){
        swap(a, c);
        swap(ind[1], ind[3]);
    }
    if(b > c){
        swap(b, c);
        swap(ind[2], ind[3]);
    }
    for(i = 0; i < p.size(); i++){
        v[ p[i] ].push_back(q[i]);
        v[ q[i] ].push_back(p[i]);
    }
    t[0] = -1;
    dfs(0);
    ok = 0;
    sol.resize(n);
    for(i = 1; i < n && ok == 0; i++){
        sum = d[i];
        for(j = 0; j < v[i].size(); j++){
            if(sum >= a && n - sum >= b){
                ok = 1;
                break;
            }
            nod = v[i][j];
            if(t[nod] == i && e[nod] < niv[i]){
                sum -= d[nod];
            }
        }
        if(ok == 1){
            sa = 1;
            sb = 0;
            sol[i] = ind[1];
            for(jj = 0; jj < v[i].size(); jj++){
                nod = v[i][jj];
                if(t[nod] == i){
                    if(jj >= j || e[nod] >= niv[i]){
                        dfs2(nod, ind[1], sa, a);
                    }
                }
            }
            dfs3(t[i], ind[2], sb, b);
            continue;
        }

        sum = d[i];
        for(j = 0; j < v[i].size(); j++){
            if(sum >= b && n - sum >= a){
                ok = 1;
                break;
            }
            nod = v[i][j];
            if(t[nod] == i && e[nod] < niv[i]){
                sum -= d[nod];
            }
        }
        if(ok == 1){
            sb = 1;
            sa = 0;
            sol[i] = ind[2];
            for(jj = 0; jj < v[i].size(); jj++){
                nod = v[i][jj];
                if(t[nod] == i){
                    if(jj >= j || e[nod] >= niv[i]){
                        dfs2(nod, ind[2], sb, b);
                    }
                }
            }
            dfs3(t[i], ind[1], sa, a);
        }
    }
    if(ok == 1){
        for(i = 0; i < n; i++){
            if(sol[i] == 0){
                sol[i] = ind[3];
            }
        }
    }
    return sol;
}

Compilation message

split.cpp: In function 'void dfs(int)':
split.cpp:11:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |     for(int i = 0; i < v[nod].size(); i++){
      |                    ~~^~~~~~~~~~~~~~~
split.cpp: In function 'void dfs2(int, int, int&, int)':
split.cpp:33:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |     for(int i = 0; i < v[nod].size(); i++){
      |                    ~~^~~~~~~~~~~~~~~
split.cpp: In function 'void dfs3(int, int, int&, int)':
split.cpp:48:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     for(int i = 0; i < v[nod].size(); i++){
      |                    ~~^~~~~~~~~~~~~~~
split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:73:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |     for(i = 0; i < p.size(); i++){
      |                ~~^~~~~~~~~~
split.cpp:83:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |         for(j = 0; j < v[i].size(); j++){
      |                    ~~^~~~~~~~~~~~~
split.cpp:97:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |             for(jj = 0; jj < v[i].size(); jj++){
      |                         ~~~^~~~~~~~~~~~~
split.cpp:110:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  110 |         for(j = 0; j < v[i].size(); j++){
      |                    ~~^~~~~~~~~~~~~
split.cpp:124:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  124 |             for(jj = 0; jj < v[i].size(); jj++){
      |                         ~~~^~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2688 KB ok, correct split
2 Correct 2 ms 2688 KB ok, correct split
3 Correct 2 ms 2688 KB ok, correct split
4 Correct 2 ms 2688 KB ok, correct split
5 Correct 2 ms 2688 KB ok, correct split
6 Correct 2 ms 2688 KB ok, correct split
7 Correct 113 ms 15224 KB ok, correct split
8 Correct 103 ms 14092 KB ok, correct split
9 Correct 102 ms 13432 KB ok, correct split
10 Correct 94 ms 15480 KB ok, correct split
11 Correct 107 ms 15608 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2688 KB ok, correct split
2 Correct 2 ms 2688 KB ok, correct split
3 Correct 2 ms 2688 KB ok, correct split
4 Correct 116 ms 14108 KB ok, correct split
5 Correct 85 ms 10872 KB ok, correct split
6 Correct 98 ms 15608 KB ok, correct split
7 Correct 108 ms 13820 KB ok, correct split
8 Correct 136 ms 13176 KB ok, correct split
9 Correct 92 ms 10872 KB ok, correct split
10 Correct 62 ms 11124 KB ok, correct split
11 Correct 61 ms 11124 KB ok, correct split
12 Correct 61 ms 11120 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2688 KB ok, correct split
2 Correct 92 ms 10824 KB ok, correct split
3 Correct 28 ms 6136 KB ok, correct split
4 Correct 2 ms 2688 KB ok, correct split
5 Correct 119 ms 12792 KB ok, correct split
6 Correct 106 ms 12664 KB ok, correct split
7 Correct 107 ms 12152 KB ok, correct split
8 Correct 120 ms 12824 KB ok, correct split
9 Correct 105 ms 12152 KB ok, correct split
10 Correct 25 ms 5496 KB ok, no valid answer
11 Correct 38 ms 7032 KB ok, no valid answer
12 Correct 74 ms 10996 KB ok, no valid answer
13 Correct 91 ms 10872 KB ok, no valid answer
14 Correct 63 ms 11120 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2716 KB ok, correct split
2 Correct 2 ms 2688 KB ok, no valid answer
3 Correct 2 ms 2688 KB ok, correct split
4 Correct 2 ms 2688 KB ok, correct split
5 Correct 2 ms 2688 KB ok, correct split
6 Correct 2 ms 2688 KB ok, correct split
7 Correct 2 ms 2688 KB ok, correct split
8 Correct 2 ms 2688 KB ok, correct split
9 Correct 4 ms 2944 KB ok, correct split
10 Correct 4 ms 2944 KB ok, correct split
11 Correct 3 ms 2688 KB ok, correct split
12 Correct 4 ms 2944 KB ok, correct split
13 Correct 3 ms 2688 KB ok, correct split
14 Correct 2 ms 2688 KB ok, correct split
15 Correct 2 ms 2688 KB ok, correct split
16 Correct 2 ms 2688 KB ok, correct split
17 Correct 2 ms 2688 KB ok, correct split
18 Correct 2 ms 2688 KB ok, correct split
19 Correct 2 ms 2688 KB ok, correct split
20 Correct 3 ms 2816 KB ok, correct split
21 Correct 4 ms 2944 KB ok, correct split
22 Correct 4 ms 2944 KB ok, correct split
23 Correct 4 ms 2944 KB ok, correct split
24 Correct 4 ms 2944 KB ok, correct split
25 Correct 4 ms 2944 KB ok, correct split
26 Correct 4 ms 2944 KB ok, correct split
27 Correct 4 ms 2944 KB ok, correct split
28 Correct 4 ms 2944 KB ok, correct split
29 Correct 2 ms 2688 KB ok, correct split
30 Correct 4 ms 2944 KB ok, correct split
31 Correct 3 ms 2688 KB ok, correct split
32 Correct 2 ms 2688 KB ok, correct split
33 Correct 2 ms 2688 KB ok, correct split
34 Correct 4 ms 2944 KB ok, correct split
35 Correct 4 ms 2944 KB ok, correct split
36 Correct 4 ms 2816 KB ok, correct split
37 Correct 5 ms 2944 KB ok, correct split
38 Correct 5 ms 2944 KB ok, correct split
39 Correct 4 ms 2944 KB ok, correct split
40 Correct 4 ms 2944 KB ok, correct split
41 Correct 3 ms 2816 KB ok, correct split
42 Correct 3 ms 2816 KB ok, correct split
43 Correct 4 ms 2944 KB ok, correct split
44 Correct 4 ms 2944 KB ok, correct split
45 Correct 4 ms 2944 KB ok, correct split
46 Correct 3 ms 2944 KB ok, correct split
47 Correct 4 ms 2944 KB ok, no valid answer
48 Correct 4 ms 2944 KB ok, correct split
49 Correct 4 ms 2944 KB ok, correct split
50 Correct 2 ms 2688 KB ok, no valid answer
51 Correct 2 ms 2688 KB ok, no valid answer
52 Correct 3 ms 2944 KB ok, no valid answer
53 Correct 4 ms 2944 KB ok, no valid answer
54 Correct 3 ms 2944 KB ok, no valid answer
55 Correct 4 ms 2944 KB ok, no valid answer
56 Correct 4 ms 2944 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2688 KB ok, correct split
2 Correct 2 ms 2688 KB ok, correct split
3 Correct 2 ms 2688 KB ok, correct split
4 Correct 2 ms 2688 KB ok, correct split
5 Correct 2 ms 2688 KB ok, correct split
6 Correct 2 ms 2688 KB ok, correct split
7 Correct 113 ms 15224 KB ok, correct split
8 Correct 103 ms 14092 KB ok, correct split
9 Correct 102 ms 13432 KB ok, correct split
10 Correct 94 ms 15480 KB ok, correct split
11 Correct 107 ms 15608 KB ok, correct split
12 Correct 2 ms 2688 KB ok, correct split
13 Correct 2 ms 2688 KB ok, correct split
14 Correct 2 ms 2688 KB ok, correct split
15 Correct 116 ms 14108 KB ok, correct split
16 Correct 85 ms 10872 KB ok, correct split
17 Correct 98 ms 15608 KB ok, correct split
18 Correct 108 ms 13820 KB ok, correct split
19 Correct 136 ms 13176 KB ok, correct split
20 Correct 92 ms 10872 KB ok, correct split
21 Correct 62 ms 11124 KB ok, correct split
22 Correct 61 ms 11124 KB ok, correct split
23 Correct 61 ms 11120 KB ok, correct split
24 Correct 2 ms 2688 KB ok, correct split
25 Correct 92 ms 10824 KB ok, correct split
26 Correct 28 ms 6136 KB ok, correct split
27 Correct 2 ms 2688 KB ok, correct split
28 Correct 119 ms 12792 KB ok, correct split
29 Correct 106 ms 12664 KB ok, correct split
30 Correct 107 ms 12152 KB ok, correct split
31 Correct 120 ms 12824 KB ok, correct split
32 Correct 105 ms 12152 KB ok, correct split
33 Correct 25 ms 5496 KB ok, no valid answer
34 Correct 38 ms 7032 KB ok, no valid answer
35 Correct 74 ms 10996 KB ok, no valid answer
36 Correct 91 ms 10872 KB ok, no valid answer
37 Correct 63 ms 11120 KB ok, no valid answer
38 Correct 2 ms 2716 KB ok, correct split
39 Correct 2 ms 2688 KB ok, no valid answer
40 Correct 2 ms 2688 KB ok, correct split
41 Correct 2 ms 2688 KB ok, correct split
42 Correct 2 ms 2688 KB ok, correct split
43 Correct 2 ms 2688 KB ok, correct split
44 Correct 2 ms 2688 KB ok, correct split
45 Correct 2 ms 2688 KB ok, correct split
46 Correct 4 ms 2944 KB ok, correct split
47 Correct 4 ms 2944 KB ok, correct split
48 Correct 3 ms 2688 KB ok, correct split
49 Correct 4 ms 2944 KB ok, correct split
50 Correct 3 ms 2688 KB ok, correct split
51 Correct 2 ms 2688 KB ok, correct split
52 Correct 2 ms 2688 KB ok, correct split
53 Correct 2 ms 2688 KB ok, correct split
54 Correct 2 ms 2688 KB ok, correct split
55 Correct 2 ms 2688 KB ok, correct split
56 Correct 2 ms 2688 KB ok, correct split
57 Correct 3 ms 2816 KB ok, correct split
58 Correct 4 ms 2944 KB ok, correct split
59 Correct 4 ms 2944 KB ok, correct split
60 Correct 4 ms 2944 KB ok, correct split
61 Correct 4 ms 2944 KB ok, correct split
62 Correct 4 ms 2944 KB ok, correct split
63 Correct 4 ms 2944 KB ok, correct split
64 Correct 4 ms 2944 KB ok, correct split
65 Correct 4 ms 2944 KB ok, correct split
66 Correct 2 ms 2688 KB ok, correct split
67 Correct 4 ms 2944 KB ok, correct split
68 Correct 3 ms 2688 KB ok, correct split
69 Correct 2 ms 2688 KB ok, correct split
70 Correct 2 ms 2688 KB ok, correct split
71 Correct 4 ms 2944 KB ok, correct split
72 Correct 4 ms 2944 KB ok, correct split
73 Correct 4 ms 2816 KB ok, correct split
74 Correct 5 ms 2944 KB ok, correct split
75 Correct 5 ms 2944 KB ok, correct split
76 Correct 4 ms 2944 KB ok, correct split
77 Correct 4 ms 2944 KB ok, correct split
78 Correct 3 ms 2816 KB ok, correct split
79 Correct 3 ms 2816 KB ok, correct split
80 Correct 4 ms 2944 KB ok, correct split
81 Correct 4 ms 2944 KB ok, correct split
82 Correct 4 ms 2944 KB ok, correct split
83 Correct 3 ms 2944 KB ok, correct split
84 Correct 4 ms 2944 KB ok, no valid answer
85 Correct 4 ms 2944 KB ok, correct split
86 Correct 4 ms 2944 KB ok, correct split
87 Correct 2 ms 2688 KB ok, no valid answer
88 Correct 2 ms 2688 KB ok, no valid answer
89 Correct 3 ms 2944 KB ok, no valid answer
90 Correct 4 ms 2944 KB ok, no valid answer
91 Correct 3 ms 2944 KB ok, no valid answer
92 Correct 4 ms 2944 KB ok, no valid answer
93 Correct 4 ms 2944 KB ok, no valid answer
94 Correct 107 ms 13244 KB ok, correct split
95 Correct 176 ms 17784 KB ok, correct split
96 Correct 157 ms 16392 KB ok, correct split
97 Correct 29 ms 6144 KB ok, correct split
98 Correct 30 ms 6264 KB ok, correct split
99 Correct 52 ms 8440 KB ok, correct split
100 Correct 147 ms 15224 KB ok, correct split
101 Correct 135 ms 13944 KB ok, correct split
102 Correct 122 ms 13424 KB ok, correct split
103 Correct 111 ms 13296 KB ok, correct split
104 Correct 117 ms 14820 KB ok, correct split
105 Correct 50 ms 8192 KB ok, correct split
106 Correct 119 ms 14696 KB ok, correct split
107 Correct 89 ms 11384 KB ok, correct split
108 Correct 98 ms 11384 KB ok, correct split
109 Correct 152 ms 14712 KB ok, correct split
110 Correct 149 ms 14320 KB ok, correct split
111 Correct 140 ms 14448 KB ok, correct split
112 Correct 139 ms 14708 KB ok, correct split
113 Correct 139 ms 14704 KB ok, correct split
114 Correct 15 ms 4224 KB ok, correct split
115 Correct 12 ms 3968 KB ok, correct split
116 Correct 145 ms 14448 KB ok, correct split
117 Correct 133 ms 14192 KB ok, correct split
118 Correct 107 ms 11256 KB ok, correct split
119 Correct 101 ms 11384 KB ok, correct split
120 Correct 108 ms 13688 KB ok, correct split
121 Correct 89 ms 11384 KB ok, no valid answer
122 Correct 84 ms 11384 KB ok, no valid answer
123 Correct 156 ms 15272 KB ok, no valid answer
124 Correct 150 ms 15224 KB ok, no valid answer
125 Correct 97 ms 12708 KB ok, no valid answer
126 Correct 71 ms 10736 KB ok, no valid answer
127 Correct 117 ms 13040 KB ok, no valid answer