oj.uz

Submission #404244

# Submission time Handle Problem Language Result Execution time Memory
404244 2021-05-14T02:14:37 Z VROOM_VARUN Strange Device (APIO19_strange_device) C++17
100 / 100
 614 ms 35308 KB 
/*
ID: varunra2
LANG: C++
TASK: device
*/

#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
  cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif

#define int long long

#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second

const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions

int32_t main() {
  // #ifndef ONLINE_JUDGE
  // freopen("device.in", "r", stdin);
  // freopen("device.out", "w", stdout);
  // #endif
  cin.sync_with_stdio(0);
  cin.tie(0);

  int n, a, b;
  cin >> n >> a >> b;

  int gc = __gcd(a, b + 1);

  // t = b * x
  // b*x + x = (b + 1)*x == 0 mod a

  int x = a / gc;

  int mx;

  if ((int)2e18 / x < b) {
    mx = (int)2e18;
  } else
    mx = x * b;

  VII vals;

  for (int i = 0; i < n; i++) {
    int x, y;
    cin >> x >> y;
    vals.PB(MP(x, y));
  }

  for (int i = 0; i < n; i++) {
    int to = (vals[i].x / mx + 1) * mx - 1;
    if (vals[i].y <= to) {
      vals[i].x %= mx;
      vals[i].y %= mx;
      continue;
    } else {
      vals.PB({0, vals[i].y % mx});
      vals[i].y = to;
      vals[i].y %= mx;
      vals[i].x %= mx;
    }
    // vals[i].y = min(vals[i].y, (vals[i].x / mx + 1) * mx - 1);
    // vals[i].x %= mx;
    // vals[i].y %= mx;
  }

  int ret = 0;

  sort(all(vals));

  int mxx = -1;

  for (int i = 0; i < sz(vals); i++) {
    // from mxx -> vals[i].y - mxx -> vals[i].x
    ret += vals[i].y - vals[i].x + 1;
    ret -= min(vals[i].y - vals[i].x + 1, max(0ll, mxx - vals[i].x + 1));
    mxx = max(mxx, vals[i].y);
  }

  cout << ret << '\n';

  return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 6 ms 976 KB Output is correct
3 Correct 6 ms 1080 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 6 ms 964 KB Output is correct
17 Correct 56 ms 5620 KB Output is correct
18 Correct 1 ms 204 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 362 ms 20140 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 550 ms 18188 KB Output is correct
3 Correct 489 ms 18300 KB Output is correct
4 Correct 489 ms 35236 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 550 ms 18188 KB Output is correct
3 Correct 489 ms 18300 KB Output is correct
4 Correct 489 ms 35236 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 495 ms 35308 KB Output is correct
7 Correct 516 ms 35204 KB Output is correct
8 Correct 496 ms 18112 KB Output is correct
9 Correct 537 ms 18144 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 550 ms 18188 KB Output is correct
3 Correct 489 ms 18300 KB Output is correct
4 Correct 489 ms 35236 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 54 ms 5680 KB Output is correct
7 Correct 52 ms 5640 KB Output is correct
8 Correct 49 ms 5668 KB Output is correct
9 Correct 48 ms 5692 KB Output is correct
10 Correct 49 ms 5668 KB Output is correct
11 Correct 51 ms 5624 KB Output is correct
12 Correct 51 ms 5692 KB Output is correct
13 Correct 50 ms 5684 KB Output is correct
14 Correct 52 ms 5688 KB Output is correct
15 Correct 58 ms 5624 KB Output is correct
16 Correct 65 ms 5676 KB Output is correct
17 Correct 50 ms 5600 KB Output is correct
18 Correct 507 ms 18028 KB Output is correct
19 Correct 598 ms 18136 KB Output is correct
20 Correct 526 ms 18084 KB Output is correct
21 Correct 53 ms 5688 KB Output is correct
22 Correct 49 ms 5688 KB Output is correct
23 Correct 156 ms 18408 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 53 ms 5660 KB Output is correct
3 Correct 60 ms 5636 KB Output is correct
4 Correct 614 ms 18016 KB Output is correct
5 Correct 52 ms 5692 KB Output is correct
6 Correct 79 ms 5680 KB Output is correct
7 Correct 53 ms 5656 KB Output is correct
8 Correct 53 ms 5692 KB Output is correct
9 Correct 62 ms 5692 KB Output is correct
10 Correct 53 ms 5652 KB Output is correct
11 Correct 57 ms 5688 KB Output is correct
12 Correct 46 ms 5628 KB Output is correct
13 Correct 53 ms 5648 KB Output is correct
14 Correct 525 ms 18092 KB Output is correct
15 Correct 53 ms 5672 KB Output is correct
16 Correct 502 ms 18136 KB Output is correct
17 Correct 498 ms 18212 KB Output is correct
18 Correct 1 ms 204 KB Output is correct

Subtask #8
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 6 ms 976 KB Output is correct
3 Correct 6 ms 1080 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 6 ms 964 KB Output is correct
17 Correct 56 ms 5620 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 324 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 362 ms 20140 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 550 ms 18188 KB Output is correct
31 Correct 489 ms 18300 KB Output is correct
32 Correct 489 ms 35236 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 495 ms 35308 KB Output is correct
35 Correct 516 ms 35204 KB Output is correct
36 Correct 496 ms 18112 KB Output is correct
37 Correct 537 ms 18144 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 54 ms 5680 KB Output is correct
40 Correct 52 ms 5640 KB Output is correct
41 Correct 49 ms 5668 KB Output is correct
42 Correct 48 ms 5692 KB Output is correct
43 Correct 49 ms 5668 KB Output is correct
44 Correct 51 ms 5624 KB Output is correct
45 Correct 51 ms 5692 KB Output is correct
46 Correct 50 ms 5684 KB Output is correct
47 Correct 52 ms 5688 KB Output is correct
48 Correct 58 ms 5624 KB Output is correct
49 Correct 65 ms 5676 KB Output is correct
50 Correct 50 ms 5600 KB Output is correct
51 Correct 507 ms 18028 KB Output is correct
52 Correct 598 ms 18136 KB Output is correct
53 Correct 526 ms 18084 KB Output is correct
54 Correct 53 ms 5688 KB Output is correct
55 Correct 49 ms 5688 KB Output is correct
56 Correct 156 ms 18408 KB Output is correct
57 Correct 1 ms 312 KB Output is correct
58 Correct 53 ms 5660 KB Output is correct
59 Correct 60 ms 5636 KB Output is correct
60 Correct 614 ms 18016 KB Output is correct
61 Correct 52 ms 5692 KB Output is correct
62 Correct 79 ms 5680 KB Output is correct
63 Correct 53 ms 5656 KB Output is correct
64 Correct 53 ms 5692 KB Output is correct
65 Correct 62 ms 5692 KB Output is correct
66 Correct 53 ms 5652 KB Output is correct
67 Correct 57 ms 5688 KB Output is correct
68 Correct 46 ms 5628 KB Output is correct
69 Correct 53 ms 5648 KB Output is correct
70 Correct 525 ms 18092 KB Output is correct
71 Correct 53 ms 5672 KB Output is correct
72 Correct 502 ms 18136 KB Output is correct
73 Correct 498 ms 18212 KB Output is correct
74 Correct 1 ms 204 KB Output is correct
75 Correct 1 ms 204 KB Output is correct
76 Correct 1 ms 204 KB Output is correct
77 Correct 1 ms 204 KB Output is correct
78 Correct 1 ms 312 KB Output is correct
79 Correct 6 ms 1048 KB Output is correct
80 Correct 605 ms 18184 KB Output is correct
81 Correct 555 ms 18068 KB Output is correct
82 Correct 526 ms 18140 KB Output is correct
83 Correct 523 ms 18200 KB Output is correct
84 Correct 525 ms 18068 KB Output is correct
85 Correct 520 ms 18132 KB Output is correct
86 Correct 163 ms 18432 KB Output is correct
87 Correct 1 ms 308 KB Output is correct