oj.uz

Submission #625720

# Submission time Handle Problem Language Result Execution time Memory
625720 2022-08-10T17:32:14 Z slime Strange Device (APIO19_strange_device) C++14
10 / 100
 5000 ms 524288 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;
  int A, B;
  cin >> A >> B;
  set<pair<int, int> > st;
  for(int i=0; i<N; i++) {
    int L, R;
    cin >> L >> R;
    for(int j=L; j<=R; j++) {
      st.insert({(j + j/B) % A, j % B});
    } 
  }
  cout << st.size() << "\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 53 ms 19344 KB Output is correct
3 Correct 66 ms 24988 KB Output is correct
4 Correct 9 ms 7940 KB Output is correct
5 Correct 8 ms 7380 KB Output is correct
6 Correct 8 ms 7332 KB Output is correct
7 Correct 10 ms 7508 KB Output is correct
8 Correct 10 ms 7388 KB Output is correct
9 Correct 15 ms 8196 KB Output is correct
10 Correct 8 ms 7248 KB Output is correct
11 Correct 7 ms 7312 KB Output is correct
12 Correct 8 ms 7252 KB Output is correct
13 Correct 8 ms 7312 KB Output is correct
14 Correct 8 ms 7380 KB Output is correct
15 Correct 44 ms 14080 KB Output is correct
16 Correct 30 ms 13692 KB Output is correct
17 Correct 76 ms 13644 KB Output is correct
18 Correct 9 ms 7324 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7292 KB Output is correct
2 Runtime error 2675 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7348 KB Output is correct
2 Correct 138 ms 39316 KB Output is correct
3 Correct 165 ms 39104 KB Output is correct
4 Correct 112 ms 37580 KB Output is correct
5 Execution timed out 5051 ms 69532 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7252 KB Output is correct
2 Correct 491 ms 69940 KB Output is correct
3 Runtime error 1663 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7252 KB Output is correct
2 Correct 491 ms 69940 KB Output is correct
3 Runtime error 1663 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7252 KB Output is correct
2 Correct 491 ms 69940 KB Output is correct
3 Runtime error 1663 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7272 KB Output is correct
2 Runtime error 1193 ms 524288 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7252 KB Output is correct
2 Correct 53 ms 19344 KB Output is correct
3 Correct 66 ms 24988 KB Output is correct
4 Correct 9 ms 7940 KB Output is correct
5 Correct 8 ms 7380 KB Output is correct
6 Correct 8 ms 7332 KB Output is correct
7 Correct 10 ms 7508 KB Output is correct
8 Correct 10 ms 7388 KB Output is correct
9 Correct 15 ms 8196 KB Output is correct
10 Correct 8 ms 7248 KB Output is correct
11 Correct 7 ms 7312 KB Output is correct
12 Correct 8 ms 7252 KB Output is correct
13 Correct 8 ms 7312 KB Output is correct
14 Correct 8 ms 7380 KB Output is correct
15 Correct 44 ms 14080 KB Output is correct
16 Correct 30 ms 13692 KB Output is correct
17 Correct 76 ms 13644 KB Output is correct
18 Correct 9 ms 7324 KB Output is correct
19 Correct 7 ms 7292 KB Output is correct
20 Runtime error 2675 ms 524288 KB Execution killed with signal 9
21 Halted 0 ms 0 KB -