Submission #633591

#TimeUsernameProblemLanguageResultExecution timeMemory
633591inksamuraiUnija (COCI17_unija)C++17
100 / 100
318 ms47508 KiB
#include <bits/stdc++.h> #define int ll using namespace std; #define rep(i,n) for(int i=0;i<n;i++) #define rng(i,c,n) for(int i=c;i<n;i++) #define per(i,n) for(int i=n-1;i>=0;i--) #define fi first #define se second #define pb push_back #define sz(a) (int)a.size() #define vec(...) vector<__VA_ARGS__> #define _3PGDklf ios::sync_with_stdio(0),cin.tie(0) typedef long long ll; using pii=pair<int,int>; using vi=vector<int>; void print(){cout<<'\n';} template<class h,class...t> void print(const h&v,const t&...u){cout<<v<<' ',print(u...);} // e signed main(){ _3PGDklf; int n; cin>>n; vec(pii) a(n); rep(i,n){ cin>>a[i].fi>>a[i].se; a[i].fi/=2; a[i].se/=2; } sort(a.begin(), a.end()); int sun=0; vec(pii) stk; stk.pb(pii(0,0)); rep(i,n){ pii p=a[i]; if(!sz(stk)){ stk.pb(p); sun+=p.fi*p.se; }else{ while(sz(stk)>1){ pii np=stk.back(); if(np.se>p.se){ break; }else{ stk.pop_back(); sun-=(np.fi-stk.back().fi)*np.se; } } sun+=(p.fi-stk.back().fi)*p.se; stk.pb(p); } } print(sun*4); }
#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...