Submission #123529

#TimeUsernameProblemLanguageResultExecution timeMemory
123529MvCTwo Antennas (JOI19_antennas)C++11
0 / 100
432 ms40184 KiB
#pragma GCC target("avx2") #pragma GCC optimization("O3") #pragma GCC optimization("unroll-loops") #include<bits/stdc++.h> //#include "rail.h" #define rc(x) return cout<<x<<endl,0 #define pb push_back #define mkp make_pair #define in insert #define er erase #define fd find #define fr first #define sc second typedef long long ll; typedef long double ld; const ll INF=0x3f3f3f3f3f3f3f3f; const ll llinf=(1LL<<62); const int inf=(1<<30); const int nmax=2e5+50; const int mod=1e9+7; using namespace std; ll n,i,q,l[nmax],r[nmax],x,y,h[nmax],ans; multiset<ll>e[nmax],ad[nmax],s; multiset<ll>::iterator it; int main() { //freopen("sol.in","r",stdin); //freopen("sol.out","w",stdout); //mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0); cin>>n; for(i=1;i<=n;i++)cin>>h[i]>>l[i]>>r[i]; cin>>q; while(q--) { cin>>x>>y; for(i=x;i<=y;i++) { ad[l[i]].in(h[i]); e[r[i]+1].in(h[i]); } ans=-1; s.clear(); for(i=1;i<=n;i++) { for(it=ad[i].begin();it!=ad[i].end();it++)s.in((*it)); for(it=e[i].begin();it!=e[i].end();it++)s.er(s.fd((*it))); if((int)s.size()>1)ans=max(ans,(*s.rbegin())-(*s.begin())); ad[i].clear(); e[i].clear(); } e[n+1].clear(); cout<<ans<<'\n'; } return 0; }

Compilation message (stderr)

antennas.cpp:2:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("O3")
 
antennas.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("unroll-loops")
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...