제출 #1191501

#제출 시각아이디문제언어결과실행 시간메모리
1191501laureFire (BOI24_fire)C++20
0 / 100
2094 ms328 KiB
#include<bits/stdc++.h> #define int long long using namespace std; signed main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n,m; cin>>n>>m; vector<pair<int,int>>v(n); for(int i=0;i<n;i++)cin>>v[i].first>>v[i].second; sort(v.begin(),v.end()); if(v[0].first!=0){cout<<-1<<'\n';return 0;} int i=0,mx=v[0].second; while(v[i+1].first==0) { i++; mx=max(v[i].second,mx); } int ans=1; bool b=1; while(v[i].second!=0&&i<n) { int mx1=mx; if(v[i+1].first>mx){b=0;break;} while(v[i+1].first<=mx1&&i+1<n) { i++; mx=max(mx,v[i].second); } ans++; } if(b)cout<<ans<<'\n'; else cout<<-1<<'\n'; }
#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...