oj.uz

Submission #718051

# Submission time Handle Problem Language Result Execution time Memory
718051 2023-04-03T08:59:08 Z baokhue232005 Newspapers (CEOI21_newspapers) C++14
50 / 100
 2 ms 516 KB 
/*
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
*/
// lethal option

#include<bits/stdc++.h>
using namespace std;

#define all(flg) flg.begin(), flg.end()
#define int long long
#define pb push_back
#define fi first
#define se second
#define endl "\n"
#define eb emplace_back
#define ii pair<int, int>
#define vi vector<int>
#define PI 3.141592653589793238462643383279502884
#define ll long long
#define ld long double
#define for1(i, ff, gg) for(int i = ff; i <= gg; ++i)
#define for2(i, ff, gg) for(int i = ff; i >= gg; --i)
const ll mod = 1e9 + 7;
const int maxN = 1005;
const ll oo = 1e18 + 7;
int n, a[maxN];
int x, y, z, k;

vi vc[maxN];
void die(){
    cout << "NO\n"; exit(0);
}

int chi[maxN];

vi steak[maxN];
int used[maxN];

vi ans;

void dfs(int node){
    used[node] = 1;
    ans.pb(node);
    for(int cc : steak[node]){
        ans.pb(cc);
        ans.pb(node);
    }
    for(int cc : vc[node]) if(!used[cc]) dfs(cc);
}

signed main(){
    // freopen(".inp", "r", stdin);
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> n >> z;
    if(n <= 2){
        cout << "YES\n";
        cout << n << endl;
        while(n--) cout << "1 ";
        cout << endl;
        exit(0);
    }
    if(z >= n) die();
    for1(i, 2, n){
        cin >> x >> y;
        vc[x].pb(y);
        vc[y].pb(x);
    }
    for1(i, 1, n) chi[i] = vc[i].size();
    memset(used, 0, sizeof(used));
    for1(dumb, 0, 1){
        vi cac;
        for1(i, 1, n) steak[i].clear();
        for1(i, 1, n) if(!used[i] && chi[i] == 1) cac.pb(i);
        for(int node : cac) if(chi[node] == 1){
            for(int cc : vc[node]) if(!used[cc]){
                steak[cc].pb(node);
                --chi[cc];
                used[node] = 1;
            }
        }
    }
    for1(i, 1, n) if(!used[i] && chi[i] >= 3) die();
    for1(i, 1, n) if(!used[i] && chi[i] <= 1){
        dfs(i);
        cout << "YES\n";
        if(ans.size() > 1) ans.erase(ans.begin());
        if(ans.size() > 1) ans.pop_back();
        cout << ans.size() * 2 << endl;
        for1(dumb, 0, 1){
            reverse(all(ans));
            for(int cc : ans) cout << cc << " ";
        }
        cout << endl;
        exit(0);
    }
}

Subtask #1
6.0 / 12.0

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

Subtask #2
4.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 380 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 380 KB Output is correct
8 Correct 1 ms 380 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 388 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 1 ms 516 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct

Subtask #3
40.0 / 80.0

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