제출 #977124

#제출 시각아이디문제언어결과실행 시간메모리
977124notyou이상한 기계 (APIO19_strange_device)C++17
0 / 100
224 ms348 KiB
#include <bits/stdc++.h> // #include <ext/pb_ds/assoc_container.hpp> // #include <ext/pb_ds/tree_policy.hpp> #define ll long long #define pb push_back #define vl vector<ll> #define fi first #define se second #define in insert #define all(v) v.begin(), v.end() #define bpc(x) __builtin_popcount(x) #define endl "\n" using namespace std; const ll inf = 1e18; const ll mod = 1e9 + 7; const int sz = 4e5 + 5; const int LG = 21; // using namespace __gnu_pbds; // tree <ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> rbt; ll gcd(ll a, ll b){ return __gcd(a, b); } ll lcm(ll a, ll b){ return (a * b) / gcd(a, b); } void solve(){ ll n, a, b, i, l, r, s = 0; cin >> n >> a >> b; for(i = 1; i <= n; i++){ cin >> l >> r; s += (r - l + 1); } ll lp = lcm(b + 1, a); s = min(s, lp); cout << s << endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ll t = 1; // cin >> t; while(t--){ solve(); } } /* 4 100 10 30 30 70 20 40 60 20 4 100 60 20 10 30 20 40 30 70 */
#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...