oj.uz

Submission #489059

# Submission time Handle Problem Language Result Execution time Memory
489059 2021-11-21T06:11:46 Z Wayne_Yan Newspapers (CEOI21_newspapers) C++17
100 / 100
 194 ms 8112 KB 
#include <bits/extc++.h>
using namespace std;
using namespace __gnu_pbds;

typedef int64_t ll;
typedef long double ld;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define pb emplace_back
#define mp make_pair
#define mt make_tuple
#define pii pair<int,int>
#define F(n) Fi(i,n)
#define Fi(i,n) Fl(i,0,n)
#define Fl(i,l,n) for(int i=l;i<n;i++)
#define RF(n) RFi(i,n)
#define RFi(i,n) RFl(i,0,n)
#define RFl(i,l,n) for(int i=n-1;i>=l;i--)
#define all(v) begin(v),end(v)
#define siz(v) (ll(v.size()))
#define get_pos(v,x) (lower_bound(all(v),x)-begin(v))
#define sort_uni(v) sort(begin(v),end(v)),v.erase(unique(begin(v),end(v)),end(v))
#define mem(v,x) memset(v,x,sizeof v)
#define ff first
#define ss second
#define mid ((l+r)>>1)
#define RAN(a,b) uniform_int_distribution<int> (a, b)(rng)
/*
   bool chain = true;
   Fl(i, 1, n+1){
   if(edges[i].size() > 2){
   chain = false;
   break;
   }
   }  

   if(chain){
   printf("YES\n");
   printf("%d\n", 2 * (n-2));
   F(n-2) printf("%d ", i+2);
   if(n%2 == 0) RF(n-2) printf("%d ", i+2);
   else F(n-2) printf("%d ", i+2);


   }else{
   printf("YES\n1\n1"); 
   }
*/    
template <typename T> using max_heap = __gnu_pbds::priority_queue<T,less<T> >;
template <typename T> using min_heap = __gnu_pbds::priority_queue<T,greater<T> >;
template <typename T> using rbt = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;

const int maxN = 1010;
vector<int> edges[maxN];
bool visited[maxN];

int depth1[maxN], mx_depth1 = -1, deepest_node1;
void dfs1(int pos, int fa){ // dfs1 finds one endpoint of the diameter
  for(int i : edges[pos]){
    if(visited[i] || i == fa) continue;
    depth1[i] = depth1[pos] + 1;
    if(mx_depth1 < depth1[i]){
      mx_depth1 = depth1[i];
      deepest_node1 = i;
    }
    dfs1(i, pos);
  }
}

int sz[maxN];
int depth[maxN];

void dfs_sz(int pos, int fa){
  sz[pos] = 1;

  for(int i : edges[pos]){
    if(visited[i] || i == fa) continue;
    depth[i] = depth[pos] + 1;
    dfs_sz(i, pos);
    sz[pos] += sz[i];
  }
}

vector<int> tour;
int cnt;
int nn;
void Euler_Tour(int pos, int fa){
  tour.pb(pos);
  cnt++;
  if(cnt == nn) return;
  bool danger = false;
  for(int i : edges[pos]){
    if(visited[i] || i == fa) continue;
    if(sz[i] >= 2){
      if(!danger){
        danger = true;
      }else{
        printf("NO\n");
        exit(0);
      }
    }
    Euler_Tour(i, pos);
    if(cnt == nn) return;
    tour.pb(pos);
  }
}

signed main(){
  
  int n,m;
  cin >> n >> m;
  nn = n;
  F(m){
    int x,y;
    cin >> x >> y;
    edges[x].pb(y);
    edges[y].pb(x);
  }
  if(n == 1){
    printf("YES\n1\n1");
    exit(0);
  }
  if(n == 2){
    printf("YES\n2\n1 1");
    exit(0);
  }
  if(m == n-1){
    F(n) {
      if(edges[i+1].size() == 1){
        visited[i+1] = true;
        nn--;
        sz[i+1] = 1000000;
      }
    }
    F(n){
      if(!visited[i+1]){
        mx_depth1 = 0;
        deepest_node1 = i+1;
        dfs1(i+1, 0);
        break;
      }
    }
    int root = deepest_node1;
    
    dfs_sz(root, 0);
    
    Fl(i, 1, n+1){
      sort(all(edges[i]), [&](int a, int b){return sz[a] < sz[b];});
    }
    
    Euler_Tour(root, 0);
    printf("YES\n");
    printf("%d\n", 2 * (int)tour.size());
    for(int i : tour){
      printf("%d ", i);
    }
    if(tour.size() % 2 == 0) reverse(all(tour));
    for(int i : tour){
      printf("%d ", i);
    }
  }else{
    printf("NO\n");
  }
  
  return 0;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 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 1 ms 460 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 452 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 468 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 0 ms 204 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 0 ms 336 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 0 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 0 ms 336 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 0 ms 336 KB Output is correct
19 Correct 0 ms 336 KB Output is correct
20 Correct 0 ms 336 KB Output is correct
21 Correct 0 ms 336 KB Output is correct
22 Correct 0 ms 336 KB Output is correct
23 Correct 0 ms 336 KB Output is correct
24 Correct 0 ms 336 KB Output is correct
25 Correct 0 ms 336 KB Output is correct
26 Correct 0 ms 336 KB Output is correct
27 Correct 0 ms 336 KB Output is correct
28 Correct 0 ms 336 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 0 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 0 ms 336 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 0 ms 336 KB Output is correct
37 Correct 0 ms 336 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 1 ms 336 KB Output is correct
40 Correct 0 ms 336 KB Output is correct
41 Correct 0 ms 336 KB Output is correct
42 Correct 0 ms 336 KB Output is correct
43 Correct 0 ms 336 KB Output is correct
44 Correct 0 ms 336 KB Output is correct
45 Correct 0 ms 336 KB Output is correct
46 Correct 0 ms 336 KB Output is correct
47 Correct 0 ms 336 KB Output is correct
48 Correct 1 ms 336 KB Output is correct
49 Correct 1 ms 336 KB Output is correct
50 Correct 1 ms 336 KB Output is correct
51 Correct 0 ms 336 KB Output is correct
52 Correct 0 ms 336 KB Output is correct
53 Correct 1 ms 336 KB Output is correct
54 Correct 0 ms 336 KB Output is correct
55 Correct 1 ms 336 KB Output is correct
56 Correct 0 ms 336 KB Output is correct
57 Correct 0 ms 336 KB Output is correct
58 Correct 0 ms 336 KB Output is correct
59 Correct 1 ms 208 KB Output is correct
60 Correct 1 ms 336 KB Output is correct
61 Correct 0 ms 336 KB Output is correct
62 Correct 0 ms 336 KB Output is correct
63 Correct 1 ms 336 KB Output is correct
64 Correct 1 ms 336 KB Output is correct
65 Correct 0 ms 208 KB Output is correct
66 Correct 0 ms 208 KB Output is correct
67 Correct 0 ms 336 KB Output is correct
68 Correct 0 ms 336 KB Output is correct
69 Correct 0 ms 336 KB Output is correct
70 Correct 0 ms 336 KB Output is correct
71 Correct 0 ms 208 KB Output is correct
72 Correct 1 ms 336 KB Output is correct
73 Correct 0 ms 336 KB Output is correct
74 Correct 0 ms 336 KB Output is correct
75 Correct 0 ms 336 KB Output is correct
76 Correct 0 ms 328 KB Output is correct
77 Correct 0 ms 336 KB Output is correct
78 Correct 0 ms 336 KB Output is correct
79 Correct 1 ms 336 KB Output is correct
80 Correct 1 ms 332 KB Output is correct
81 Correct 1 ms 336 KB Output is correct
82 Correct 1 ms 336 KB Output is correct
83 Correct 1 ms 336 KB Output is correct
84 Correct 1 ms 336 KB Output is correct
85 Correct 1 ms 336 KB Output is correct
86 Correct 1 ms 336 KB Output is correct
87 Correct 1 ms 336 KB Output is correct
88 Correct 1 ms 336 KB Output is correct
89 Correct 1 ms 336 KB Output is correct
90 Correct 1 ms 340 KB Output is correct
91 Correct 1 ms 340 KB Output is correct
92 Correct 1 ms 340 KB Output is correct
93 Correct 1 ms 336 KB Output is correct
94 Correct 1 ms 336 KB Output is correct
95 Correct 1 ms 336 KB Output is correct
96 Correct 1 ms 336 KB Output is correct
97 Correct 2 ms 336 KB Output is correct
98 Correct 1 ms 336 KB Output is correct
99 Correct 1 ms 336 KB Output is correct
100 Correct 1 ms 336 KB Output is correct
101 Correct 1 ms 336 KB Output is correct
102 Correct 1 ms 336 KB Output is correct
103 Correct 1 ms 336 KB Output is correct
104 Correct 1 ms 340 KB Output is correct
105 Correct 1 ms 336 KB Output is correct
106 Correct 1 ms 340 KB Output is correct
107 Correct 1 ms 340 KB Output is correct
108 Correct 1 ms 340 KB Output is correct
109 Correct 1 ms 340 KB Output is correct
110 Correct 1 ms 340 KB Output is correct
111 Correct 1 ms 336 KB Output is correct
112 Correct 2 ms 336 KB Output is correct
113 Correct 1 ms 336 KB Output is correct
114 Correct 1 ms 336 KB Output is correct
115 Correct 1 ms 340 KB Output is correct
116 Correct 1 ms 336 KB Output is correct
117 Correct 1 ms 336 KB Output is correct
118 Correct 1 ms 336 KB Output is correct
119 Correct 1 ms 336 KB Output is correct
120 Correct 1 ms 336 KB Output is correct
121 Correct 1 ms 336 KB Output is correct
122 Correct 1 ms 336 KB Output is correct
123 Correct 1 ms 340 KB Output is correct
124 Correct 1 ms 336 KB Output is correct
125 Correct 1 ms 336 KB Output is correct
126 Correct 1 ms 336 KB Output is correct
127 Correct 1 ms 336 KB Output is correct
128 Correct 1 ms 336 KB Output is correct
129 Correct 1 ms 336 KB Output is correct
130 Correct 1 ms 336 KB Output is correct
131 Correct 1 ms 336 KB Output is correct
132 Correct 1 ms 332 KB Output is correct
133 Correct 1 ms 336 KB Output is correct
134 Correct 37 ms 1960 KB Output is correct
135 Correct 37 ms 1864 KB Output is correct
136 Correct 82 ms 5440 KB Output is correct
137 Correct 60 ms 3380 KB Output is correct
138 Correct 112 ms 4636 KB Output is correct
139 Correct 194 ms 7896 KB Output is correct
140 Correct 23 ms 1440 KB Output is correct
141 Correct 8 ms 720 KB Output is correct
142 Correct 161 ms 7360 KB Output is correct
143 Correct 192 ms 8112 KB Output is correct
144 Correct 1 ms 464 KB Output is correct
145 Correct 1 ms 460 KB Output is correct