Submission #111961

#TimeUsernameProblemLanguageResultExecution timeMemory
111961aer0parkUntitled (POI11_tem)C++14
8 / 100
290 ms35860 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<ll,ll> pi; ll n,anw,last=-1e11,candw; vector<pi> ar; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cin>>n; for(int i=0;i<n;i++) { ll a,b;cin>>a>>b; ar.push_back({min(a,b),max(a,b)}); } for(int i=0;i<n;i++) { if(last>ar[i].second) { anw=max(anw,candw); candw=1,last=ar[i].first; } else { last=max(last,ar[i].first); candw++; if(i==n-1) anw=max(anw,candw); } } cout<<anw; return 0; }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...