제출 #1200916

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1200916		PlayVoltz	Strange Device (APIO19_strange_device)	C++20	35 / 100	449 ms	63128 KiB

strange_device

#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
using namespace std;

#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, a, b, ans=0, low=LLONG_MIN/2, high=LLONG_MIN/2-1;
	cin>>n>>a>>b;
	__int128 m=a*b/gcd(a, b+1);
	set<pii> s;
	while (n--){
		cin>>a>>b;
		if (b-a+1>=m){
			cout<<(int)m;
			return 0;
		}
		a%=m, b%=m;
		if (a<=b)s.insert(mp(a, b));
		else s.insert(mp(0, b)), s.insert(mp(a, m-1));
	}
	for (auto it=s.begin(); it!=s.end(); ++it){
		if (it->fi<=high)high=max(high, it->se);
		else ans+=high-low+1, low=it->fi, high=it->se;
	}
	cout<<ans+high-low+1;
}

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