oj.uz

Submission #625710

# Submission time Handle Problem Language Result Execution time Memory
625710 2022-08-10T17:23:19 Z slime Strange Device (APIO19_strange_device) C++17
65 / 100
 801 ms 40576 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;
  set<int > st;
  vector<pair<int, char> > segments;
  for(int i=0; i<N; i++) {
    int L, R;
    cin >> L >> R;
    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<int, 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 8 ms 7252 KB Output is correct
2 Correct 14 ms 8408 KB Output is correct
3 Correct 15 ms 8340 KB Output is correct
4 Correct 9 ms 7300 KB Output is correct
5 Correct 9 ms 7372 KB Output is correct
6 Correct 9 ms 7376 KB Output is correct
7 Correct 10 ms 7376 KB Output is correct
8 Correct 8 ms 7368 KB Output is correct
9 Correct 8 ms 7380 KB Output is correct
10 Correct 8 ms 7372 KB Output is correct
11 Correct 8 ms 7372 KB Output is correct
12 Correct 8 ms 7284 KB Output is correct
13 Correct 9 ms 7368 KB Output is correct
14 Correct 8 ms 7252 KB Output is correct
15 Correct 8 ms 7368 KB Output is correct
16 Correct 13 ms 8280 KB Output is correct
17 Correct 82 ms 13888 KB Output is correct
18 Correct 8 ms 7372 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7376 KB Output is correct
2 Incorrect 8 ms 7252 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 8 ms 7252 KB Output is correct
2 Correct 9 ms 7380 KB Output is correct
3 Correct 8 ms 7428 KB Output is correct
4 Correct 9 ms 7432 KB Output is correct
5 Correct 386 ms 40348 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7252 KB Output is correct
2 Correct 763 ms 40432 KB Output is correct
3 Correct 639 ms 40476 KB Output is correct
4 Correct 634 ms 40520 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7252 KB Output is correct
2 Correct 763 ms 40432 KB Output is correct
3 Correct 639 ms 40476 KB Output is correct
4 Correct 634 ms 40520 KB Output is correct
5 Correct 8 ms 7264 KB Output is correct
6 Correct 626 ms 40520 KB Output is correct
7 Correct 586 ms 40548 KB Output is correct
8 Correct 608 ms 40576 KB Output is correct
9 Correct 735 ms 40492 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7252 KB Output is correct
2 Correct 763 ms 40432 KB Output is correct
3 Correct 639 ms 40476 KB Output is correct
4 Correct 634 ms 40520 KB Output is correct
5 Correct 8 ms 7252 KB Output is correct
6 Correct 69 ms 13936 KB Output is correct
7 Correct 72 ms 13924 KB Output is correct
8 Correct 66 ms 13904 KB Output is correct
9 Correct 76 ms 13920 KB Output is correct
10 Correct 62 ms 13888 KB Output is correct
11 Correct 66 ms 13908 KB Output is correct
12 Correct 61 ms 13856 KB Output is correct
13 Correct 80 ms 13900 KB Output is correct
14 Correct 65 ms 13892 KB Output is correct
15 Correct 77 ms 13892 KB Output is correct
16 Correct 74 ms 13936 KB Output is correct
17 Correct 65 ms 13876 KB Output is correct
18 Correct 622 ms 40472 KB Output is correct
19 Correct 581 ms 40472 KB Output is correct
20 Correct 764 ms 40456 KB Output is correct
21 Correct 85 ms 14004 KB Output is correct
22 Correct 72 ms 13884 KB Output is correct
23 Correct 156 ms 26808 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7268 KB Output is correct
2 Correct 72 ms 14020 KB Output is correct
3 Correct 84 ms 13980 KB Output is correct
4 Correct 801 ms 40520 KB Output is correct
5 Correct 73 ms 13980 KB Output is correct
6 Correct 73 ms 13900 KB Output is correct
7 Correct 87 ms 13904 KB Output is correct
8 Correct 87 ms 13888 KB Output is correct
9 Correct 77 ms 13844 KB Output is correct
10 Correct 76 ms 13984 KB Output is correct
11 Correct 72 ms 13860 KB Output is correct
12 Correct 69 ms 13976 KB Output is correct
13 Correct 86 ms 14016 KB Output is correct
14 Correct 740 ms 40512 KB Output is correct
15 Correct 80 ms 13896 KB Output is correct
16 Correct 555 ms 40560 KB Output is correct
17 Correct 610 ms 40444 KB Output is correct
18 Correct 9 ms 7380 KB Output is correct

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7252 KB Output is correct
2 Correct 14 ms 8408 KB Output is correct
3 Correct 15 ms 8340 KB Output is correct
4 Correct 9 ms 7300 KB Output is correct
5 Correct 9 ms 7372 KB Output is correct
6 Correct 9 ms 7376 KB Output is correct
7 Correct 10 ms 7376 KB Output is correct
8 Correct 8 ms 7368 KB Output is correct
9 Correct 8 ms 7380 KB Output is correct
10 Correct 8 ms 7372 KB Output is correct
11 Correct 8 ms 7372 KB Output is correct
12 Correct 8 ms 7284 KB Output is correct
13 Correct 9 ms 7368 KB Output is correct
14 Correct 8 ms 7252 KB Output is correct
15 Correct 8 ms 7368 KB Output is correct
16 Correct 13 ms 8280 KB Output is correct
17 Correct 82 ms 13888 KB Output is correct
18 Correct 8 ms 7372 KB Output is correct
19 Correct 7 ms 7376 KB Output is correct
20 Incorrect 8 ms 7252 KB Output isn't correct
21 Halted 0 ms 0 KB -