oj.uz

Submission #625717

# Submission time Handle Problem Language Result Execution time Memory
625717 2022-08-10T17:24:56 Z slime Strange Device (APIO19_strange_device) C++17
65 / 100
 894 ms 73324 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;
}
bool cmp(pair<int, char> a, pair<int, char> b) {
  if(a.first != b.first) return a.first < b.first;
  return a.second > b.second;
}
void solve(int tc) {
  int N;
  cin >> N;
  ll A, B;
  A =read();
  B =read();
  ll g = gcd((int) A, (int) B + 1);
  ll len = A / g;
  vector<pair<ll, char> > segments;
  for(int i=0; i<N; i++) {
    ll L, R;
    L = read();
    R = read();
    if(L % (B * len) > R % (B * len)) {
      segments.emplace_back(L % (B * len), 'S');
      segments.emplace_back(B * len - 1, 'E');
      segments.emplace_back(0, 'S');
      segments.emplace_back(R % (B * len), 'E');
    }
    else {
      segments.emplace_back(L % (B * len), 'S');
      segments.emplace_back(R % (B * len), 'E');
    }
  }
  sort(segments.begin(), segments.end(), cmp);
  int ans = 0;
  int str = -1;
  int bal = 0;
  for(pair<ll, char> x: segments) {
    if(x.second == 'S') {
      bal++;
      if(bal == 1) str = x.first;
    }
    else {
      bal--;
      if(bal == 0) ans += x.first - str + 1;
    }
  }
  cout << ans << "\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
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7252 KB Output is correct
2 Correct 14 ms 8532 KB Output is correct
3 Correct 17 ms 8532 KB Output is correct
4 Correct 8 ms 7372 KB Output is correct
5 Correct 8 ms 7252 KB Output is correct
6 Correct 7 ms 7252 KB Output is correct
7 Correct 8 ms 7380 KB Output is correct
8 Correct 8 ms 7280 KB Output is correct
9 Correct 8 ms 7320 KB Output is correct
10 Correct 7 ms 7252 KB Output is correct
11 Correct 8 ms 7380 KB Output is correct
12 Correct 8 ms 7252 KB Output is correct
13 Correct 8 ms 7308 KB Output is correct
14 Correct 8 ms 7252 KB Output is correct
15 Correct 8 ms 7380 KB Output is correct
16 Correct 13 ms 8468 KB Output is correct
17 Correct 80 ms 15692 KB Output is correct
18 Correct 9 ms 7252 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7252 KB Output is correct
2 Incorrect 9 ms 7264 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7252 KB Output is correct
2 Correct 8 ms 7380 KB Output is correct
3 Correct 8 ms 7472 KB Output is correct
4 Correct 8 ms 7380 KB Output is correct
5 Correct 407 ms 73112 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7252 KB Output is correct
2 Correct 724 ms 73180 KB Output is correct
3 Correct 758 ms 73228 KB Output is correct
4 Correct 667 ms 73324 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7252 KB Output is correct
2 Correct 724 ms 73180 KB Output is correct
3 Correct 758 ms 73228 KB Output is correct
4 Correct 667 ms 73324 KB Output is correct
5 Correct 7 ms 7312 KB Output is correct
6 Correct 694 ms 73160 KB Output is correct
7 Correct 640 ms 73096 KB Output is correct
8 Correct 674 ms 73080 KB Output is correct
9 Correct 844 ms 73072 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7252 KB Output is correct
2 Correct 724 ms 73180 KB Output is correct
3 Correct 758 ms 73228 KB Output is correct
4 Correct 667 ms 73324 KB Output is correct
5 Correct 9 ms 7252 KB Output is correct
6 Correct 70 ms 15668 KB Output is correct
7 Correct 78 ms 15656 KB Output is correct
8 Correct 64 ms 15716 KB Output is correct
9 Correct 71 ms 15684 KB Output is correct
10 Correct 70 ms 15656 KB Output is correct
11 Correct 80 ms 15644 KB Output is correct
12 Correct 63 ms 15600 KB Output is correct
13 Correct 80 ms 15616 KB Output is correct
14 Correct 63 ms 15688 KB Output is correct
15 Correct 80 ms 15692 KB Output is correct
16 Correct 79 ms 15592 KB Output is correct
17 Correct 72 ms 15656 KB Output is correct
18 Correct 697 ms 73124 KB Output is correct
19 Correct 628 ms 73124 KB Output is correct
20 Correct 855 ms 73116 KB Output is correct
21 Correct 97 ms 15744 KB Output is correct
22 Correct 72 ms 15704 KB Output is correct
23 Correct 165 ms 40220 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7252 KB Output is correct
2 Correct 75 ms 15720 KB Output is correct
3 Correct 105 ms 15680 KB Output is correct
4 Correct 894 ms 73164 KB Output is correct
5 Correct 78 ms 15732 KB Output is correct
6 Correct 77 ms 15636 KB Output is correct
7 Correct 78 ms 15716 KB Output is correct
8 Correct 83 ms 15700 KB Output is correct
9 Correct 74 ms 15620 KB Output is correct
10 Correct 87 ms 15688 KB Output is correct
11 Correct 78 ms 15692 KB Output is correct
12 Correct 68 ms 15680 KB Output is correct
13 Correct 81 ms 15616 KB Output is correct
14 Correct 840 ms 73124 KB Output is correct
15 Correct 99 ms 15608 KB Output is correct
16 Correct 626 ms 73164 KB Output is correct
17 Correct 688 ms 73160 KB Output is correct
18 Correct 9 ms 7252 KB Output is correct

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7252 KB Output is correct
2 Correct 14 ms 8532 KB Output is correct
3 Correct 17 ms 8532 KB Output is correct
4 Correct 8 ms 7372 KB Output is correct
5 Correct 8 ms 7252 KB Output is correct
6 Correct 7 ms 7252 KB Output is correct
7 Correct 8 ms 7380 KB Output is correct
8 Correct 8 ms 7280 KB Output is correct
9 Correct 8 ms 7320 KB Output is correct
10 Correct 7 ms 7252 KB Output is correct
11 Correct 8 ms 7380 KB Output is correct
12 Correct 8 ms 7252 KB Output is correct
13 Correct 8 ms 7308 KB Output is correct
14 Correct 8 ms 7252 KB Output is correct
15 Correct 8 ms 7380 KB Output is correct
16 Correct 13 ms 8468 KB Output is correct
17 Correct 80 ms 15692 KB Output is correct
18 Correct 9 ms 7252 KB Output is correct
19 Correct 9 ms 7252 KB Output is correct
20 Incorrect 9 ms 7264 KB Output isn't correct
21 Halted 0 ms 0 KB -