제출 #781776

#제출 시각아이디문제언어결과실행 시간메모리
781776devariaota이상한 기계 (APIO19_strange_device)C++17
0 / 100
222 ms15848 KiB
#include<bits/stdc++.h> using namespace std; #define ll long long #define fi first #define se second #define endl "\n" #define pii pair<ll,ll> #define pb push_back #define vi vector<ll> #define pque priority_queue #define pqueg priority_queue<ll,vector<ll>,greater<ll>> #define que queue<ll> #define FOR(m,i,n) for(int i=(m); i<=(n); i++) #define FORM(m,i,n) for(int i=(m); i>=(n); i--) ll n; ll l[1000100],r[1000100]; ll a,b,ans; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> a >> b; FOR(1,i,n) { cin >> l[i] >> r[i]; } if(n == 1) { ll y = min(b,r[1]-l[1]+1); ll x = min(a,(r[1]-l[1]+1)/b); cout << max(x,y) << endl; } // else if(b == 1) { // FOR(1,i,n) { // aa = l[i]*2; // if(a % 2 == 1) { // bb = min(r[i]-l[i]+1,a); // if() // } // else { // bb = min((r[i]-l[i]+1)/2),a/2); // } // } // if(a%2 == 0) { // cout << (range.se - range.fi) / 2 << endl; // } // else { // cout << range.se - range.fi + 1 << endl; // } // cout << ans << endl; // } }
#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...