oj.uz

Submission #785766

# Submission time Handle Problem Language Result Execution time Memory
785766 2023-07-17T14:46:47 Z gagik_2007 Newspapers (CEOI21_newspapers) C++17
50 / 100
 58 ms 16020 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define ff first
#define ss second

ll ttt;
const ll INF=1e18;
const ll MOD=1e9+7;
const ll N=300007;
ll n,m,k;
vector<ll>g[N];
ll sz[N];
bool used[N];
ll head[N];

void dfs(int v, int par=-1){
    // cout<<"YOO"<<endl;
    sz[v]=0;
    for(int to:g[v]){
        if(to!=par){
            dfs(to,v);
            sz[v]=max(sz[v],sz[to]+1);
        }
    }
}

bool is_tree(int c, int v, int par=-1){
    used[v]=true;
    head[v]=c;
    bool retval=true;
    for(int to:g[v]){
        if(to!=par){
            if(used[to])retval= false;
            else if(!is_tree(c,to,v))retval= false;
        }
    }
    return retval;
}

void construct(vector<int>& p, int v, int par=-1){
    // cout<<"CONSTRUCT: "<<v<<" "<<par<<endl;
    p.push_back(v);
    int u=-1;
    for(int to:g[v]){
        if(to!=par){
            if(sz[to]<2){
                p.push_back(to);
                p.push_back(v);
            }
            else u=to;
        }
    }
    if(u!=-1)construct(p,u,v);
}

int find_leaf(int v, int par=-1){
    for(int to:g[v]){
        if(to!=par){
            if(sz[to]>=2){
                return find_leaf(to,v);
            }
        }
    }
    return v;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    // freopen("output.txt","w",stdout);
    // freopen("input.txt","r",stdin);
    cin>>n>>m;
    // if(m!=n-1)cout<<"NO\n";
    for(int i=0;i<m;i++){
        int x,y;
        cin>>x>>y;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    for(int v=1;v<=n;v++){
        if(!used[v]&&!is_tree(v,v)){
            cout<<"NO\n";
            return 0;
        }
    }
    for(int v=1;v<=n;v++){
        dfs(v);
        int cnt=0;
        for(int to:g[v]){
            cnt+=(sz[to]>=2);
        }
        if(cnt>2){
            cout<<"NO\n";
            return 0;
        }
    }
    cout<<"YES\n";
    vector<int>p;
    for(int v=1;v<=n;v++){
        if(head[v]==v){
            int leaf=find_leaf(v);
            // cout<<"leaf: "<<leaf<<endl;
            construct(p,leaf);
        }
    }
    int len=p.size();
    if(p.size()%2==0){
        p.push_back(1);
    }
    for(int i=0;i<len;i++){
        p.push_back(p[i]);
    }
    cout<<p.size()<<endl;
    for(int x:p)cout<<x<<" ";
    cout<<endl;
}

Subtask #1
6.0 / 12.0

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

Subtask #2
4.0 / 8.0

# Verdict Execution time Memory Grader output
1 Partially correct 4 ms 7380 KB Provide a successful but not optimal strategy.
2 Partially correct 3 ms 7380 KB Provide a successful but not optimal strategy.
3 Partially correct 3 ms 7252 KB Provide a successful but not optimal strategy.
4 Partially correct 3 ms 7380 KB Failed to provide a successful strategy.
5 Partially correct 4 ms 7252 KB Failed to provide a successful strategy.
6 Partially correct 3 ms 7380 KB Failed to provide a successful strategy.
7 Partially correct 3 ms 7380 KB Failed to provide a successful strategy.
8 Partially correct 3 ms 7380 KB Failed to provide a successful strategy.
9 Partially correct 3 ms 7380 KB Failed to provide a successful strategy.
10 Partially correct 3 ms 7324 KB Failed to provide a successful strategy.
11 Partially correct 11 ms 7500 KB Failed to provide a successful strategy.
12 Partially correct 5 ms 7380 KB Failed to provide a successful strategy.
13 Partially correct 6 ms 7380 KB Failed to provide a successful strategy.
14 Partially correct 7 ms 7456 KB Failed to provide a successful strategy.
15 Partially correct 8 ms 7460 KB Failed to provide a successful strategy.
16 Partially correct 11 ms 7508 KB Failed to provide a successful strategy.
17 Partially correct 13 ms 7504 KB Failed to provide a successful strategy.
18 Partially correct 13 ms 7508 KB Failed to provide a successful strategy.
19 Partially correct 11 ms 7380 KB Failed to provide a successful strategy.
20 Partially correct 11 ms 7508 KB Failed to provide a successful strategy.

Subtask #3
40.0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 3 ms 7380 KB Provide a successful but not optimal strategy.
2 Partially correct 4 ms 7372 KB Provide a successful but not optimal strategy.
3 Partially correct 3 ms 7252 KB Failed to provide a successful strategy.
4 Partially correct 3 ms 7252 KB Failed to provide a successful strategy.
5 Partially correct 3 ms 7380 KB Provide a successful but not optimal strategy.
6 Partially correct 3 ms 7252 KB Provide a successful but not optimal strategy.
7 Correct 3 ms 7252 KB Output is correct
8 Partially correct 3 ms 7356 KB Provide a successful but not optimal strategy.
9 Correct 3 ms 7380 KB Output is correct
10 Partially correct 3 ms 7268 KB Failed to provide a successful strategy.
11 Partially correct 3 ms 7252 KB Failed to provide a successful strategy.
12 Partially correct 3 ms 7380 KB Provide a successful but not optimal strategy.
13 Partially correct 3 ms 7368 KB Provide a successful but not optimal strategy.
14 Partially correct 3 ms 7380 KB Provide a successful but not optimal strategy.
15 Partially correct 3 ms 7380 KB Provide a successful but not optimal strategy.
16 Partially correct 3 ms 7380 KB Failed to provide a successful strategy.
17 Partially correct 3 ms 7380 KB Provide a successful but not optimal strategy.
18 Partially correct 3 ms 7380 KB Failed to provide a successful strategy.
19 Partially correct 4 ms 7380 KB Provide a successful but not optimal strategy.
20 Partially correct 4 ms 7300 KB Provide a successful but not optimal strategy.
21 Partially correct 5 ms 7380 KB Failed to provide a successful strategy.
22 Partially correct 3 ms 7368 KB Provide a successful but not optimal strategy.
23 Partially correct 3 ms 7372 KB Provide a successful but not optimal strategy.
24 Partially correct 3 ms 7380 KB Provide a successful but not optimal strategy.
25 Partially correct 3 ms 7368 KB Provide a successful but not optimal strategy.
26 Partially correct 5 ms 7372 KB Failed to provide a successful strategy.
27 Partially correct 3 ms 7380 KB Provide a successful but not optimal strategy.
28 Partially correct 4 ms 7376 KB Provide a successful but not optimal strategy.
29 Correct 4 ms 7380 KB Output is correct
30 Partially correct 4 ms 7380 KB Provide a successful but not optimal strategy.
31 Partially correct 3 ms 7372 KB Failed to provide a successful strategy.
32 Partially correct 3 ms 7380 KB Failed to provide a successful strategy.
33 Partially correct 3 ms 7368 KB Provide a successful but not optimal strategy.
34 Correct 3 ms 7380 KB Output is correct
35 Partially correct 4 ms 7380 KB Provide a successful but not optimal strategy.
36 Partially correct 3 ms 7380 KB Failed to provide a successful strategy.
37 Partially correct 3 ms 7380 KB Provide a successful but not optimal strategy.
38 Partially correct 3 ms 7380 KB Failed to provide a successful strategy.
39 Partially correct 3 ms 7380 KB Failed to provide a successful strategy.
40 Partially correct 3 ms 7380 KB Provide a successful but not optimal strategy.
41 Partially correct 3 ms 7380 KB Provide a successful but not optimal strategy.
42 Partially correct 3 ms 7368 KB Provide a successful but not optimal strategy.
43 Partially correct 4 ms 7368 KB Failed to provide a successful strategy.
44 Partially correct 3 ms 7380 KB Failed to provide a successful strategy.
45 Correct 3 ms 7372 KB Output is correct
46 Correct 3 ms 7276 KB Output is correct
47 Correct 4 ms 7372 KB Output is correct
48 Partially correct 5 ms 7308 KB Provide a successful but not optimal strategy.
49 Correct 3 ms 7372 KB Output is correct
50 Correct 5 ms 7380 KB Output is correct
51 Partially correct 3 ms 7380 KB Failed to provide a successful strategy.
52 Correct 4 ms 7372 KB Output is correct
53 Correct 3 ms 7380 KB Output is correct
54 Partially correct 3 ms 7368 KB Failed to provide a successful strategy.
55 Correct 3 ms 7352 KB Output is correct
56 Correct 4 ms 7372 KB Output is correct
57 Correct 4 ms 7372 KB Output is correct
58 Correct 3 ms 7380 KB Output is correct
59 Correct 3 ms 7380 KB Output is correct
60 Correct 3 ms 7376 KB Output is correct
61 Correct 3 ms 7368 KB Output is correct
62 Correct 3 ms 7380 KB Output is correct
63 Correct 3 ms 7372 KB Output is correct
64 Correct 3 ms 7380 KB Output is correct
65 Partially correct 4 ms 7380 KB Provide a successful but not optimal strategy.
66 Partially correct 3 ms 7368 KB Provide a successful but not optimal strategy.
67 Partially correct 4 ms 7380 KB Failed to provide a successful strategy.
68 Partially correct 3 ms 7372 KB Failed to provide a successful strategy.
69 Partially correct 3 ms 7380 KB Provide a successful but not optimal strategy.
70 Partially correct 3 ms 7380 KB Provide a successful but not optimal strategy.
71 Correct 4 ms 7380 KB Output is correct
72 Partially correct 3 ms 7380 KB Provide a successful but not optimal strategy.
73 Correct 4 ms 7372 KB Output is correct
74 Partially correct 3 ms 7372 KB Failed to provide a successful strategy.
75 Partially correct 3 ms 7380 KB Failed to provide a successful strategy.
76 Partially correct 3 ms 7380 KB Provide a successful but not optimal strategy.
77 Partially correct 4 ms 7380 KB Provide a successful but not optimal strategy.
78 Partially correct 3 ms 7380 KB Provide a successful but not optimal strategy.
79 Correct 3 ms 7380 KB Output is correct
80 Correct 4 ms 7380 KB Output is correct
81 Correct 4 ms 7380 KB Output is correct
82 Correct 4 ms 7376 KB Output is correct
83 Correct 4 ms 7376 KB Output is correct
84 Correct 3 ms 7436 KB Output is correct
85 Correct 4 ms 7380 KB Output is correct
86 Correct 3 ms 7380 KB Output is correct
87 Correct 4 ms 7372 KB Output is correct
88 Correct 4 ms 7372 KB Output is correct
89 Partially correct 10 ms 7472 KB Failed to provide a successful strategy.
90 Partially correct 9 ms 7384 KB Failed to provide a successful strategy.
91 Partially correct 9 ms 7376 KB Failed to provide a successful strategy.
92 Partially correct 8 ms 7452 KB Failed to provide a successful strategy.
93 Partially correct 11 ms 7380 KB Failed to provide a successful strategy.
94 Partially correct 10 ms 7380 KB Failed to provide a successful strategy.
95 Partially correct 11 ms 7504 KB Provide a successful but not optimal strategy.
96 Partially correct 12 ms 7504 KB Provide a successful but not optimal strategy.
97 Partially correct 8 ms 7380 KB Failed to provide a successful strategy.
98 Partially correct 12 ms 7508 KB Provide a successful but not optimal strategy.
99 Partially correct 9 ms 7380 KB Failed to provide a successful strategy.
100 Partially correct 9 ms 7464 KB Failed to provide a successful strategy.
101 Partially correct 8 ms 7464 KB Failed to provide a successful strategy.
102 Partially correct 9 ms 7380 KB Failed to provide a successful strategy.
103 Partially correct 9 ms 7380 KB Failed to provide a successful strategy.
104 Partially correct 8 ms 7380 KB Failed to provide a successful strategy.
105 Partially correct 8 ms 7380 KB Failed to provide a successful strategy.
106 Partially correct 10 ms 7376 KB Failed to provide a successful strategy.
107 Partially correct 8 ms 7376 KB Failed to provide a successful strategy.
108 Partially correct 11 ms 7380 KB Failed to provide a successful strategy.
109 Partially correct 10 ms 7372 KB Failed to provide a successful strategy.
110 Partially correct 9 ms 7380 KB Failed to provide a successful strategy.
111 Partially correct 9 ms 7372 KB Failed to provide a successful strategy.
112 Partially correct 8 ms 7380 KB Failed to provide a successful strategy.
113 Partially correct 12 ms 7376 KB Failed to provide a successful strategy.
114 Partially correct 11 ms 7376 KB Provide a successful but not optimal strategy.
115 Partially correct 11 ms 7452 KB Failed to provide a successful strategy.
116 Partially correct 10 ms 7380 KB Failed to provide a successful strategy.
117 Partially correct 11 ms 7380 KB Failed to provide a successful strategy.
118 Partially correct 9 ms 7380 KB Failed to provide a successful strategy.
119 Partially correct 9 ms 7380 KB Failed to provide a successful strategy.
120 Partially correct 10 ms 7508 KB Provide a successful but not optimal strategy.
121 Partially correct 10 ms 7380 KB Failed to provide a successful strategy.
122 Partially correct 9 ms 7380 KB Failed to provide a successful strategy.
123 Partially correct 8 ms 7376 KB Failed to provide a successful strategy.
124 Partially correct 11 ms 7380 KB Failed to provide a successful strategy.
125 Partially correct 8 ms 7480 KB Provide a successful but not optimal strategy.
126 Partially correct 9 ms 7380 KB Provide a successful but not optimal strategy.
127 Partially correct 10 ms 7372 KB Provide a successful but not optimal strategy.
128 Partially correct 11 ms 7476 KB Failed to provide a successful strategy.
129 Correct 4 ms 7428 KB Output is correct
130 Correct 5 ms 7372 KB Output is correct
131 Correct 3 ms 7372 KB Output is correct
132 Correct 4 ms 7376 KB Output is correct
133 Correct 3 ms 7380 KB Output is correct
134 Correct 14 ms 9428 KB Output is correct
135 Correct 24 ms 9592 KB Output is correct
136 Correct 30 ms 14592 KB Output is correct
137 Correct 20 ms 11452 KB Output is correct
138 Correct 31 ms 12628 KB Output is correct
139 Correct 54 ms 16020 KB Output is correct
140 Correct 11 ms 8956 KB Output is correct
141 Correct 7 ms 8020 KB Output is correct
142 Correct 50 ms 15968 KB Output is correct
143 Correct 58 ms 15980 KB Output is correct
144 Partially correct 14 ms 7508 KB Failed to provide a successful strategy.
145 Partially correct 13 ms 7500 KB Failed to provide a successful strategy.