제출 #968727

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
968727	2024-04-24 00:27:02	vjudge1	이상한 기계 (APIO19_strange_device)	C++17	100 / 100	372 ms	112252 KiB

strange_device

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
class strangeDevice{
private:
  using ll=long long;
  using i128=__int128;
public:
  long long count(long long A, long long B, vector<long long> left, vector<long long> right) {
    long long ans{0ll};
    i128 F = i128(A / __gcd(A, B + 1)) * B;
    vector<pair<ll,ll> > rgs, rgx;
    for(int i{0}; i < (int)left.size(); ++i){
      long long l{left[i]}, r{right[i]};
      long long len{r - l + 1};
      if(len>=F) return F;
      l %= F, r %= F;
      if(l <= r) rgs.emplace_back(l, r);
      else rgs.emplace_back(l, F - 1),rgs.emplace_back(0, r);
    }
    sort(rgs.begin(), rgs.end());
    for(auto [l,r]: rgs){
      if(rgx.empty() || rgx.back().second < l ) rgx.emplace_back(l, r);
      else rgx.back().second = max(rgx.back().second, r);
    }
    for(auto [l,r]: rgx) ans += r - l + 1;
    return ans;
  }
}solution;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 20 / 20
• Subtask 7: 20 / 20
• Subtask 8: 30 / 30