oj.uz

Submission #659763

# Submission time Handle Problem Language Result Execution time Memory
659763 2022-11-19T08:51:04 Z fatemetmhr Newspapers (CEOI21_newspapers) C++17
54 / 100
 64 ms 6896 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;
bool mark[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);
    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;
    }
    cout << 2 * (n - 2) << endl;
    for(int i = 1; i < n - 1; i++)
        cout << av[i] + 1 << ' ';
    for(int i = n - 2; i >= 1; i--)
        cout << av[i] + 1 << ' ';
    cout << endl;
}

Subtask #1
6.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 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 1 ms 2644 KB Failed to provide a successful strategy.
9 Correct 1 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 1 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 1 ms 2644 KB Output is correct
17 Correct 1 ms 2644 KB Output is correct
18 Correct 1 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 1 ms 2644 KB Output is correct
21 Correct 1 ms 2644 KB Output is correct
22 Correct 1 ms 2644 KB Output is correct
23 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
24 Correct 1 ms 2644 KB Output is correct
25 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
26 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
27 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
28 Correct 1 ms 2644 KB Output is correct
29 Correct 2 ms 2644 KB Output is correct
30 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
31 Correct 2 ms 2556 KB Output is correct
32 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
33 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
34 Correct 2 ms 2644 KB Output is correct
35 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
36 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
37 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
38 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
39 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
40 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
41 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
42 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
43 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
44 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
45 Correct 1 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 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
49 Correct 1 ms 2644 KB Output is correct
50 Correct 1 ms 2644 KB Output is correct
51 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
52 Correct 1 ms 2644 KB Output is correct
53 Correct 2 ms 2644 KB Output is correct
54 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
55 Correct 2 ms 2644 KB Output is correct
56 Correct 1 ms 2644 KB Output is correct
57 Correct 2 ms 2644 KB Output is correct
58 Correct 1 ms 2644 KB Output is correct
59 Correct 2 ms 2644 KB Output is correct
60 Correct 2 ms 2644 KB Output is correct
61 Correct 1 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2656 KB Output is correct
2 Correct 2 ms 2656 KB Output is correct
3 Correct 1 ms 2656 KB Output is correct
4 Correct 2 ms 2656 KB Output is correct
5 Correct 2 ms 2656 KB Output is correct
6 Correct 2 ms 2656 KB Output is correct
7 Correct 2 ms 2656 KB Output is correct
8 Correct 2 ms 2656 KB Output is correct
9 Correct 1 ms 2656 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct
11 Correct 2 ms 2780 KB Output is correct
12 Correct 2 ms 2648 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 3 ms 2644 KB Output is correct
16 Correct 2 ms 2772 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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 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 1 ms 2644 KB Failed to provide a successful strategy.
9 Correct 1 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 1 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 1 ms 2644 KB Output is correct
17 Correct 1 ms 2644 KB Output is correct
18 Correct 1 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 1 ms 2644 KB Output is correct
21 Correct 1 ms 2644 KB Output is correct
22 Correct 1 ms 2644 KB Output is correct
23 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
24 Correct 1 ms 2644 KB Output is correct
25 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
26 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
27 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
28 Correct 1 ms 2644 KB Output is correct
29 Correct 2 ms 2644 KB Output is correct
30 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
31 Correct 2 ms 2556 KB Output is correct
32 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
33 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
34 Correct 2 ms 2644 KB Output is correct
35 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
36 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
37 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
38 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
39 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
40 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
41 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
42 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
43 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
44 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
45 Correct 1 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 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
49 Correct 1 ms 2644 KB Output is correct
50 Correct 1 ms 2644 KB Output is correct
51 Partially correct 1 ms 2644 KB Failed to provide a successful strategy.
52 Correct 1 ms 2644 KB Output is correct
53 Correct 2 ms 2644 KB Output is correct
54 Partially correct 2 ms 2644 KB Failed to provide a successful strategy.
55 Correct 2 ms 2644 KB Output is correct
56 Correct 1 ms 2644 KB Output is correct
57 Correct 2 ms 2644 KB Output is correct
58 Correct 1 ms 2644 KB Output is correct
59 Correct 2 ms 2644 KB Output is correct
60 Correct 2 ms 2644 KB Output is correct
61 Correct 1 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 1 ms 2644 KB Output is correct
66 Correct 1 ms 2644 KB Output is correct
67 Correct 2 ms 2644 KB Output is correct
68 Correct 2 ms 2648 KB Output is correct
69 Correct 2 ms 2648 KB Output is correct
70 Correct 2 ms 2648 KB Output is correct
71 Correct 2 ms 2648 KB Output is correct
72 Partially correct 1 ms 2648 KB Failed to provide a successful strategy.
73 Correct 2 ms 2652 KB Output is correct
74 Partially correct 1 ms 2648 KB Failed to provide a successful strategy.
75 Correct 2 ms 2644 KB Output is correct
76 Partially correct 2 ms 2652 KB Failed to provide a successful strategy.
77 Correct 2 ms 2656 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 2644 KB Output is correct
81 Correct 2 ms 2644 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 2648 KB Output is correct
85 Correct 2 ms 2648 KB Output is correct
86 Correct 1 ms 2644 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 2644 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 2644 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 2644 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 2644 KB Failed to provide a successful strategy.
129 Correct 2 ms 2644 KB Output is correct
130 Correct 1 ms 2644 KB Output is correct
131 Correct 2 ms 2644 KB Output is correct
132 Correct 2 ms 2600 KB Output is correct
133 Correct 2 ms 2644 KB Output is correct
134 Correct 13 ms 3560 KB Output is correct
135 Correct 13 ms 3732 KB Output is correct
136 Correct 29 ms 6092 KB Output is correct
137 Correct 20 ms 4560 KB Output is correct
138 Correct 33 ms 5216 KB Output is correct
139 Correct 60 ms 6896 KB Output is correct
140 Correct 9 ms 3284 KB Output is correct
141 Correct 4 ms 2900 KB Output is correct
142 Correct 52 ms 6736 KB Output is correct
143 Correct 64 ms 6752 KB Output is correct
144 Correct 2 ms 2772 KB Output is correct
145 Correct 2 ms 2772 KB Output is correct