oj.uz

답안 #497215

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
497215 2021-12-22T17:50:47 Z Victor Newspapers (CEOI21_newspapers) C++17
52 / 100
 2 ms 460 KB 
// #pragma GCC target ("avx,avx2,fma")
// #pragma GCC optimize ("Ofast,inline") // O1 - O2 - O3 - Os - Ofast
// #pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define per(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define trav(a, x) for (auto &a : x)

#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back
#define debug(x) cout << #x << " = " << x << endl

#define umap unordered_map
#define uset unordered_set

typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;

const int INF = 1'000'000'007;

vi graph[1001];
int n, m, cnt, start;
vi ans;

bool dfs(int u, int p, int dist) {
    //cout<<"u = "<<u+1<<" p = "<<p+1<<" dist = "<<dist<<endl;
    if (dist == 3) return 1;
    trav(v, graph[u]) if (v != p) {
        bool val = dfs(v, u, dist + 1);
        if(u==start)cnt+=val;
        else if(val)return 1;
    } 
    return 0;
}

void solve(int u,int p, bool parity){
    vi small, big;
    trav(v,graph[u])if(v!=p){
        if(dfs(v,u,1))big.pb(v);
        else small.pb(v);
    }

    assert(sz(big)<3);
    if(!big.empty())solve(big[0], u, parity^1);
    trav(v,small){
        if(sz(ans) % 2 == parity)ans.pb(u);
        ans.pb(v);
    }

    if(sz(ans) % 2 == parity)ans.pb(u);
    if(sz(big)==2)solve(big[1], u, parity^1);
    if(sz(ans) % 2 == parity)ans.pb(u);
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    cin >> n >> m;
    if (m >= n) {
        cout << "NO" << endl;
        return 0;
    }

    while (m--) {
        int u, v;
        cin >> u >> v;
        graph[--u].pb(--v);
        graph[v].pb(u);
    }

    rep(i, 0, n) {
        cnt = 0;
        start=i;
        dfs(i, i, 0);
        //cout << "u = " << i + 1 << " cnt = " << cnt << endl;
        if (cnt >= 3) {
            cout << "NO" << endl;
            return 0;
        }
    }

    start = cnt = 0;
    dfs(0,0,0);
    solve(0,0,0);
    
    cout<<"YES"<<endl;
    cnt = sz(ans)*2+1-(sz(ans)%2);
    assert(cnt<=5*n);
    cout<<sz(ans)*2+1-(sz(ans)%2)<<endl;
    trav(u,ans)cout<<u+1<<' ';
    if(sz(ans)%2==0)cout<<"1 ";
    trav(u,ans)cout<<u+1<<' ';
    cout<<endl;
    return 0;
}

Subtask #1
6.0 / 12.0

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

Subtask #2
6.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 204 KB Provide a successful but not optimal strategy.
2 Partially correct 0 ms 332 KB Provide a successful but not optimal strategy.
3 Partially correct 0 ms 332 KB Provide a successful but not optimal strategy.
4 Partially correct 0 ms 332 KB Provide a successful but not optimal strategy.
5 Partially correct 0 ms 332 KB Provide a successful but not optimal strategy.
6 Partially correct 0 ms 284 KB Provide a successful but not optimal strategy.
7 Partially correct 0 ms 332 KB Provide a successful but not optimal strategy.
8 Partially correct 0 ms 332 KB Provide a successful but not optimal strategy.
9 Partially correct 0 ms 332 KB Provide a successful but not optimal strategy.
10 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
11 Partially correct 1 ms 460 KB Provide a successful but not optimal strategy.
12 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
13 Partially correct 1 ms 460 KB Provide a successful but not optimal strategy.
14 Partially correct 1 ms 436 KB Provide a successful but not optimal strategy.
15 Partially correct 1 ms 460 KB Provide a successful but not optimal strategy.
16 Partially correct 1 ms 460 KB Provide a successful but not optimal strategy.
17 Partially correct 1 ms 460 KB Provide a successful but not optimal strategy.
18 Partially correct 1 ms 460 KB Provide a successful but not optimal strategy.
19 Partially correct 1 ms 460 KB Provide a successful but not optimal strategy.
20 Partially correct 1 ms 460 KB Provide a successful but not optimal strategy.

Subtask #3
40.0 / 80.0

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