oj.uz

Submission #678481

# Submission time Handle Problem Language Result Execution time Memory
678481 2023-01-06T04:42:12 Z cig32 Strange Device (APIO19_strange_device) C++17
100 / 100
 1447 ms 89320 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(R - L + 1 > B * len) {
      cout << (int) (B * len) << "\n";
      return;
    }
    else 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);
}

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 8908 KB Output is correct
3 Correct 20 ms 8916 KB Output is correct
4 Correct 8 ms 7376 KB Output is correct
5 Correct 8 ms 7368 KB Output is correct
6 Correct 9 ms 7372 KB Output is correct
7 Correct 9 ms 7368 KB Output is correct
8 Correct 8 ms 7272 KB Output is correct
9 Correct 8 ms 7340 KB Output is correct
10 Correct 8 ms 7368 KB Output is correct
11 Correct 8 ms 7328 KB Output is correct
12 Correct 8 ms 7356 KB Output is correct
13 Correct 8 ms 7324 KB Output is correct
14 Correct 8 ms 7372 KB Output is correct
15 Correct 9 ms 7276 KB Output is correct
16 Correct 21 ms 8852 KB Output is correct
17 Correct 85 ms 18364 KB Output is correct
18 Correct 8 ms 7368 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 7368 KB Output is correct
2 Correct 9 ms 7252 KB Output is correct
3 Correct 8 ms 7252 KB Output is correct
4 Correct 8 ms 7368 KB Output is correct
5 Correct 8 ms 7252 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7252 KB Output is correct
2 Correct 9 ms 7512 KB Output is correct
3 Correct 9 ms 7508 KB Output is correct
4 Correct 8 ms 7508 KB Output is correct
5 Correct 448 ms 74152 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 7368 KB Output is correct
2 Correct 791 ms 81708 KB Output is correct
3 Correct 810 ms 89320 KB Output is correct
4 Correct 761 ms 77848 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 7368 KB Output is correct
2 Correct 791 ms 81708 KB Output is correct
3 Correct 810 ms 89320 KB Output is correct
4 Correct 761 ms 77848 KB Output is correct
5 Correct 8 ms 7368 KB Output is correct
6 Correct 861 ms 78004 KB Output is correct
7 Correct 806 ms 77152 KB Output is correct
8 Correct 937 ms 79688 KB Output is correct
9 Correct 1062 ms 85608 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 7368 KB Output is correct
2 Correct 791 ms 81708 KB Output is correct
3 Correct 810 ms 89320 KB Output is correct
4 Correct 761 ms 77848 KB Output is correct
5 Correct 9 ms 7252 KB Output is correct
6 Correct 98 ms 18284 KB Output is correct
7 Correct 88 ms 18332 KB Output is correct
8 Correct 81 ms 18276 KB Output is correct
9 Correct 96 ms 18328 KB Output is correct
10 Correct 91 ms 18288 KB Output is correct
11 Correct 87 ms 18284 KB Output is correct
12 Correct 89 ms 18364 KB Output is correct
13 Correct 100 ms 18284 KB Output is correct
14 Correct 75 ms 18372 KB Output is correct
15 Correct 155 ms 18336 KB Output is correct
16 Correct 103 ms 18272 KB Output is correct
17 Correct 84 ms 18368 KB Output is correct
18 Correct 817 ms 80752 KB Output is correct
19 Correct 841 ms 80492 KB Output is correct
20 Correct 1447 ms 83544 KB Output is correct
21 Correct 99 ms 18272 KB Output is correct
22 Correct 72 ms 18312 KB Output is correct
23 Correct 212 ms 50096 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 7248 KB Output is correct
2 Correct 110 ms 18332 KB Output is correct
3 Correct 92 ms 18384 KB Output is correct
4 Correct 1089 ms 80576 KB Output is correct
5 Correct 102 ms 18372 KB Output is correct
6 Correct 108 ms 18284 KB Output is correct
7 Correct 94 ms 18328 KB Output is correct
8 Correct 104 ms 18368 KB Output is correct
9 Correct 114 ms 18300 KB Output is correct
10 Correct 107 ms 18320 KB Output is correct
11 Correct 92 ms 18372 KB Output is correct
12 Correct 138 ms 18328 KB Output is correct
13 Correct 104 ms 18364 KB Output is correct
14 Correct 1420 ms 86012 KB Output is correct
15 Correct 105 ms 18284 KB Output is correct
16 Correct 869 ms 83768 KB Output is correct
17 Correct 801 ms 83756 KB Output is correct
18 Correct 8 ms 7272 KB Output is correct

Subtask #8
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7252 KB Output is correct
2 Correct 14 ms 8908 KB Output is correct
3 Correct 20 ms 8916 KB Output is correct
4 Correct 8 ms 7376 KB Output is correct
5 Correct 8 ms 7368 KB Output is correct
6 Correct 9 ms 7372 KB Output is correct
7 Correct 9 ms 7368 KB Output is correct
8 Correct 8 ms 7272 KB Output is correct
9 Correct 8 ms 7340 KB Output is correct
10 Correct 8 ms 7368 KB Output is correct
11 Correct 8 ms 7328 KB Output is correct
12 Correct 8 ms 7356 KB Output is correct
13 Correct 8 ms 7324 KB Output is correct
14 Correct 8 ms 7372 KB Output is correct
15 Correct 9 ms 7276 KB Output is correct
16 Correct 21 ms 8852 KB Output is correct
17 Correct 85 ms 18364 KB Output is correct
18 Correct 8 ms 7368 KB Output is correct
19 Correct 14 ms 7368 KB Output is correct
20 Correct 9 ms 7252 KB Output is correct
21 Correct 8 ms 7252 KB Output is correct
22 Correct 8 ms 7368 KB Output is correct
23 Correct 8 ms 7252 KB Output is correct
24 Correct 8 ms 7252 KB Output is correct
25 Correct 9 ms 7512 KB Output is correct
26 Correct 9 ms 7508 KB Output is correct
27 Correct 8 ms 7508 KB Output is correct
28 Correct 448 ms 74152 KB Output is correct
29 Correct 11 ms 7368 KB Output is correct
30 Correct 791 ms 81708 KB Output is correct
31 Correct 810 ms 89320 KB Output is correct
32 Correct 761 ms 77848 KB Output is correct
33 Correct 8 ms 7368 KB Output is correct
34 Correct 861 ms 78004 KB Output is correct
35 Correct 806 ms 77152 KB Output is correct
36 Correct 937 ms 79688 KB Output is correct
37 Correct 1062 ms 85608 KB Output is correct
38 Correct 9 ms 7252 KB Output is correct
39 Correct 98 ms 18284 KB Output is correct
40 Correct 88 ms 18332 KB Output is correct
41 Correct 81 ms 18276 KB Output is correct
42 Correct 96 ms 18328 KB Output is correct
43 Correct 91 ms 18288 KB Output is correct
44 Correct 87 ms 18284 KB Output is correct
45 Correct 89 ms 18364 KB Output is correct
46 Correct 100 ms 18284 KB Output is correct
47 Correct 75 ms 18372 KB Output is correct
48 Correct 155 ms 18336 KB Output is correct
49 Correct 103 ms 18272 KB Output is correct
50 Correct 84 ms 18368 KB Output is correct
51 Correct 817 ms 80752 KB Output is correct
52 Correct 841 ms 80492 KB Output is correct
53 Correct 1447 ms 83544 KB Output is correct
54 Correct 99 ms 18272 KB Output is correct
55 Correct 72 ms 18312 KB Output is correct
56 Correct 212 ms 50096 KB Output is correct
57 Correct 16 ms 7248 KB Output is correct
58 Correct 110 ms 18332 KB Output is correct
59 Correct 92 ms 18384 KB Output is correct
60 Correct 1089 ms 80576 KB Output is correct
61 Correct 102 ms 18372 KB Output is correct
62 Correct 108 ms 18284 KB Output is correct
63 Correct 94 ms 18328 KB Output is correct
64 Correct 104 ms 18368 KB Output is correct
65 Correct 114 ms 18300 KB Output is correct
66 Correct 107 ms 18320 KB Output is correct
67 Correct 92 ms 18372 KB Output is correct
68 Correct 138 ms 18328 KB Output is correct
69 Correct 104 ms 18364 KB Output is correct
70 Correct 1420 ms 86012 KB Output is correct
71 Correct 105 ms 18284 KB Output is correct
72 Correct 869 ms 83768 KB Output is correct
73 Correct 801 ms 83756 KB Output is correct
74 Correct 8 ms 7272 KB Output is correct
75 Correct 8 ms 7268 KB Output is correct
76 Correct 9 ms 7372 KB Output is correct
77 Correct 19 ms 7328 KB Output is correct
78 Correct 11 ms 7252 KB Output is correct
79 Correct 18 ms 8828 KB Output is correct
80 Correct 1098 ms 85300 KB Output is correct
81 Correct 1098 ms 83844 KB Output is correct
82 Correct 1102 ms 82572 KB Output is correct
83 Correct 1139 ms 84860 KB Output is correct
84 Correct 1064 ms 85772 KB Output is correct
85 Correct 1074 ms 84528 KB Output is correct
86 Correct 201 ms 50116 KB Output is correct
87 Correct 9 ms 7368 KB Output is correct