oj.uz

답안 #625724

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
625724 2022-08-10T17:36:55 Z slime 이상한 기계 (APIO19_strange_device) C++17
100 / 100
 964 ms 107564 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);
}
// I don't know geometry.
// Teaming is unfair.

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 7252 KB Output is correct
2 Correct 13 ms 8464 KB Output is correct
3 Correct 15 ms 8432 KB Output is correct
4 Correct 8 ms 7252 KB Output is correct
5 Correct 7 ms 7260 KB Output is correct
6 Correct 8 ms 7348 KB Output is correct
7 Correct 8 ms 7380 KB Output is correct
8 Correct 8 ms 7380 KB Output is correct
9 Correct 8 ms 7384 KB Output is correct
10 Correct 8 ms 7380 KB Output is correct
11 Correct 8 ms 7252 KB Output is correct
12 Correct 8 ms 7372 KB Output is correct
13 Correct 8 ms 7284 KB Output is correct
14 Correct 8 ms 7252 KB Output is correct
15 Correct 7 ms 7380 KB Output is correct
16 Correct 14 ms 8532 KB Output is correct
17 Correct 97 ms 15604 KB Output is correct
18 Correct 8 ms 7252 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 7288 KB Output is correct
2 Correct 10 ms 7252 KB Output is correct
3 Correct 9 ms 7252 KB Output is correct
4 Correct 8 ms 7312 KB Output is correct
5 Correct 7 ms 7372 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 7252 KB Output is correct
2 Correct 9 ms 7408 KB Output is correct
3 Correct 8 ms 7380 KB Output is correct
4 Correct 8 ms 7380 KB Output is correct
5 Correct 418 ms 73124 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 7252 KB Output is correct
2 Correct 699 ms 73072 KB Output is correct
3 Correct 734 ms 73124 KB Output is correct
4 Correct 673 ms 73160 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 7252 KB Output is correct
2 Correct 699 ms 73072 KB Output is correct
3 Correct 734 ms 73124 KB Output is correct
4 Correct 673 ms 73160 KB Output is correct
5 Correct 8 ms 7252 KB Output is correct
6 Correct 706 ms 73076 KB Output is correct
7 Correct 683 ms 73276 KB Output is correct
8 Correct 739 ms 73200 KB Output is correct
9 Correct 871 ms 73144 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 7252 KB Output is correct
2 Correct 699 ms 73072 KB Output is correct
3 Correct 734 ms 73124 KB Output is correct
4 Correct 673 ms 73160 KB Output is correct
5 Correct 8 ms 7252 KB Output is correct
6 Correct 64 ms 15692 KB Output is correct
7 Correct 74 ms 15648 KB Output is correct
8 Correct 66 ms 15696 KB Output is correct
9 Correct 83 ms 15616 KB Output is correct
10 Correct 70 ms 15600 KB Output is correct
11 Correct 84 ms 15680 KB Output is correct
12 Correct 70 ms 15696 KB Output is correct
13 Correct 76 ms 15660 KB Output is correct
14 Correct 70 ms 15640 KB Output is correct
15 Correct 80 ms 15652 KB Output is correct
16 Correct 79 ms 15688 KB Output is correct
17 Correct 92 ms 15688 KB Output is correct
18 Correct 696 ms 73168 KB Output is correct
19 Correct 670 ms 73108 KB Output is correct
20 Correct 879 ms 73264 KB Output is correct
21 Correct 102 ms 15644 KB Output is correct
22 Correct 68 ms 15636 KB Output is correct
23 Correct 183 ms 40216 KB Output is correct

Subtask #7
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 7252 KB Output is correct
2 Correct 79 ms 15644 KB Output is correct
3 Correct 84 ms 15700 KB Output is correct
4 Correct 888 ms 73192 KB Output is correct
5 Correct 84 ms 15756 KB Output is correct
6 Correct 88 ms 15644 KB Output is correct
7 Correct 81 ms 15748 KB Output is correct
8 Correct 82 ms 15680 KB Output is correct
9 Correct 77 ms 15632 KB Output is correct
10 Correct 90 ms 15680 KB Output is correct
11 Correct 80 ms 15688 KB Output is correct
12 Correct 67 ms 15660 KB Output is correct
13 Correct 92 ms 15640 KB Output is correct
14 Correct 919 ms 73208 KB Output is correct
15 Correct 86 ms 15680 KB Output is correct
16 Correct 643 ms 73236 KB Output is correct
17 Correct 710 ms 73176 KB Output is correct
18 Correct 8 ms 7264 KB Output is correct

Subtask #8
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 7252 KB Output is correct
2 Correct 13 ms 8464 KB Output is correct
3 Correct 15 ms 8432 KB Output is correct
4 Correct 8 ms 7252 KB Output is correct
5 Correct 7 ms 7260 KB Output is correct
6 Correct 8 ms 7348 KB Output is correct
7 Correct 8 ms 7380 KB Output is correct
8 Correct 8 ms 7380 KB Output is correct
9 Correct 8 ms 7384 KB Output is correct
10 Correct 8 ms 7380 KB Output is correct
11 Correct 8 ms 7252 KB Output is correct
12 Correct 8 ms 7372 KB Output is correct
13 Correct 8 ms 7284 KB Output is correct
14 Correct 8 ms 7252 KB Output is correct
15 Correct 7 ms 7380 KB Output is correct
16 Correct 14 ms 8532 KB Output is correct
17 Correct 97 ms 15604 KB Output is correct
18 Correct 8 ms 7252 KB Output is correct
19 Correct 10 ms 7288 KB Output is correct
20 Correct 10 ms 7252 KB Output is correct
21 Correct 9 ms 7252 KB Output is correct
22 Correct 8 ms 7312 KB Output is correct
23 Correct 7 ms 7372 KB Output is correct
24 Correct 8 ms 7252 KB Output is correct
25 Correct 9 ms 7408 KB Output is correct
26 Correct 8 ms 7380 KB Output is correct
27 Correct 8 ms 7380 KB Output is correct
28 Correct 418 ms 73124 KB Output is correct
29 Correct 8 ms 7252 KB Output is correct
30 Correct 699 ms 73072 KB Output is correct
31 Correct 734 ms 73124 KB Output is correct
32 Correct 673 ms 73160 KB Output is correct
33 Correct 8 ms 7252 KB Output is correct
34 Correct 706 ms 73076 KB Output is correct
35 Correct 683 ms 73276 KB Output is correct
36 Correct 739 ms 73200 KB Output is correct
37 Correct 871 ms 73144 KB Output is correct
38 Correct 8 ms 7252 KB Output is correct
39 Correct 64 ms 15692 KB Output is correct
40 Correct 74 ms 15648 KB Output is correct
41 Correct 66 ms 15696 KB Output is correct
42 Correct 83 ms 15616 KB Output is correct
43 Correct 70 ms 15600 KB Output is correct
44 Correct 84 ms 15680 KB Output is correct
45 Correct 70 ms 15696 KB Output is correct
46 Correct 76 ms 15660 KB Output is correct
47 Correct 70 ms 15640 KB Output is correct
48 Correct 80 ms 15652 KB Output is correct
49 Correct 79 ms 15688 KB Output is correct
50 Correct 92 ms 15688 KB Output is correct
51 Correct 696 ms 73168 KB Output is correct
52 Correct 670 ms 73108 KB Output is correct
53 Correct 879 ms 73264 KB Output is correct
54 Correct 102 ms 15644 KB Output is correct
55 Correct 68 ms 15636 KB Output is correct
56 Correct 183 ms 40216 KB Output is correct
57 Correct 7 ms 7252 KB Output is correct
58 Correct 79 ms 15644 KB Output is correct
59 Correct 84 ms 15700 KB Output is correct
60 Correct 888 ms 73192 KB Output is correct
61 Correct 84 ms 15756 KB Output is correct
62 Correct 88 ms 15644 KB Output is correct
63 Correct 81 ms 15748 KB Output is correct
64 Correct 82 ms 15680 KB Output is correct
65 Correct 77 ms 15632 KB Output is correct
66 Correct 90 ms 15680 KB Output is correct
67 Correct 80 ms 15688 KB Output is correct
68 Correct 67 ms 15660 KB Output is correct
69 Correct 92 ms 15640 KB Output is correct
70 Correct 919 ms 73208 KB Output is correct
71 Correct 86 ms 15680 KB Output is correct
72 Correct 643 ms 73236 KB Output is correct
73 Correct 710 ms 73176 KB Output is correct
74 Correct 8 ms 7264 KB Output is correct
75 Correct 8 ms 7380 KB Output is correct
76 Correct 7 ms 7356 KB Output is correct
77 Correct 8 ms 7300 KB Output is correct
78 Correct 8 ms 7332 KB Output is correct
79 Correct 14 ms 8916 KB Output is correct
80 Correct 922 ms 107248 KB Output is correct
81 Correct 934 ms 107208 KB Output is correct
82 Correct 945 ms 107216 KB Output is correct
83 Correct 879 ms 107248 KB Output is correct
84 Correct 868 ms 107564 KB Output is correct
85 Correct 964 ms 107404 KB Output is correct
86 Correct 205 ms 50084 KB Output is correct
87 Correct 8 ms 7380 KB Output is correct