Submission #281740

#TimeUsernameProblemLanguageResultExecution timeMemory
281740AKaan37Roller Coaster Railroad (IOI16_railroad)C++17
0 / 100
221 ms16028 KiB
//Bismillahirrahmanirrahim #include "railroad.h" #include <bits/stdc++.h> using namespace std; typedef long long lo; typedef pair< lo,lo > PII; typedef pair< lo,PII > PIII; #define fi first #define se second #define mp make_pair #define endl "\n" #define pb push_back #define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) #define FOR for(int i=1;i<=n;i++) #define mid ((start+end)/2) #define ort ((bas+son)/2) const lo inf = 1000000000000000000; const lo KOK = 100000; const lo LOG = 30; const lo li = 500005; const lo mod = 1000000007; int m,b[li],a[li],k,flag,t; int cev; set<PIII> st; string s; vector<int> v; long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) { int n = (int) s.size(); for(int i=0;i<n;i++){ st.insert({-t[i]+s[i],{t[i],s[i]}}); } flag=0; auto it=st.begin(); int last=0; while(st.size()){ it=st.begin(); PIII p=*it; st.erase(it); //~ it=st.lower_bound({{p.se,-inf}); if(p.se.se<last){flag=1;break;} //~ int last=p.se.fi; } return flag; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...