oj.uz

Submission #986262

# Submission time Handle Problem Language Result Execution time Memory
986262 2024-05-20T07:24:14 Z nextgenxing Newspapers (CEOI21_newspapers) C++14
77 / 100
 53 ms 21072 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define F0R(i, x) FOR(i, 0, x)
#define FORd(i, a, b) for(int i = (b)-1; i >= (a); i--)
#define F0Rd(i, x) FORd(i, 0, x)
#define ckif(a, b, c) ((c) ? (a) : (b))
const int MAX_N = 2e5+69;
const ll MOD = 1000000007;
const ll INF = 1e18;
 
int n, m;
vector<int> adj[MAX_N];
int anc[MAX_N][20], dep[MAX_N], vis[MAX_N];
pii mx[MAX_N], mx2[MAX_N];
pair<int, pii> diam[MAX_N];
 
bool dfs(int curr, int par = -1){
    vis[curr] = 1, mx[curr] = {0, curr};
    for(auto x : adj[curr]){
        if(x == par) continue;
        if(vis[x]) return false;
        anc[x][0] = curr;
        dep[x] = dep[curr]+1;
        if(!dfs(x, curr)) return false;
        if(mx[x].ff+1 >= mx[curr].ff) mx2[curr] = mx[curr], mx[curr] = mx[x], mx[curr].ff++;
        else if(mx[x].ff+1 >= mx2[curr].ff) mx2[curr] = mx[x], mx2[curr].ff++;
        if(diam[x].ff >= diam[curr].ff) diam[curr] = diam[x];
    }
    if(mx[curr].ff+mx2[curr].ff >= diam[curr].ff) diam[curr] = {mx[curr].ff+mx2[curr].ff, {mx[curr].ss, mx2[curr].ss}};
    return true;
}
 
int lca(int a, int b){
    if(dep[a] > dep[b]) swap(a, b);
    F0Rd(i, 20) if(dep[a]+(1 << i) <= dep[b])
        b = anc[b][i];
    if(a == b) return a;
    F0Rd(i, 20) if(anc[a][i] != anc[b][i])
        a = anc[a][i], b = anc[b][i];
    return anc[a][0];
}
 
int dist(int a, int b){
    return dep[a]+dep[b]-dep[lca(a, b)]*2;
}
 
int main(int argc, const char * argv[]){
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);
    cin >> n >> m;
    if(n == 1){
        cout << "YES\n";
        cout << "1\n1\n";
        return 0;
    }
    if(n == 2){
        cout << "YES\n";
        cout << "2\n1 1\n";
        return 0;
    }
    F0R(i, m){
        int a, b; cin >> a >> b; a--, b--;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    if(!dfs(0)){
        cout << "NO\n";
        return 0;
    }
    FOR(d, 1, 20) F0R(i, n)
        anc[i][d] = anc[anc[i][d-1]][d-1];
    int a = diam[0].ss.ff, b = diam[0].ss.ss, c = lca(a, b);
    F0R(i, n){
        int x = c^lca(a, i)^lca(b, i);
        if(dist(i, x) > 2){
            cout << "NO\n";
            return 0;
        }
    }
    cout << "YES\n";
    if(dep[a] < dep[b]) swap(a, b);
    vector<int> seq, seq2;
    while(anc[a][0] != c){
        int tmp = a; a = anc[a][0];
        seq.push_back(a);
        for(auto x : adj[a]) if(x != tmp && x != anc[a][0])
            seq.push_back(x), seq.push_back(a);
    }
    while(anc[b][0] != c){
        int tmp = b; b = anc[b][0];
        seq2.push_back(b);
        for(auto x : adj[b]) if(x != tmp && x != anc[b][0])
            seq2.push_back(x), seq2.push_back(b);
    }
    if(b != c){
        seq.push_back(c);
        for(auto x : adj[c]) if(x != a && x != b)
            seq.push_back(x), seq.push_back(c);
        reverse(all(seq2));
        for(auto x : seq2) seq.push_back(x);
    }
    cout << 2*seq.size() << '\n';
    for(auto x : seq) cout << x+1 << ' ';
    reverse(all(seq));
    for(auto x : seq) cout << x+1 << ' ';
    cout << '\n';
    return 0;
}

Subtask #1
9.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7004 KB Output is correct
2 Correct 2 ms 7004 KB Output is correct
3 Correct 3 ms 13148 KB Output is correct
4 Correct 2 ms 13208 KB Output is correct
5 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
6 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
7 Correct 2 ms 13148 KB Output is correct
8 Correct 2 ms 13148 KB Output is correct
9 Correct 4 ms 13148 KB Output is correct
10 Correct 2 ms 13148 KB Output is correct
11 Partially correct 3 ms 13148 KB Provide a successful but not optimal strategy.
12 Correct 2 ms 13148 KB Output is correct
13 Partially correct 2 ms 13144 KB Provide a successful but not optimal strategy.
14 Partially correct 3 ms 13148 KB Provide a successful but not optimal strategy.
15 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
16 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
17 Partially correct 3 ms 13148 KB Provide a successful but not optimal strategy.
18 Partially correct 2 ms 13144 KB Provide a successful but not optimal strategy.
19 Partially correct 3 ms 13148 KB Provide a successful but not optimal strategy.
20 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
21 Partially correct 2 ms 13264 KB Provide a successful but not optimal strategy.
22 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
23 Partially correct 3 ms 13148 KB Provide a successful but not optimal strategy.
24 Partially correct 3 ms 13312 KB Provide a successful but not optimal strategy.
25 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
26 Partially correct 3 ms 13144 KB Provide a successful but not optimal strategy.
27 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
28 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
29 Correct 2 ms 13148 KB Output is correct
30 Partially correct 2 ms 13144 KB Provide a successful but not optimal strategy.
31 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
32 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
33 Partially correct 3 ms 13320 KB Provide a successful but not optimal strategy.
34 Correct 2 ms 13148 KB Output is correct
35 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
36 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
37 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
38 Partially correct 3 ms 13148 KB Provide a successful but not optimal strategy.
39 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
40 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
41 Partially correct 3 ms 13148 KB Provide a successful but not optimal strategy.
42 Partially correct 3 ms 13148 KB Provide a successful but not optimal strategy.
43 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
44 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
45 Correct 2 ms 13148 KB Output is correct
46 Correct 2 ms 13148 KB Output is correct
47 Correct 3 ms 13148 KB Output is correct
48 Partially correct 3 ms 13148 KB Provide a successful but not optimal strategy.
49 Correct 2 ms 13148 KB Output is correct
50 Correct 3 ms 13144 KB Output is correct
51 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
52 Correct 2 ms 13148 KB Output is correct
53 Correct 2 ms 13240 KB Output is correct
54 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
55 Correct 3 ms 13144 KB Output is correct
56 Correct 2 ms 13148 KB Output is correct
57 Correct 2 ms 13144 KB Output is correct
58 Correct 3 ms 13148 KB Output is correct
59 Correct 2 ms 13148 KB Output is correct
60 Correct 2 ms 13148 KB Output is correct
61 Correct 2 ms 13144 KB Output is correct
62 Correct 3 ms 13148 KB Output is correct
63 Correct 3 ms 13148 KB Output is correct
64 Correct 2 ms 13148 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7004 KB Output is correct
2 Correct 1 ms 7004 KB Output is correct
3 Correct 2 ms 13148 KB Output is correct
4 Correct 2 ms 13148 KB Output is correct
5 Correct 2 ms 13148 KB Output is correct
6 Correct 2 ms 13148 KB Output is correct
7 Correct 2 ms 13148 KB Output is correct
8 Correct 2 ms 13148 KB Output is correct
9 Correct 2 ms 13148 KB Output is correct
10 Correct 2 ms 13148 KB Output is correct
11 Correct 3 ms 13404 KB Output is correct
12 Correct 2 ms 13400 KB Output is correct
13 Correct 3 ms 13404 KB Output is correct
14 Correct 3 ms 13404 KB Output is correct
15 Correct 4 ms 13404 KB Output is correct
16 Correct 4 ms 13404 KB Output is correct
17 Correct 3 ms 13400 KB Output is correct
18 Correct 3 ms 13404 KB Output is correct
19 Correct 4 ms 13404 KB Output is correct
20 Correct 3 ms 13404 KB Output is correct

Subtask #3
60.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7004 KB Output is correct
2 Correct 2 ms 7004 KB Output is correct
3 Correct 3 ms 13148 KB Output is correct
4 Correct 2 ms 13208 KB Output is correct
5 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
6 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
7 Correct 2 ms 13148 KB Output is correct
8 Correct 2 ms 13148 KB Output is correct
9 Correct 4 ms 13148 KB Output is correct
10 Correct 2 ms 13148 KB Output is correct
11 Partially correct 3 ms 13148 KB Provide a successful but not optimal strategy.
12 Correct 2 ms 13148 KB Output is correct
13 Partially correct 2 ms 13144 KB Provide a successful but not optimal strategy.
14 Partially correct 3 ms 13148 KB Provide a successful but not optimal strategy.
15 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
16 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
17 Partially correct 3 ms 13148 KB Provide a successful but not optimal strategy.
18 Partially correct 2 ms 13144 KB Provide a successful but not optimal strategy.
19 Partially correct 3 ms 13148 KB Provide a successful but not optimal strategy.
20 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
21 Partially correct 2 ms 13264 KB Provide a successful but not optimal strategy.
22 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
23 Partially correct 3 ms 13148 KB Provide a successful but not optimal strategy.
24 Partially correct 3 ms 13312 KB Provide a successful but not optimal strategy.
25 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
26 Partially correct 3 ms 13144 KB Provide a successful but not optimal strategy.
27 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
28 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
29 Correct 2 ms 13148 KB Output is correct
30 Partially correct 2 ms 13144 KB Provide a successful but not optimal strategy.
31 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
32 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
33 Partially correct 3 ms 13320 KB Provide a successful but not optimal strategy.
34 Correct 2 ms 13148 KB Output is correct
35 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
36 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
37 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
38 Partially correct 3 ms 13148 KB Provide a successful but not optimal strategy.
39 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
40 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
41 Partially correct 3 ms 13148 KB Provide a successful but not optimal strategy.
42 Partially correct 3 ms 13148 KB Provide a successful but not optimal strategy.
43 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
44 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
45 Correct 2 ms 13148 KB Output is correct
46 Correct 2 ms 13148 KB Output is correct
47 Correct 3 ms 13148 KB Output is correct
48 Partially correct 3 ms 13148 KB Provide a successful but not optimal strategy.
49 Correct 2 ms 13148 KB Output is correct
50 Correct 3 ms 13144 KB Output is correct
51 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
52 Correct 2 ms 13148 KB Output is correct
53 Correct 2 ms 13240 KB Output is correct
54 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
55 Correct 3 ms 13144 KB Output is correct
56 Correct 2 ms 13148 KB Output is correct
57 Correct 2 ms 13144 KB Output is correct
58 Correct 3 ms 13148 KB Output is correct
59 Correct 2 ms 13148 KB Output is correct
60 Correct 2 ms 13148 KB Output is correct
61 Correct 2 ms 13144 KB Output is correct
62 Correct 3 ms 13148 KB Output is correct
63 Correct 3 ms 13148 KB Output is correct
64 Correct 2 ms 13148 KB Output is correct
65 Correct 2 ms 7000 KB Output is correct
66 Correct 2 ms 7000 KB Output is correct
67 Correct 3 ms 13148 KB Output is correct
68 Correct 2 ms 13144 KB Output is correct
69 Partially correct 2 ms 13172 KB Provide a successful but not optimal strategy.
70 Partially correct 2 ms 13240 KB Provide a successful but not optimal strategy.
71 Correct 2 ms 13148 KB Output is correct
72 Correct 4 ms 13148 KB Output is correct
73 Correct 2 ms 13148 KB Output is correct
74 Correct 2 ms 13148 KB Output is correct
75 Partially correct 2 ms 13148 KB Provide a successful but not optimal strategy.
76 Correct 3 ms 13148 KB Output is correct
77 Partially correct 2 ms 13144 KB Provide a successful but not optimal strategy.
78 Partially correct 2 ms 13144 KB Provide a successful but not optimal strategy.
79 Correct 3 ms 13148 KB Output is correct
80 Correct 3 ms 13148 KB Output is correct
81 Correct 4 ms 13144 KB Output is correct
82 Correct 3 ms 13148 KB Output is correct
83 Correct 3 ms 13148 KB Output is correct
84 Correct 4 ms 13148 KB Output is correct
85 Correct 2 ms 13148 KB Output is correct
86 Correct 4 ms 13148 KB Output is correct
87 Correct 3 ms 13148 KB Output is correct
88 Correct 4 ms 13324 KB Output is correct
89 Partially correct 4 ms 13400 KB Provide a successful but not optimal strategy.
90 Partially correct 3 ms 13404 KB Provide a successful but not optimal strategy.
91 Partially correct 3 ms 13404 KB Provide a successful but not optimal strategy.
92 Partially correct 3 ms 13404 KB Provide a successful but not optimal strategy.
93 Partially correct 3 ms 13404 KB Provide a successful but not optimal strategy.
94 Partially correct 3 ms 13148 KB Provide a successful but not optimal strategy.
95 Partially correct 3 ms 13400 KB Provide a successful but not optimal strategy.
96 Partially correct 3 ms 13400 KB Provide a successful but not optimal strategy.
97 Partially correct 3 ms 13404 KB Provide a successful but not optimal strategy.
98 Partially correct 3 ms 13404 KB Provide a successful but not optimal strategy.
99 Partially correct 3 ms 13400 KB Provide a successful but not optimal strategy.
100 Partially correct 3 ms 13404 KB Provide a successful but not optimal strategy.
101 Partially correct 3 ms 13404 KB Provide a successful but not optimal strategy.
102 Partially correct 3 ms 13404 KB Provide a successful but not optimal strategy.
103 Partially correct 3 ms 13404 KB Provide a successful but not optimal strategy.
104 Partially correct 3 ms 13404 KB Provide a successful but not optimal strategy.
105 Partially correct 3 ms 13404 KB Provide a successful but not optimal strategy.
106 Partially correct 3 ms 13404 KB Provide a successful but not optimal strategy.
107 Partially correct 3 ms 13404 KB Provide a successful but not optimal strategy.
108 Partially correct 3 ms 13400 KB Provide a successful but not optimal strategy.
109 Partially correct 3 ms 13404 KB Provide a successful but not optimal strategy.
110 Partially correct 3 ms 13404 KB Provide a successful but not optimal strategy.
111 Partially correct 3 ms 13400 KB Provide a successful but not optimal strategy.
112 Partially correct 3 ms 13404 KB Provide a successful but not optimal strategy.
113 Partially correct 3 ms 13404 KB Provide a successful but not optimal strategy.
114 Partially correct 3 ms 13404 KB Provide a successful but not optimal strategy.
115 Partially correct 3 ms 13316 KB Provide a successful but not optimal strategy.
116 Partially correct 3 ms 13316 KB Provide a successful but not optimal strategy.
117 Partially correct 3 ms 13400 KB Provide a successful but not optimal strategy.
118 Partially correct 4 ms 13400 KB Provide a successful but not optimal strategy.
119 Partially correct 3 ms 13404 KB Provide a successful but not optimal strategy.
120 Partially correct 3 ms 13404 KB Provide a successful but not optimal strategy.
121 Partially correct 3 ms 13404 KB Provide a successful but not optimal strategy.
122 Partially correct 3 ms 13404 KB Provide a successful but not optimal strategy.
123 Partially correct 3 ms 13404 KB Provide a successful but not optimal strategy.
124 Partially correct 3 ms 13404 KB Provide a successful but not optimal strategy.
125 Partially correct 4 ms 13400 KB Provide a successful but not optimal strategy.
126 Partially correct 3 ms 13404 KB Provide a successful but not optimal strategy.
127 Partially correct 3 ms 13404 KB Provide a successful but not optimal strategy.
128 Partially correct 3 ms 13404 KB Provide a successful but not optimal strategy.
129 Correct 3 ms 13148 KB Output is correct
130 Correct 3 ms 13316 KB Output is correct
131 Correct 3 ms 13144 KB Output is correct
132 Correct 3 ms 13144 KB Output is correct
133 Correct 3 ms 13148 KB Output is correct
134 Correct 12 ms 14880 KB Output is correct
135 Correct 12 ms 14936 KB Output is correct
136 Correct 25 ms 18260 KB Output is correct
137 Correct 18 ms 16220 KB Output is correct
138 Correct 28 ms 17492 KB Output is correct
139 Correct 48 ms 20816 KB Output is correct
140 Correct 9 ms 14428 KB Output is correct
141 Correct 5 ms 13660 KB Output is correct
142 Correct 45 ms 20304 KB Output is correct
143 Correct 53 ms 21072 KB Output is correct
144 Correct 3 ms 13400 KB Output is correct
145 Correct 3 ms 13404 KB Output is correct