oj.uz

답안 #1037169

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1037169 2024-07-28T09:47:38 Z Dzadzo Newspapers (CEOI21_newspapers) C++14
54 / 100
 116 ms 6996 KB 
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define S second
#define F first
#define pii pair<ll,ll>
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vp vector<pii>
#define vvp vector<vp>
#define vb vector<bool>
#define vvb vector<vb>
#define INF 1000000000000000
#define MOD 1000000007
#define MAXN 100000
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
vvi adj(MAXN+1);
pii best;
vi arr;
void find(int v,int p,int p1,int dist) {
    for (int to:adj[v])
        if (to!=p && to!=p1)
            find(to,v,0,dist+1);
    best=max(best,{dist,v});
}
bool found=false;
void getpath(int v,int p,int u) {
    if (found)return;
    arr.pb(v);
    if (v==u) {
        found=true;
        return;
    }
    for (int to:adj[v])
        if (to!=p)
            getpath(to,v,u);
    if (!found)arr.pop_back();
}
signed main() {
    int n,m;
    cin>>n>>m;
    for (int i=1;i<=m;i++) {
        int u,v;
        cin>>u>>v;
        adj[u].pb(v);
        adj[v].pb(u);
    }
    if (m!=n-1)cout<<"NO\n",exit(0);
    if (n==1) {

        cout<<"YES\n";
        cout<<"1\n1";
        exit(0);
    }
    if (n==2) {

        cout<<"YES\n";
        cout<<"2\n1 1";
        exit(0);
    }
    find(1,0,0,0);
    int U=best.S;
    best={0,0};
    find(U,0,0,0);
    int V=best.S;
    getpath(V,0,U);

    vi ans;
    bool res=true;
    for (int i=1;i<arr.size()-1;i++) {
        best={0,0};
        find(arr[i],arr[i-1],arr[i+1],0);
        if (best.F>2)res=false;
        ans.pb(arr[i]);
        for (int x:adj[arr[i]])if (x!=arr[i-1] && x!=arr[i+1] && adj[x].size()!=1)ans.pb(x);
    }
    if (!res)cout<<"NO\n",exit(0);

    cout<<"YES\n";
    cout<<ans.size()*2<<"\n";
    for (int x:ans)cout<<x<<" ";
    ans.clear();
    reverse(arr.begin(),arr.end());
    for (int i=1;i<arr.size()-1;i++) {
        best={0,0};
        find(arr[i],arr[i-1],arr[i+1],0);
        if (best.F>2)res=false;
        ans.pb(arr[i]);
        for (int x:adj[arr[i]])if (x!=arr[i-1] && x!=arr[i+1] && adj[x].size()!=1)ans.pb(x);
    }
    for (int x:ans)cout<<x<<" ";


}


/*
8 7
1 2
1 3
2 4
2 5
2 8
5 6
5 7
*/

Compilation message

newspapers.cpp: In function 'int main()':
newspapers.cpp:73:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |     for (int i=1;i<arr.size()-1;i++) {
      |                  ~^~~~~~~~~~~~~
newspapers.cpp:87:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   87 |     for (int i=1;i<arr.size()-1;i++) {
      |                  ~^~~~~~~~~~~~~

Subtask #1
6.0 / 12.0

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

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 2 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 2 ms 2648 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 2 ms 2648 KB Output is correct
16 Correct 2 ms 2652 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 2 ms 2652 KB Output is correct
20 Correct 2 ms 2652 KB Output is correct

Subtask #3
40.0 / 80.0

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