oj.uz

Submission #760304

# Submission time Handle Problem Language Result Execution time Memory
760304 2023-06-17T12:12:39 Z Sam_a17 Newspapers (CEOI21_newspapers) C++17
52 / 100
 103 ms 596 KB 
///
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int)x.size()
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt __builtin_popcount
 
#define pb push_back
#define popf pop_front
#define popb pop_back
#define ld long double
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
 
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// for random generations
// mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
mt19937 myrand(373);
 
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  if(str == "input") {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
  } else {
    // freopen("skis.in", "r", stdin);
    // freopen("skis.out", "w", stdout);
  }
}
// Indexed Set  
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 1005;
vector<int> adj[N];
int vis[N];
int n, m, dp[N];
int oki = 1;

void dfs1(int node, int parent) {
  dp[node] = 1;
  int ci = 0;
  for(auto i: adj[node]) {
    if(i == parent) continue;
    dfs1(i, node);
    dp[node] = max(dp[node], dp[i] + 1);
  }
}

void dfs2(int node, int parent, int up = 0) {
  multiset<int> mt;
  int ci = 0;
  if(up >= 3) {
    ci++;
  }
  for(auto i: adj[node]) {
    if(i == parent) continue;
    mt.insert(dp[i]);
    if(dp[i] >= 3) {
      ci++;
    }
  }

  if(ci >= 3) {
    oki = 0;
  }

  for(auto i: adj[node]) {
    if(i == parent) continue;
    mt.erase(mt.find(dp[i]));
    if(mt.empty()) {
      dfs2(i, node, up + 1);
    } else {
      dfs2(i, node, max(up + 1, *mt.rbegin() + 1));
    }
    mt.insert(dp[i]);
  }
}

vector<int> ord;
void dfs_con(int node, int parent) {
  ord.push_back(node);

  multiset<pair<int, int>> mt;
  for(auto i: adj[node]) {
    if(i == parent) continue;
    mt.insert({dp[i], i});
  }
  if(!mt.empty()) {
    dfs_con(mt.rbegin()->second, node);
    ord.push_back(node);
    mt.erase(prev(mt.end()));
  }

  for(auto i: mt) {
    if(i.first == 1) continue;
    dfs_con(i.second, node);
    ord.push_back(node);
  }
}
 
void solve_() {
  cin >> n >> m;
 
  if(m > n - 1) {
    cout << "NO" << endl;
    exit(0);
  }

  int ok = 1, g = -1;
  if(m != n - 1) {
    ok = 0;
  }
 
  vector<int> deg(n + 1);
  for(int i = 1; i <= m; i++) {
    int a, b; cin >> a >> b;
    adj[a].push_back(b);
    adj[b].push_back(a);
    if(a > b) {
      swap(a, b);
    }
    if(ok && b != (a + 1)) {
      ok = 0;
    }
    deg[a]++, deg[b]++;
    if(deg[a] >= 2) {
      g = a;
    }
    if(deg[b] >= 2) {
      g = a;
    }
  }

  if(n == 1) {
    cout << "YES" << '\n';
    cout << 1 << '\n';
    cout << 1 << '\n';
    return;
  } else if(n == 2) {
    cout << "YES" << '\n';
    cout << 2 << '\n';
    cout << 1 << " " << 1 << '\n'; 
    return;
  } else if(n == 3) {
    cout << "YES" << '\n';
    cout << 2 << '\n';
    cout << g << " " << g << '\n'; 
    return;
  }

  int ok2 = 0;
  for(int i = 1; i <= n; i++) {
    oki = 1;
    dfs1(i, 0);
    dfs2(i, 0);

    if(oki) {
      ok2 = 1;
      dfs_con(i, 0);

      cout << "YES" << '\n';
      cout << 2 * sz(ord) << '\n';
      for(auto j: ord) {
        cout << j << " ";
      }
      
      for(auto j: ord) {
        cout << j << " ";
      }
      return;
    }
  }

  if(!ok2) {
    cout << "NO" << '\n';
    exit(0);
  }

}
 
int main() {
  setIO();
 
  auto solve = [&](int test_case)-> void {
    for(int i = 1; i <= test_case; i++) {
      solve_();
    }
  };
 
  int test_cases = 1;
  // cin >> test_cases;
  solve(test_cases);
 
  return 0;
}

Compilation message

newspapers.cpp: In function 'void dfs1(int, int)':
newspapers.cpp:87:7: warning: unused variable 'ci' [-Wunused-variable]
   87 |   int ci = 0;
      |       ^~
newspapers.cpp: In function 'void setIO(std::string)':
newspapers.cpp:70:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
newspapers.cpp:71:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 12.0

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

Subtask #2
6.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Partially correct 1 ms 340 KB Provide a successful but not optimal strategy.
5 Partially correct 1 ms 340 KB Provide a successful but not optimal strategy.
6 Partially correct 0 ms 340 KB Provide a successful but not optimal strategy.
7 Partially correct 1 ms 340 KB Provide a successful but not optimal strategy.
8 Partially correct 0 ms 340 KB Provide a successful but not optimal strategy.
9 Partially correct 0 ms 340 KB Provide a successful but not optimal strategy.
10 Partially correct 1 ms 340 KB Provide a successful but not optimal strategy.
11 Partially correct 1 ms 596 KB Provide a successful but not optimal strategy.
12 Partially correct 1 ms 468 KB Provide a successful but not optimal strategy.
13 Partially correct 1 ms 468 KB Provide a successful but not optimal strategy.
14 Partially correct 1 ms 468 KB Provide a successful but not optimal strategy.
15 Partially correct 1 ms 468 KB Provide a successful but not optimal strategy.
16 Partially correct 1 ms 596 KB Provide a successful but not optimal strategy.
17 Partially correct 1 ms 596 KB Provide a successful but not optimal strategy.
18 Partially correct 2 ms 596 KB Provide a successful but not optimal strategy.
19 Partially correct 2 ms 596 KB Provide a successful but not optimal strategy.
20 Partially correct 1 ms 596 KB Provide a successful but not optimal strategy.

Subtask #3
40.0 / 80.0

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