oj.uz

답안 #784505

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
784505 2023-07-16T07:34:35 Z christinelynn 이상한 기계 (APIO19_strange_device) C++17
35 / 100
 1465 ms 64668 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
// #define i128 long long
#define i128 __int128_t

int n, a, b;
vector<pair<int, int>> sg;
const int maks = 1e18;

// i128 gcd(i128 a, i128 b) {
//   if (b == 0) return a;
//   return gcd(b, a%b);
// }

bool comp(pair<int, int> a, pair<int, int> b) {
  return (a.first < b.first or (a.first == b.first and a.second < b.second));
}

signed main() {
  i128 temp;
  // int temp;
  int size;
  cin >> n >> a >> b;
  temp = (a/__gcd(a,b+1))*b;
  // if ((b+1 % a) == 0) size = b;
  // if (temp > maks) size = maks;
  // else size = temp;
  size = temp;

  int l, r;
  for (int i = 0; i < n; i++) {
    cin >> l >> r;
    // cout << l << " " << r << endl;
    if (r - l + 1 >= size) {
      cout << size << endl;
      return 0;
    } else if (l%size > r%size) {
      sg.push_back({l%size, 1});
      sg.push_back({size-1, 2});
      sg.push_back({0, 1});
      sg.push_back({r%size, 2});
    } else {
      sg.push_back({l%size, 1});
      sg.push_back({r%size, 2});
    }
  }
  sort(sg.begin(), sg.end(), comp);

  int cnt = 0, l2;
  vector<pair<int, int>> ans;
  for (int i = 0; i < sg.size(); i++) {
    // cout << sg[i].first << " " << sg[i].second << endl;
    if (sg[i].second == 1) {
      if (cnt == 0) l2 = sg[i].first;
      cnt++;
    } else cnt--;

    if (cnt == 0) {
      ans.push_back({l2, sg[i].first});
      // ans += sg[i].first-l2+1.;
    }
  }
  // cout << ans << endl;

  int res = 0;
  for (auto i: ans) {
    // cout << i.first << " " << i.second << endl;
    res += (i.second - i.first + 1);
  }
  cout << res << endl;

}

Compilation message

strange_device.cpp: In function 'int main()':
strange_device.cpp:53:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |   for (int i = 0; i < sg.size(); i++) {
      |                   ~~^~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 292 KB Output is correct
2 Correct 15 ms 1080 KB Output is correct
3 Correct 13 ms 1092 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 12 ms 1064 KB Output is correct
17 Correct 139 ms 7648 KB Output is correct
18 Incorrect 1 ms 212 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Incorrect 1 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 300 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 871 ms 33516 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1264 ms 63872 KB Output is correct
3 Correct 1259 ms 63904 KB Output is correct
4 Correct 1207 ms 63912 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1264 ms 63872 KB Output is correct
3 Correct 1259 ms 63904 KB Output is correct
4 Correct 1207 ms 63912 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 1268 ms 63740 KB Output is correct
7 Correct 1245 ms 63656 KB Output is correct
8 Correct 1234 ms 63784 KB Output is correct
9 Correct 1340 ms 63764 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1264 ms 63872 KB Output is correct
3 Correct 1259 ms 63904 KB Output is correct
4 Correct 1207 ms 63912 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 116 ms 7800 KB Output is correct
7 Correct 126 ms 7892 KB Output is correct
8 Correct 123 ms 7780 KB Output is correct
9 Correct 123 ms 7728 KB Output is correct
10 Correct 119 ms 7792 KB Output is correct
11 Correct 127 ms 7804 KB Output is correct
12 Correct 119 ms 7728 KB Output is correct
13 Correct 129 ms 7728 KB Output is correct
14 Correct 120 ms 7768 KB Output is correct
15 Correct 130 ms 7796 KB Output is correct
16 Correct 127 ms 7812 KB Output is correct
17 Correct 170 ms 7772 KB Output is correct
18 Correct 1275 ms 63708 KB Output is correct
19 Correct 1280 ms 63780 KB Output is correct
20 Correct 1355 ms 63684 KB Output is correct
21 Correct 134 ms 7700 KB Output is correct
22 Correct 112 ms 7732 KB Output is correct
23 Correct 373 ms 17504 KB Output is correct

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 123 ms 7708 KB Output is correct
3 Correct 128 ms 7464 KB Output is correct
4 Correct 1465 ms 64240 KB Output is correct
5 Correct 126 ms 7540 KB Output is correct
6 Correct 129 ms 7516 KB Output is correct
7 Correct 152 ms 7444 KB Output is correct
8 Correct 149 ms 7572 KB Output is correct
9 Correct 135 ms 7508 KB Output is correct
10 Correct 130 ms 7520 KB Output is correct
11 Correct 130 ms 7540 KB Output is correct
12 Correct 131 ms 7524 KB Output is correct
13 Correct 141 ms 7904 KB Output is correct
14 Correct 1378 ms 64668 KB Output is correct
15 Correct 156 ms 7744 KB Output is correct
16 Correct 1220 ms 63748 KB Output is correct
17 Correct 1259 ms 63724 KB Output is correct
18 Incorrect 1 ms 212 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #8
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 292 KB Output is correct
2 Correct 15 ms 1080 KB Output is correct
3 Correct 13 ms 1092 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 12 ms 1064 KB Output is correct
17 Correct 139 ms 7648 KB Output is correct
18 Incorrect 1 ms 212 KB Output isn't correct
19 Halted 0 ms 0 KB -