oj.uz

Submission #530895

# Submission time Handle Problem Language Result Execution time Memory
530895 2022-02-27T05:01:28 Z azberjibiou Newspapers (CEOI21_newspapers) C++17
100 / 100
 68 ms 6356 KB 
#include <bits/stdc++.h>
#define gibon ios::sync_with_stdio(false); cin.tie(0);
#define fir first
#define sec second
#define pii pair<int, int>
#define pll pair<ll, ll>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
typedef long long ll;
using namespace std;
int dx[4]={0, 1, 0, -1}, dy[4]={1, 0, -1 , 0};
const int mxN=1005;
const int mxM=1010;
const int mxK=105;
const int MOD=1000000007;
const ll INF=1e15;
const ll P1=1000000007;
const ll P2=1000000009;
int N, M;
vector <int> v[mxN], child[mxN];
int dis[mxN];
void dfs0(int now, int pre)
{
    for(int nxt : v[now])   if(nxt!=pre)
    {
        dis[nxt]=dis[now]+1;
        dfs0(nxt, now);
    }
}
int sub[mxN];
bool ok=true;
void dfs1(int now, int pre)
{
    int cnt2=0;
    for(int nxt : v[now])   if(nxt!=pre)
    {
        dis[nxt]=dis[now]+1;
        child[now].push_back(nxt);
        dfs1(nxt, now);
        sub[now]=max(sub[nxt]+1, sub[now]);
        if(sub[nxt]>=2) cnt2++;
    }
    if(cnt2>=2) ok=false;
}
vector <int> ans;
int ncnt;
bool dfs2(int now)
{
    ncnt--;
    ans.push_back(now);
    if(ncnt==0) return false;
    sort(child[now].begin(), child[now].end(), [](int a, int b){return sub[a]<sub[b];});
    for(int nxt : child[now])
    {
        if(sub[nxt]==1)
        {
            if(!dfs2(nxt))  return false;
            ans.push_back(now);
        }
        if(sub[nxt]>=2) if(dfs2(nxt))   return false;
    }
    return true;
}
int main()
{
    gibon
    cin >> N >> M;
    for(int i=0;i<M;i++)
    {
        int a, b;   cin >> a >> b;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    if(M>=N)
    {
        cout << "NO";
        return 0;
    }
    if(N==1)
    {
        cout << "YES\n1\n1";
        return 0;
    }
    if(N==2)
    {
        cout << "YES\n2\n1 1";
        return 0;
    }
    dfs0(1, -1);
    int far=1;
    for(int i=2;i<=N;i++)   if(dis[far]<dis[i]) far=i;
    for(int i=1;i<=N;i++)   dis[i]=0;
    dfs1(far, -1);
    if(!ok)
    {
        cout << "NO";
        return 0;
    }
    for(int i=1;i<=N;i++)   if(v[i].size()>=2)  ncnt++;
    dfs2(child[far][0]);
    cout << "YES\n";
    cout << 2*ans.size() << '\n';
    for(int i=0;i<ans.size();i++)   cout << ans[i] << " ";
    for(int i=ans.size()-1;i>=0;i--)    cout << ans[i] << " ";
}

Compilation message

newspapers.cpp: In function 'int main()':
newspapers.cpp:104:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  104 |     for(int i=0;i<ans.size();i++)   cout << ans[i] << " ";
      |                 ~^~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 356 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 360 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 356 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 0 ms 360 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 0 ms 332 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 0 ms 364 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 0 ms 332 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 0 ms 332 KB Output is correct
44 Correct 0 ms 364 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 0 ms 332 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 0 ms 364 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 1 ms 332 KB Output is correct
54 Correct 0 ms 332 KB Output is correct
55 Correct 0 ms 332 KB Output is correct
56 Correct 1 ms 332 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 1 ms 372 KB Output is correct
59 Correct 0 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 1 ms 332 KB Output is correct
63 Correct 1 ms 332 KB Output is correct
64 Correct 1 ms 332 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 360 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 1 ms 544 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 2 ms 460 KB Output is correct

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 356 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 360 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 356 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 0 ms 360 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 0 ms 332 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 0 ms 364 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 0 ms 332 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 0 ms 332 KB Output is correct
44 Correct 0 ms 364 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 0 ms 332 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 0 ms 364 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 1 ms 332 KB Output is correct
54 Correct 0 ms 332 KB Output is correct
55 Correct 0 ms 332 KB Output is correct
56 Correct 1 ms 332 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 1 ms 372 KB Output is correct
59 Correct 0 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 1 ms 332 KB Output is correct
63 Correct 1 ms 332 KB Output is correct
64 Correct 1 ms 332 KB Output is correct
65 Correct 1 ms 332 KB Output is correct
66 Correct 1 ms 332 KB Output is correct
67 Correct 0 ms 332 KB Output is correct
68 Correct 0 ms 332 KB Output is correct
69 Correct 1 ms 364 KB Output is correct
70 Correct 1 ms 364 KB Output is correct
71 Correct 1 ms 332 KB Output is correct
72 Correct 1 ms 332 KB Output is correct
73 Correct 0 ms 332 KB Output is correct
74 Correct 0 ms 332 KB Output is correct
75 Correct 1 ms 332 KB Output is correct
76 Correct 0 ms 332 KB Output is correct
77 Correct 1 ms 332 KB Output is correct
78 Correct 1 ms 332 KB Output is correct
79 Correct 1 ms 332 KB Output is correct
80 Correct 1 ms 332 KB Output is correct
81 Correct 1 ms 332 KB Output is correct
82 Correct 1 ms 364 KB Output is correct
83 Correct 1 ms 376 KB Output is correct
84 Correct 1 ms 376 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 340 KB Output is correct
88 Correct 1 ms 340 KB Output is correct
89 Correct 1 ms 376 KB Output is correct
90 Correct 1 ms 468 KB Output is correct
91 Correct 1 ms 468 KB Output is correct
92 Correct 1 ms 468 KB Output is correct
93 Correct 1 ms 380 KB Output is correct
94 Correct 1 ms 472 KB Output is correct
95 Correct 1 ms 472 KB Output is correct
96 Correct 1 ms 368 KB Output is correct
97 Correct 1 ms 460 KB Output is correct
98 Correct 1 ms 460 KB Output is correct
99 Correct 1 ms 460 KB Output is correct
100 Correct 2 ms 460 KB Output is correct
101 Correct 1 ms 396 KB Output is correct
102 Correct 1 ms 460 KB Output is correct
103 Correct 1 ms 372 KB Output is correct
104 Correct 2 ms 460 KB Output is correct
105 Correct 1 ms 468 KB Output is correct
106 Correct 1 ms 468 KB Output is correct
107 Correct 1 ms 468 KB Output is correct
108 Correct 1 ms 468 KB Output is correct
109 Correct 1 ms 468 KB Output is correct
110 Correct 1 ms 460 KB Output is correct
111 Correct 1 ms 368 KB Output is correct
112 Correct 1 ms 460 KB Output is correct
113 Correct 1 ms 460 KB Output is correct
114 Correct 1 ms 460 KB Output is correct
115 Correct 1 ms 460 KB Output is correct
116 Correct 1 ms 460 KB Output is correct
117 Correct 1 ms 460 KB Output is correct
118 Correct 1 ms 460 KB Output is correct
119 Correct 1 ms 460 KB Output is correct
120 Correct 1 ms 368 KB Output is correct
121 Correct 1 ms 460 KB Output is correct
122 Correct 1 ms 460 KB Output is correct
123 Correct 1 ms 460 KB Output is correct
124 Correct 1 ms 460 KB Output is correct
125 Correct 1 ms 460 KB Output is correct
126 Correct 1 ms 460 KB Output is correct
127 Correct 1 ms 460 KB Output is correct
128 Correct 1 ms 460 KB Output is correct
129 Correct 1 ms 372 KB Output is correct
130 Correct 1 ms 368 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 13 ms 1572 KB Output is correct
135 Correct 12 ms 1588 KB Output is correct
136 Correct 35 ms 4708 KB Output is correct
137 Correct 20 ms 2912 KB Output is correct
138 Correct 35 ms 3652 KB Output is correct
139 Correct 68 ms 6252 KB Output is correct
140 Correct 10 ms 1396 KB Output is correct
141 Correct 4 ms 692 KB Output is correct
142 Correct 56 ms 5792 KB Output is correct
143 Correct 67 ms 6356 KB Output is correct
144 Correct 1 ms 460 KB Output is correct
145 Correct 1 ms 460 KB Output is correct