제출 #527023

#제출 시각아이디문제언어결과실행 시간메모리
527023Lobo이상한 기계 (APIO19_strange_device)C++17
30 / 100
450 ms47268 KiB
#include<bits/stdc++.h> using namespace std; const long long inf = (long long) 4e18 + 10; const int inf1 = (int) 1e9 + 10; #define int long long #define dbl long double #define endl '\n' #define sc second #define fr first #define mp make_pair #define pb push_back #define all(x) x.begin(), x.end() #define maxn int gcd(int a, int b) { if(b == 0) return a; a%=b; return gcd(b,a); } void solve() { int n, a, b; cin >> n >> a >> b; int gc = gcd(a,b+1); int q = (b+1)/gc; int m; if(log2(a) + log2(b) + log2(q) - log2(b+1) > log2(inf)) m = inf; else m = (a*b*q)/(b+1); int af = 2; if(m == inf) { af = 1000000; } map<int,int> asdf[af]; vector<pair<int,int>> lr; for(int i = 1; i <= n; i++) { int l, r; cin >> l >> r; if(r-l+1 >= m) { lr.pb(mp(0,m-1)); } else if(l/m != r/m) { //terminam em cantos diferentes l%= m; r%= m; //colocar l,m-1 e 0,r lr.pb(mp(l,m-1)); lr.pb(mp(0,r)); } else { l%= m; r%= m; lr.pb(mp(l,r)); } } sort(all(lr)); int l = 0; int r = -1; int ans = 0; for(auto x : lr) { int l1 = x.fr; int r1 = x.sc; if(l1 > r) { //conta o lr anterior e comeca um novo ans+= r-l+1; l = l1; r = r1; } r = max(r,r1); } ans+= r-l+1; cout << ans << endl; } int32_t main() { ios::sync_with_stdio(false); cin.tie(0); // freopen("in.in", "r", stdin); //freopen("out.out", "w", stdout); int tt = 1; // cin >> tt; while(tt--) solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...