oj.uz

Submission #600156

# Submission time Handle Problem Language Result Execution time Memory
600156 2022-07-20T13:48:07 Z slime Newspapers (CEOI21_newspapers) C++14
6 / 100
 10 ms 7404 KB 
#include "bits/stdc++.h"
using namespace std;
#define int long long
const int MAXN = 3e5 + 10;
const int MOD = 1e9 + 7;
#define ll __int128
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
ll read() { int x; cin >> x; return (ll)x; }
long long bm(long long b, long long p) {
  if(p==0) return 1 % MOD;
  long long r = bm(b, p >> 1);
  if(p&1) return (((r*r) % MOD) * b) % MOD;
  return (r*r) % MOD;
}
long long inv(long long b) { 
  return bm(b, MOD-2);
}
long long f[MAXN];
long long nCr(int n, int r) { 
  long long ans = f[n]; ans *= inv(f[r]); ans %= MOD;
  ans *= inv(f[n-r]); ans %= MOD; return ans;
}
long long fib[MAXN], lucas[MAXN];
void precomp() { 
  for(int i=0; i<MAXN; i++) f[i] = (i == 0 ? 1 % MOD : (f[i-1] * i) % MOD); 
  lucas[0] = 2;
  lucas[1] = 1;
  for(int i=2; i<MAXN; i++) lucas[i] = (lucas[i-2] + lucas[i-1]) % MOD;
  fib[0] = 0;
  fib[1] = 1;
  for(int i=2; i<MAXN; i++) fib[i] = (fib[i-2] + fib[i-1]) % MOD;
}
int fastlog(int x) {
  return (x == 0 ? -1 : 64 - __builtin_clzll(x) - 1);
}
void gay(int i) { cout << "Case #" << i << ": "; }
int csb(int l, int r, int k) { // count number of [l, r] such that i & 2^k > 0
  if(l > r) return 0;
  if(l == 0) {
    int s = r / (1ll << (k+1)); // number of complete cycles
    int t = r % (1ll << (k+1));
    int ans = s * (1ll << k);
    ans += (t >= (1ll << k) ? t - (1ll << k) + 1 : 0);
    return ans;
  }
  else return csb(0, r, k) - csb(0, l - 1, k);
}
int lis(vector<int> a) {
  int n = a.size();
  int bucket[n+1];
  for(int i=1; i<=n; i++) bucket[i] = 1e18;
  int ans = 1;
  for(int x: a) {
    auto it = lower_bound(bucket + 1, bucket +n +1, x);
    int d = distance(bucket, it);
    ans = max(ans, d);
    bucket[d] = min(bucket[d], x);
  }
  return ans;
}
void solve(int tc) {
  int n, m;
  cin >> n >> m;
  vector<int> adj[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(m + 1 == n) {
    cout << "YES\n";
    cout << 2*n << "\n";
    for(int i=1; i<=n; i++) cout << i << " ";
    for(int i=n; i>=1; i--) cout << i << " \n"[i == 1];
  }
  else cout << "NO\n";
}
int32_t main() {
  precomp();
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
}
// I don't know geometry.
// Teaming is unfair.

Subtask #1
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Partially correct 8 ms 7252 KB Provide a successful but not optimal strategy.
2 Partially correct 8 ms 7252 KB Provide a successful but not optimal strategy.
3 Partially correct 8 ms 7252 KB Provide a successful but not optimal strategy.
4 Partially correct 8 ms 7368 KB Provide a successful but not optimal strategy.
5 Partially correct 8 ms 7264 KB Provide a successful but not optimal strategy.
6 Partially correct 8 ms 7340 KB Failed to provide a successful strategy.
7 Correct 8 ms 7320 KB Output is correct
8 Partially correct 7 ms 7252 KB Failed to provide a successful strategy.
9 Incorrect 7 ms 7252 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
6.0 / 8.0

# Verdict Execution time Memory Grader output
1 Partially correct 9 ms 7296 KB Provide a successful but not optimal strategy.
2 Partially correct 8 ms 7248 KB Provide a successful but not optimal strategy.
3 Partially correct 8 ms 7324 KB Provide a successful but not optimal strategy.
4 Partially correct 8 ms 7280 KB Provide a successful but not optimal strategy.
5 Partially correct 8 ms 7332 KB Provide a successful but not optimal strategy.
6 Partially correct 8 ms 7256 KB Provide a successful but not optimal strategy.
7 Partially correct 8 ms 7252 KB Provide a successful but not optimal strategy.
8 Partially correct 8 ms 7252 KB Provide a successful but not optimal strategy.
9 Partially correct 9 ms 7252 KB Provide a successful but not optimal strategy.
10 Partially correct 9 ms 7252 KB Provide a successful but not optimal strategy.
11 Partially correct 9 ms 7392 KB Provide a successful but not optimal strategy.
12 Partially correct 8 ms 7380 KB Provide a successful but not optimal strategy.
13 Partially correct 10 ms 7388 KB Provide a successful but not optimal strategy.
14 Partially correct 9 ms 7380 KB Provide a successful but not optimal strategy.
15 Partially correct 10 ms 7380 KB Provide a successful but not optimal strategy.
16 Partially correct 8 ms 7404 KB Provide a successful but not optimal strategy.
17 Partially correct 10 ms 7380 KB Provide a successful but not optimal strategy.
18 Partially correct 8 ms 7380 KB Provide a successful but not optimal strategy.
19 Partially correct 9 ms 7380 KB Provide a successful but not optimal strategy.
20 Partially correct 9 ms 7380 KB Provide a successful but not optimal strategy.

Subtask #3
0.0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 8 ms 7252 KB Provide a successful but not optimal strategy.
2 Partially correct 8 ms 7252 KB Provide a successful but not optimal strategy.
3 Partially correct 8 ms 7252 KB Provide a successful but not optimal strategy.
4 Partially correct 8 ms 7368 KB Provide a successful but not optimal strategy.
5 Partially correct 8 ms 7264 KB Provide a successful but not optimal strategy.
6 Partially correct 8 ms 7340 KB Failed to provide a successful strategy.
7 Correct 8 ms 7320 KB Output is correct
8 Partially correct 7 ms 7252 KB Failed to provide a successful strategy.
9 Incorrect 7 ms 7252 KB Output isn't correct
10 Halted 0 ms 0 KB -