oj.uz

답안 #659770

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
659770 2022-11-19T09:00:39 Z fatemetmhr Newspapers (CEOI21_newspapers) C++17
54 / 100
 59 ms 6920 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
 
#define pb     push_back
#define fi     first
#define se     second
#define all(x) x.begin(), x.end()
 
const int maxn5 = 1e5 + 10;
 
vector <int> adj[maxn5], av, out;
bool mark[maxn5], good[maxn5];
int h[maxn5];
bool re = true;
 
void dfs(int v, int par){
    for(auto u : adj[v]) if(u != par){
        h[u] = h[v] + 1;
        dfs(u, v);
    }
}
 
bool dfs_set_mark(int v, int w, int par){
    if(v == w){
        av.pb(w);
        mark[w] = true;
        return true;
    }
    bool re = false;
    for(auto u : adj[v]) if(u != par){
        re |= dfs_set_mark(u, w, v);
    }
    if(re){
        mark[v] = true;
        av.pb(v);
    }
    return re;
}

void dfs_check(int v){
    mark[v] = true;
    if(h[v] > 2)
        re = false;
    for(auto u : adj[v]) if(!mark[u]){
        h[u] = h[v] + 1;
        dfs_check(u);
    }
}
 
int main(){
    ios_base::sync_with_stdio(false); cin.tie(0);
 
    int n, m; cin >> n >> m;
    for(int i = 0; i < m; i++){
        int a, b; cin >> a >> b;
        a--; b--;
        adj[a].pb(b);
        adj[b].pb(a);
    }
    if(m != n - 1){
        return cout << "NO" << endl, 0;
    }
    dfs(0, -1);
    int d1 = 0;
    for(int i = 0; i < n; i++) if(h[i] > h[d1])
        d1 = i;
    h[d1] = 0;
    dfs(d1, -1);
    int d2 = 0;
    for(int i = 0; i < n; i++) if(h[i] > h[d2])
        d2 = i;
    dfs_set_mark(d1, d2, -1);
    for(int i = 0; i < n; i++) if(mark[i])
        good[i] = true;
    re = true;
    for(int i = 0; i < n; i++) if(mark[i]){
        h[i] = 0;
        dfs_check(i);
    }
    if(!re)
        return cout << "NO\n", 0;
    cout << "YES\n";
    //cout << "its " << d1 << ' ' << d2 << endl;
    n = av.size();
    if(n == 1){
        return cout << 1 << '\n' << av[0] + 1 << endl, 0;
    }
    if(n == 2){
        return cout << 2 << '\n' << av[0] + 1 << ' ' << av[0] + 1 << endl, 0;
    }
    for(int i = 0; i < n; i++)
        mark[i] = good[i];
    int id = 1;
    while(id < av.size() - 1){
        out.pb(av[id]);
        for(auto u : adj[av[id]]) if(adj[u].size() > 1 && !mark[u]){
            out.pb(u);
            out.pb(av[id]);
        }
        id++;
    }
    cout << out.size() * 2 << endl;
    for(auto u : out)
        cout << u + 1 << ' ';
    while(out.size()){
        cout << out.back() + 1 << ' ';
        out.pop_back();
    }
    cout << endl;
}

Compilation message

newspapers.cpp: In function 'int main()':
newspapers.cpp:97:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |     while(id < av.size() - 1){
      |           ~~~^~~~~~~~~~~~~~~

Subtask #1
6.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
9 Correct 2 ms 2644 KB Output is correct
10 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
11 Correct 1 ms 2644 KB Output is correct
12 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 1 ms 2600 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 1 ms 2644 KB Output is correct
21 Correct 2 ms 2644 KB Output is correct
22 Correct 1 ms 2644 KB Output is correct
23 Correct 1 ms 2644 KB Output is correct
24 Correct 1 ms 2644 KB Output is correct
25 Correct 1 ms 2644 KB Output is correct
26 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
27 Correct 2 ms 2644 KB Output is correct
28 Correct 2 ms 2644 KB Output is correct
29 Correct 2 ms 2644 KB Output is correct
30 Correct 1 ms 2644 KB Output is correct
31 Correct 1 ms 2644 KB Output is correct
32 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
33 Correct 1 ms 2644 KB Output is correct
34 Correct 1 ms 2644 KB Output is correct
35 Correct 1 ms 2644 KB Output is correct
36 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
37 Correct 1 ms 2644 KB Output is correct
38 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
39 Correct 2 ms 2644 KB Output is correct
40 Correct 1 ms 2644 KB Output is correct
41 Correct 1 ms 2644 KB Output is correct
42 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
43 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
44 Correct 1 ms 2644 KB Output is correct
45 Correct 3 ms 2644 KB Output is correct
46 Correct 1 ms 2644 KB Output is correct
47 Correct 1 ms 2644 KB Output is correct
48 Correct 2 ms 2644 KB Output is correct
49 Correct 1 ms 2644 KB Output is correct
50 Correct 1 ms 2644 KB Output is correct
51 Correct 1 ms 2644 KB Output is correct
52 Correct 2 ms 2644 KB Output is correct
53 Correct 1 ms 2588 KB Output is correct
54 Correct 1 ms 2644 KB Output is correct
55 Correct 2 ms 2644 KB Output is correct
56 Correct 2 ms 2644 KB Output is correct
57 Correct 1 ms 2644 KB Output is correct
58 Correct 2 ms 2644 KB Output is correct
59 Correct 1 ms 2644 KB Output is correct
60 Correct 1 ms 2644 KB Output is correct
61 Correct 2 ms 2644 KB Output is correct
62 Correct 2 ms 2644 KB Output is correct
63 Correct 1 ms 2644 KB Output is correct
64 Correct 1 ms 2644 KB Output is correct

Subtask #2
8.0 / 8.0

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

Subtask #3
40.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
9 Correct 2 ms 2644 KB Output is correct
10 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
11 Correct 1 ms 2644 KB Output is correct
12 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 1 ms 2600 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 1 ms 2644 KB Output is correct
21 Correct 2 ms 2644 KB Output is correct
22 Correct 1 ms 2644 KB Output is correct
23 Correct 1 ms 2644 KB Output is correct
24 Correct 1 ms 2644 KB Output is correct
25 Correct 1 ms 2644 KB Output is correct
26 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
27 Correct 2 ms 2644 KB Output is correct
28 Correct 2 ms 2644 KB Output is correct
29 Correct 2 ms 2644 KB Output is correct
30 Correct 1 ms 2644 KB Output is correct
31 Correct 1 ms 2644 KB Output is correct
32 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
33 Correct 1 ms 2644 KB Output is correct
34 Correct 1 ms 2644 KB Output is correct
35 Correct 1 ms 2644 KB Output is correct
36 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
37 Correct 1 ms 2644 KB Output is correct
38 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
39 Correct 2 ms 2644 KB Output is correct
40 Correct 1 ms 2644 KB Output is correct
41 Correct 1 ms 2644 KB Output is correct
42 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
43 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
44 Correct 1 ms 2644 KB Output is correct
45 Correct 3 ms 2644 KB Output is correct
46 Correct 1 ms 2644 KB Output is correct
47 Correct 1 ms 2644 KB Output is correct
48 Correct 2 ms 2644 KB Output is correct
49 Correct 1 ms 2644 KB Output is correct
50 Correct 1 ms 2644 KB Output is correct
51 Correct 1 ms 2644 KB Output is correct
52 Correct 2 ms 2644 KB Output is correct
53 Correct 1 ms 2588 KB Output is correct
54 Correct 1 ms 2644 KB Output is correct
55 Correct 2 ms 2644 KB Output is correct
56 Correct 2 ms 2644 KB Output is correct
57 Correct 1 ms 2644 KB Output is correct
58 Correct 2 ms 2644 KB Output is correct
59 Correct 1 ms 2644 KB Output is correct
60 Correct 1 ms 2644 KB Output is correct
61 Correct 2 ms 2644 KB Output is correct
62 Correct 2 ms 2644 KB Output is correct
63 Correct 1 ms 2644 KB Output is correct
64 Correct 1 ms 2644 KB Output is correct
65 Correct 2 ms 2644 KB Output is correct
66 Correct 1 ms 2644 KB Output is correct
67 Correct 1 ms 2644 KB Output is correct
68 Correct 2 ms 2644 KB Output is correct
69 Correct 2 ms 2592 KB Output is correct
70 Correct 1 ms 2644 KB Output is correct
71 Correct 2 ms 2644 KB Output is correct
72 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
73 Correct 1 ms 2644 KB Output is correct
74 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
75 Correct 2 ms 2644 KB Output is correct
76 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
77 Correct 2 ms 2644 KB Output is correct
78 Correct 1 ms 2644 KB Output is correct
79 Correct 2 ms 2644 KB Output is correct
80 Correct 2 ms 2712 KB Output is correct
81 Correct 2 ms 2716 KB Output is correct
82 Correct 2 ms 2644 KB Output is correct
83 Correct 2 ms 2644 KB Output is correct
84 Correct 2 ms 2644 KB Output is correct
85 Correct 2 ms 2644 KB Output is correct
86 Correct 2 ms 2760 KB Output is correct
87 Correct 2 ms 2644 KB Output is correct
88 Correct 2 ms 2644 KB Output is correct
89 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
90 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
91 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
92 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
93 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
94 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
95 Partially correct 2 ms 2772 KB Failed to provide a successful strategy.
96 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
97 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
98 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
99 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
100 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
101 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
102 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
103 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
104 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
105 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
106 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
107 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
108 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
109 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
110 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
111 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
112 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
113 Partially correct 2 ms 2772 KB Failed to provide a successful strategy.
114 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
115 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
116 Partially correct 2 ms 2700 KB Failed to provide a successful strategy.
117 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
118 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
119 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
120 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
121 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
122 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
123 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
124 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
125 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
126 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
127 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
128 Partially correct 2 ms 2772 KB Failed to provide a successful strategy.
129 Correct 2 ms 2644 KB Output is correct
130 Correct 2 ms 2644 KB Output is correct
131 Correct 2 ms 2644 KB Output is correct
132 Correct 2 ms 2620 KB Output is correct
133 Correct 2 ms 2644 KB Output is correct
134 Correct 14 ms 3544 KB Output is correct
135 Correct 15 ms 3668 KB Output is correct
136 Correct 29 ms 6100 KB Output is correct
137 Correct 19 ms 4564 KB Output is correct
138 Correct 32 ms 5144 KB Output is correct
139 Correct 55 ms 6860 KB Output is correct
140 Correct 9 ms 3284 KB Output is correct
141 Correct 4 ms 2900 KB Output is correct
142 Correct 54 ms 6920 KB Output is correct
143 Correct 59 ms 6732 KB Output is correct
144 Correct 2 ms 2772 KB Output is correct
145 Correct 2 ms 2772 KB Output is correct