Submission #1181944

#	Time	Username	Problem	Language	Result	Execution time	Memory
1181944		epicci23	Strange Device (APIO19_strange_device)	C++20	65 / 100	434 ms	39656 KiB

strange_device

#include "bits/stdc++.h"
#define int long long
#define all(v) v.begin() , v.end()
#define sz(a) (int)a.size()
using namespace std;

const int INF = 1e18 + 5;

void _(){
  int _n, _a, _b;
  cin >> _n >> _a >> _b;
  
  int n = _n, a = _a, b = _b;
  int rep;
  if( (a  / __gcd(a, b + 1)) >= (INF + b - 1) / b) rep = INF;
  else rep = (a  / __gcd(a, b + 1)) * b;

  vector<int> Zip, Add;

  Zip.push_back(0);
  Zip.push_back(rep - 1);
  Zip.push_back(rep);

  vector<array<int, 2>> V;

  for(int i = 1; i <= n; i++){
  	int _l, _r;
  	cin >> _l >> _r;
    int l = _l, r = _r;
  	int gl = l % rep;
  	int gr = r % rep;
  	V.push_back({gl, gr});
    Zip.push_back(gl);
    Zip.push_back(gr + 1);
  }

  sort(all(Zip));
  Zip.erase(unique(all(Zip)), Zip.end());
  
  int m = sz(Zip);
  Add.assign(m, 0);

  for(array<int,2> X : V){
    int pl = lower_bound(all(Zip), X[0]) - Zip.begin();
    int pr = lower_bound(all(Zip), X[1] + 1) - Zip.begin();
    
    Add[pl]++;
    Add[pr]--;
    if(pl > pr) Add[0]++; 
  }

  int ans = 0, cur = 0;

  for(int i = 0; i + 1 < m; i++){
    cur += Add[i];
    if(i + 1 < m && cur > 0) ans += Zip[i + 1] - Zip[i];
  }

  cout << (long long) ans << '\n';
}

int32_t main(){
  cin.tie(0); ios::sync_with_stdio(0);
  int tc=1;//cin >> tc;
  while(tc--) _();
  return 0;
}

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