| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1018934 | beaconmc | Fire (BOI24_fire) | C++14 | 2098 ms | 12712 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
using namespace std;
vector<vector<ll>> normal;
vector<vector<ll>> overlap;
int solve(ll lo, ll hi){
ll ans = 0;
ll cur = 0;
while (lo < hi){
ll maxi = 0;
while (cur < normal.size()){
if (normal[cur][0] > lo) break;
maxi = max(maxi, normal[cur][1]);
cur++;
}
if (maxi > lo) ans += 1, lo = maxi;
else return 1000000000;
}
return ans;
}
int main(){
ll n,m;
cin >> n >> m;
FOR(i,0,n){
ll a,b;
cin >> a >> b;
if (a<b) normal.push_back({a,b});
else overlap.push_back({b,a});
}
sort(normal.begin(), normal.end());
ll ans = 1000000000;
//check twice
ll left = 0, right = m;
for (auto&i : overlap) left = max(left, i[0]), right = min(right, i[1]);
ans = min(ans, (ll)solve(left, right)+2);
for (auto&i : overlap){
ans = min(ans, (ll)solve(i[0], i[1]) + 1);
}
if (ans >= 1000000000) cout << -1;
else cout << ans;
}Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
