oj.uz

Submission #589532

# Submission time Handle Problem Language Result Execution time Memory
589532 2022-07-04T20:29:43 Z jasmin Newspapers (CEOI21_newspapers) C++14
54 / 100
 68 ms 8952 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long

int bfs(int n, vector<vector<int> >& adi){
    vector<bool> vis(n);
    deque<int> q;
    q.push_back(0);
    int last=0;
    vis[0]=true;
    while(!q.empty()){
        int v=last=q.front();
        q.pop_front();

        for(auto u: adi[v]){
            if(!vis[u]){
                vis[u]=true;
                q.push_back(u);
            }
        }
    }
    return last;
}

vector<int> a;
int dfs(int v, int hight, vector<bool>& vis, vector<vector<int> >& adi, bool& pos){
    if(vis[v]){
        return 0;
    }
    vis[v]=true;
    int depth=1;

    if(adi[v].size()>1){
        a.push_back(v);
    }

    int further=0;
    for(auto u: adi[v]){

        int subtree=dfs(u, hight+1, vis, adi, pos);
        depth=max(depth, subtree+1);
        if(subtree>2){
            further++;
        }
        else if(subtree==2 && adi[v].size()>2){
            a.push_back(v);
        }
        
    }
    pos=pos && (further<=1);
    return depth;
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n, m;
    cin >> n >> m;
    vector<vector<int> > adi(n);
    for(int i=0; i<m; i++){
        int a, b;
        cin >> a >> b;
        adi[a-1].push_back(b-1);
        adi[b-1].push_back(a-1);
    }

    bool pos=(m==n-1);
    int root=bfs(n, adi);
    
    vector<bool> vis(n, false);
    dfs(root, 0, vis, adi, pos);

    if(pos){
        cout << "YES\n";
        if(n==1){
            cout << 1 << "\n" << 1 << "\n";
            return 0;
        }
        else if(n==2){
            cout << 2 << "\n" << 1 << " " << 1 << "\n";
            return 0;
        }
        cout << 2*a.size()<< "\n";
        for(int i=0; i<(int)a.size(); i++){
            cout << a[i]+1 << " ";
        }
        for(int i=a.size()-1; i>=0; i--){
            cout << a[i]+1 << " ";
        }
        cout << "\n";
    }
    else{
        cout << "NO\n";
    }
}

Subtask #1
6.0 / 12.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 320 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 1 ms 468 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 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Partially correct 1 ms 212 KB Provide a successful but not optimal strategy.
7 Correct 0 ms 212 KB Output is correct
8 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
9 Correct 0 ms 212 KB Output is correct
10 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
11 Correct 0 ms 212 KB Output is correct
12 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
13 Partially correct 1 ms 212 KB Provide a successful but not optimal strategy.
14 Correct 0 ms 316 KB Output is correct
15 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Partially correct 1 ms 320 KB Provide a successful but not optimal strategy.
19 Correct 1 ms 212 KB Output is correct
20 Partially correct 1 ms 212 KB Provide a successful but not optimal strategy.
21 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
22 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
23 Partially correct 1 ms 212 KB Provide a successful but not optimal strategy.
24 Partially correct 0 ms 324 KB Provide a successful but not optimal strategy.
25 Partially correct 1 ms 212 KB Provide a successful but not optimal strategy.
26 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
27 Partially correct 1 ms 212 KB Provide a successful but not optimal strategy.
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
31 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
32 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
33 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
34 Correct 0 ms 212 KB Output is correct
35 Partially correct 1 ms 212 KB Provide a successful but not optimal strategy.
36 Partially correct 1 ms 320 KB Failed to provide a successful strategy.
37 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
38 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
39 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
40 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
41 Partially correct 1 ms 212 KB Provide a successful but not optimal strategy.
42 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
43 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
44 Partially correct 1 ms 316 KB Failed to provide a successful strategy.
45 Correct 1 ms 212 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Partially correct 1 ms 212 KB Failed to provide a successful strategy.
49 Correct 0 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
52 Correct 0 ms 212 KB Output is correct
53 Correct 0 ms 212 KB Output is correct
54 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
55 Correct 0 ms 212 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 1 ms 212 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 1 ms 212 KB Output is correct
64 Correct 1 ms 320 KB Output is correct
65 Correct 0 ms 312 KB Output is correct
66 Correct 1 ms 212 KB Output is correct
67 Correct 0 ms 212 KB Output is correct
68 Correct 1 ms 212 KB Output is correct
69 Correct 1 ms 212 KB Output is correct
70 Partially correct 0 ms 212 KB Provide a successful but not optimal strategy.
71 Correct 1 ms 212 KB Output is correct
72 Partially correct 1 ms 212 KB Provide a successful but not optimal strategy.
73 Correct 0 ms 212 KB Output is correct
74 Partially correct 0 ms 212 KB Failed to provide a successful strategy.
75 Correct 1 ms 212 KB Output is correct
76 Partially correct 1 ms 212 KB Provide a successful but not optimal strategy.
77 Partially correct 1 ms 320 KB Provide a successful but not optimal strategy.
78 Correct 0 ms 212 KB Output is correct
79 Correct 1 ms 340 KB Output is correct
80 Correct 1 ms 324 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 340 KB Output is correct
84 Correct 1 ms 340 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 344 KB Output is correct
88 Correct 1 ms 340 KB Output is correct
89 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
90 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
91 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
92 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
93 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
94 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
95 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
96 Partially correct 2 ms 340 KB Failed to provide a successful strategy.
97 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
98 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
99 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
100 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
101 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
102 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
103 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
104 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
105 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
106 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
107 Partially correct 2 ms 340 KB Failed to provide a successful strategy.
108 Partially correct 2 ms 340 KB Failed to provide a successful strategy.
109 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
110 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
111 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
112 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
113 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
114 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
115 Partially correct 1 ms 384 KB Failed to provide a successful strategy.
116 Partially correct 1 ms 324 KB Failed to provide a successful strategy.
117 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
118 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
119 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
120 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
121 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
122 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
123 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
124 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
125 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
126 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
127 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
128 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
129 Correct 1 ms 340 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 14 ms 2260 KB Output is correct
135 Correct 15 ms 2516 KB Output is correct
136 Correct 32 ms 7348 KB Output is correct
137 Correct 23 ms 4208 KB Output is correct
138 Correct 50 ms 5372 KB Output is correct
139 Correct 63 ms 8676 KB Output is correct
140 Correct 9 ms 1764 KB Output is correct
141 Correct 4 ms 852 KB Output is correct
142 Correct 66 ms 8952 KB Output is correct
143 Correct 68 ms 8800 KB Output is correct
144 Correct 1 ms 468 KB Output is correct
145 Correct 1 ms 384 KB Output is correct