답안 #926195

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
926195	2024-02-12T17:06:16 Z	GrindMachine	Newspapers (CEOI21_newspapers)	C++17	75 / 100	57 ms	8784 KB

newspapers

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "YES" << endl
#define no cout << "NO" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e3 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

vector<ll> adj[N];
vector<ll> mx_depth(N);
vector<ll> par(N);
vector<ll> nxt(N);
bool ok = true;

void dfs1(ll u, ll p){
    mx_depth[u] = 0;
    nxt[u] = -1;
    par[u] = p;

    trav(v,adj[u]){
        if(v == p) conts;
        dfs1(v,u);
        amax(mx_depth[u],mx_depth[v]+1);
    }

    vector<ll> big;

    trav(v,adj[u]){
        if(v == p) conts;
        if(mx_depth[v] > 1){
            big.pb(v);
        }
    }

    if(sz(big) > 1){
        ok = false;
    }
    else{
        if(sz(big) == 1){
            nxt[u] = big[0];
        }
    }
}

vector<ll> curr_ans;

void dfs2(ll u, ll p){
    trav(v,adj[u]){
        if(v == p) conts;
        if(v != nxt[u]){
            curr_ans.pb(u);
            curr_ans.pb(v);
        }
    }

    if(nxt[u] == -1) return;

    ll v = nxt[u];
    pll best = {-inf2,-inf2};

    curr_ans.pb(u);
    curr_ans.pb(v);
    
    trav(w,adj[v]){
        if(w == u) conts;
        curr_ans.pb(w);
        curr_ans.pb(v);
        pll px = {mx_depth[w],w};
        amax(best,px);
    }

    assert(best.ss != -inf2);
    dfs2(best.ss,v);
}

void solve(int test_case)
{
    ll n,m; cin >> n >> m;
    rep1(i,m){
        ll u,v; cin >> u >> v;
        adj[u].pb(v), adj[v].pb(u);
    }

    if(m != n-1){
        no;
        return;
    }

    if(n == 1){
        yes;
        cout << 1 << endl << 1 << endl;
        return;
    }

    vector<ll> ans;

    rep1(i,n){
        ok = true;
        dfs1(i,-1);
        
        if(ok){
            curr_ans.clear();
            dfs2(i,-1);
            curr_ans.pb(1);
            dfs2(i,-1);
            if(ans.empty()){
                ans = curr_ans;
            }
            else{
                if(sz(curr_ans) < sz(ans)){
                    ans = curr_ans;
                }
            }
        }
    }

    if(ans.empty()){
        no;
        return;
    }

    yes;
    assert(sz(ans) <= 5*n);
    cout << sz(ans) << endl;
    trav(x,ans) cout << x << " ";
    cout << endl;


    // yes;
    // vector<ll> ans;
    // for(int i = 2; i <= n; ++i){
    //     ans.pb(i);
    // }
    // if(!((n-1)&1)){
    //     ans.pb(1);
    // }
    // for(int i = 2; i <= n; ++i){
    //     ans.pb(i);
    // }

    // cout << sz(ans) << endl;
    // trav(x,ans) cout << x << " ";
    // cout << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1

9.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Partially correct	1 ms	348 KB	Provide a successful but not optimal strategy.
3	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
4	Partially correct	1 ms	348 KB	Provide a successful but not optimal strategy.
5	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
6	Partially correct	1 ms	348 KB	Provide a successful but not optimal strategy.
7	Correct	0 ms	348 KB	Output is correct
8	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
9	Correct	0 ms	348 KB	Output is correct
10	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
11	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
12	Partially correct	0 ms	344 KB	Provide a successful but not optimal strategy.
13	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
14	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
15	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
16	Partially correct	0 ms	512 KB	Provide a successful but not optimal strategy.
17	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
18	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
19	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
20	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
21	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
22	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
23	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
24	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
25	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
26	Partially correct	0 ms	344 KB	Provide a successful but not optimal strategy.
27	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
28	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
29	Correct	0 ms	348 KB	Output is correct
30	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
31	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
32	Partially correct	1 ms	348 KB	Provide a successful but not optimal strategy.
33	Partially correct	1 ms	348 KB	Provide a successful but not optimal strategy.
34	Correct	0 ms	348 KB	Output is correct
35	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
36	Partially correct	0 ms	344 KB	Provide a successful but not optimal strategy.
37	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
38	Partially correct	1 ms	348 KB	Provide a successful but not optimal strategy.
39	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
40	Partially correct	1 ms	344 KB	Provide a successful but not optimal strategy.
41	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
42	Partially correct	0 ms	400 KB	Provide a successful but not optimal strategy.
43	Partially correct	0 ms	344 KB	Provide a successful but not optimal strategy.
44	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
45	Correct	0 ms	348 KB	Output is correct
46	Correct	0 ms	348 KB	Output is correct
47	Correct	0 ms	344 KB	Output is correct
48	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
49	Correct	0 ms	348 KB	Output is correct
50	Correct	0 ms	348 KB	Output is correct
51	Partially correct	1 ms	348 KB	Provide a successful but not optimal strategy.
52	Correct	0 ms	348 KB	Output is correct
53	Correct	0 ms	348 KB	Output is correct
54	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
55	Correct	0 ms	344 KB	Output is correct
56	Correct	1 ms	344 KB	Output is correct
57	Correct	0 ms	348 KB	Output is correct
58	Correct	0 ms	348 KB	Output is correct
59	Correct	0 ms	348 KB	Output is correct
60	Correct	0 ms	348 KB	Output is correct
61	Correct	0 ms	348 KB	Output is correct
62	Correct	0 ms	348 KB	Output is correct
63	Correct	0 ms	352 KB	Output is correct
64	Correct	0 ms	348 KB	Output is correct

Subtask #2

6.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
3	Partially correct	1 ms	348 KB	Provide a successful but not optimal strategy.
4	Partially correct	1 ms	348 KB	Provide a successful but not optimal strategy.
5	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
6	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
7	Partially correct	1 ms	344 KB	Provide a successful but not optimal strategy.
8	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
9	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
10	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
11	Partially correct	22 ms	684 KB	Provide a successful but not optimal strategy.
12	Partially correct	7 ms	600 KB	Provide a successful but not optimal strategy.
13	Partially correct	11 ms	604 KB	Provide a successful but not optimal strategy.
14	Partially correct	10 ms	604 KB	Provide a successful but not optimal strategy.
15	Partially correct	12 ms	600 KB	Provide a successful but not optimal strategy.
16	Partially correct	30 ms	712 KB	Provide a successful but not optimal strategy.
17	Partially correct	24 ms	972 KB	Provide a successful but not optimal strategy.
18	Partially correct	28 ms	692 KB	Provide a successful but not optimal strategy.
19	Partially correct	24 ms	600 KB	Provide a successful but not optimal strategy.
20	Partially correct	24 ms	716 KB	Provide a successful but not optimal strategy.

Subtask #3

60.0 / 80.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Partially correct	1 ms	348 KB	Provide a successful but not optimal strategy.
3	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
4	Partially correct	1 ms	348 KB	Provide a successful but not optimal strategy.
5	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
6	Partially correct	1 ms	348 KB	Provide a successful but not optimal strategy.
7	Correct	0 ms	348 KB	Output is correct
8	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
9	Correct	0 ms	348 KB	Output is correct
10	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
11	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
12	Partially correct	0 ms	344 KB	Provide a successful but not optimal strategy.
13	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
14	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
15	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
16	Partially correct	0 ms	512 KB	Provide a successful but not optimal strategy.
17	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
18	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
19	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
20	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
21	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
22	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
23	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
24	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
25	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
26	Partially correct	0 ms	344 KB	Provide a successful but not optimal strategy.
27	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
28	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
29	Correct	0 ms	348 KB	Output is correct
30	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
31	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
32	Partially correct	1 ms	348 KB	Provide a successful but not optimal strategy.
33	Partially correct	1 ms	348 KB	Provide a successful but not optimal strategy.
34	Correct	0 ms	348 KB	Output is correct
35	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
36	Partially correct	0 ms	344 KB	Provide a successful but not optimal strategy.
37	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
38	Partially correct	1 ms	348 KB	Provide a successful but not optimal strategy.
39	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
40	Partially correct	1 ms	344 KB	Provide a successful but not optimal strategy.
41	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
42	Partially correct	0 ms	400 KB	Provide a successful but not optimal strategy.
43	Partially correct	0 ms	344 KB	Provide a successful but not optimal strategy.
44	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
45	Correct	0 ms	348 KB	Output is correct
46	Correct	0 ms	348 KB	Output is correct
47	Correct	0 ms	344 KB	Output is correct
48	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
49	Correct	0 ms	348 KB	Output is correct
50	Correct	0 ms	348 KB	Output is correct
51	Partially correct	1 ms	348 KB	Provide a successful but not optimal strategy.
52	Correct	0 ms	348 KB	Output is correct
53	Correct	0 ms	348 KB	Output is correct
54	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
55	Correct	0 ms	344 KB	Output is correct
56	Correct	1 ms	344 KB	Output is correct
57	Correct	0 ms	348 KB	Output is correct
58	Correct	0 ms	348 KB	Output is correct
59	Correct	0 ms	348 KB	Output is correct
60	Correct	0 ms	348 KB	Output is correct
61	Correct	0 ms	348 KB	Output is correct
62	Correct	0 ms	348 KB	Output is correct
63	Correct	0 ms	352 KB	Output is correct
64	Correct	0 ms	348 KB	Output is correct
65	Correct	0 ms	344 KB	Output is correct
66	Partially correct	0 ms	344 KB	Provide a successful but not optimal strategy.
67	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
68	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
69	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
70	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
71	Correct	0 ms	348 KB	Output is correct
72	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
73	Correct	0 ms	348 KB	Output is correct
74	Partially correct	1 ms	348 KB	Provide a successful but not optimal strategy.
75	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
76	Partially correct	1 ms	348 KB	Provide a successful but not optimal strategy.
77	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
78	Partially correct	0 ms	348 KB	Provide a successful but not optimal strategy.
79	Correct	12 ms	348 KB	Output is correct
80	Correct	12 ms	348 KB	Output is correct
81	Correct	12 ms	536 KB	Output is correct
82	Correct	14 ms	344 KB	Output is correct
83	Correct	15 ms	536 KB	Output is correct
84	Correct	12 ms	348 KB	Output is correct
85	Correct	12 ms	344 KB	Output is correct
86	Correct	13 ms	348 KB	Output is correct
87	Correct	14 ms	344 KB	Output is correct
88	Correct	10 ms	532 KB	Output is correct
89	Partially correct	21 ms	600 KB	Provide a successful but not optimal strategy.
90	Partially correct	17 ms	604 KB	Provide a successful but not optimal strategy.
91	Partially correct	16 ms	628 KB	Provide a successful but not optimal strategy.
92	Partially correct	15 ms	604 KB	Provide a successful but not optimal strategy.
93	Partially correct	21 ms	604 KB	Provide a successful but not optimal strategy.
94	Partially correct	15 ms	600 KB	Provide a successful but not optimal strategy.
95	Partially correct	23 ms	644 KB	Provide a successful but not optimal strategy.
96	Partially correct	22 ms	604 KB	Provide a successful but not optimal strategy.
97	Partially correct	13 ms	604 KB	Provide a successful but not optimal strategy.
98	Partially correct	22 ms	604 KB	Provide a successful but not optimal strategy.
99	Partially correct	17 ms	604 KB	Provide a successful but not optimal strategy.
100	Partially correct	17 ms	860 KB	Provide a successful but not optimal strategy.
101	Partially correct	16 ms	604 KB	Provide a successful but not optimal strategy.
102	Partially correct	16 ms	604 KB	Provide a successful but not optimal strategy.
103	Partially correct	21 ms	860 KB	Provide a successful but not optimal strategy.
104	Partially correct	12 ms	604 KB	Provide a successful but not optimal strategy.
105	Partially correct	14 ms	604 KB	Provide a successful but not optimal strategy.
106	Partially correct	19 ms	600 KB	Provide a successful but not optimal strategy.
107	Partially correct	15 ms	604 KB	Provide a successful but not optimal strategy.
108	Partially correct	22 ms	604 KB	Provide a successful but not optimal strategy.
109	Partially correct	18 ms	620 KB	Provide a successful but not optimal strategy.
110	Partially correct	21 ms	604 KB	Provide a successful but not optimal strategy.
111	Partially correct	14 ms	600 KB	Provide a successful but not optimal strategy.
112	Partially correct	15 ms	604 KB	Provide a successful but not optimal strategy.
113	Partially correct	22 ms	640 KB	Provide a successful but not optimal strategy.
114	Partially correct	19 ms	600 KB	Provide a successful but not optimal strategy.
115	Partially correct	15 ms	600 KB	Provide a successful but not optimal strategy.
116	Partially correct	18 ms	600 KB	Provide a successful but not optimal strategy.
117	Partially correct	23 ms	604 KB	Provide a successful but not optimal strategy.
118	Partially correct	19 ms	604 KB	Provide a successful but not optimal strategy.
119	Partially correct	16 ms	624 KB	Provide a successful but not optimal strategy.
120	Partially correct	19 ms	624 KB	Provide a successful but not optimal strategy.
121	Partially correct	20 ms	640 KB	Provide a successful but not optimal strategy.
122	Partially correct	16 ms	604 KB	Provide a successful but not optimal strategy.
123	Partially correct	14 ms	604 KB	Provide a successful but not optimal strategy.
124	Partially correct	21 ms	604 KB	Provide a successful but not optimal strategy.
125	Partially correct	13 ms	852 KB	Provide a successful but not optimal strategy.
126	Partially correct	14 ms	624 KB	Provide a successful but not optimal strategy.
127	Partially correct	13 ms	604 KB	Provide a successful but not optimal strategy.
128	Partially correct	26 ms	812 KB	Provide a successful but not optimal strategy.
129	Correct	16 ms	344 KB	Output is correct
130	Correct	17 ms	348 KB	Output is correct
131	Correct	22 ms	544 KB	Output is correct
132	Correct	17 ms	344 KB	Output is correct
133	Correct	17 ms	600 KB	Output is correct
134	Correct	11 ms	2396 KB	Output is correct
135	Correct	10 ms	2392 KB	Output is correct
136	Correct	24 ms	7260 KB	Output is correct
137	Correct	16 ms	4184 KB	Output is correct
138	Correct	31 ms	5456 KB	Output is correct
139	Correct	57 ms	8784 KB	Output is correct
140	Correct	8 ms	1884 KB	Output is correct
141	Correct	3 ms	936 KB	Output is correct
142	Correct	43 ms	8536 KB	Output is correct
143	Correct	57 ms	8580 KB	Output is correct
144	Partially correct	24 ms	604 KB	Provide a successful but not optimal strategy.
145	Partially correct	24 ms	716 KB	Provide a successful but not optimal strategy.