Submission #1159650

#TimeUsernameProblemLanguageResultExecution timeMemory
1159650thelegendary083D Histogram (COCI20_histogram)C++17
0 / 110
37 ms71304 KiB
#include<bits/stdc++.h> #define pb push_back #define mp make_pair #define int long long #define vi vector<int> #define vvi vector<vector<int>> #define pii pair<int, int> #define vpii vector<pair<int, int>> #define vc vector<char> #define vb vector<bool> #define mii map<int,int> #define f0r(i,n) for(int i=0;i<n;i++) #define FOR(i,k,n) for(int i=k;i<n;i++) #define all(v) (v).begin(),(v).end() #define rall(v) (v).rbegin(),(v).rend() #define in(a) int a; cin>>a #define in2(a,b) int a,b; cin>>a>>b #define in3(a,b,c) int a,b,c; cin>>a>>b>>c #define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d #define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];} #define out(a) cout<<a<<'\n' #define out2(a,b) cout<<a<<' '<<b<<'\n' #define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n' #define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n' #define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n' #define dout(a) cout<<a<<' '<<#a<<'\n' #define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n' #define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';} const int leg = 1e9 + 7; const int mod = 998244353; using namespace std; const int mxn = 1e6 + 5; vector<set<int>>bval(mxn); int sz[mxn]; int par[mxn]; int find(int x){ while(par[x] != x)x = par[x]; return x; } int ans = 0; void unite(int a, int b, int small){ a = find(a); b = find(b); if(sz[a] < sz[b])swap(a,b); sz[a] += sz[b]; for(auto u : bval[b]){ bval[a].insert(u); } par[b] = a; ans = max(ans, sz[a] * small * (*bval[a].begin())); } signed main(){ ios::sync_with_stdio(false); cin.tie(NULL); //ifstream cin(".in"); //ofstream cout(".out"); in(n); vi a(n); vi b(n); f0r(i,n){ in2(c,d); a[i] = c; b[i] = d; } vector<vi>w(mxn); f0r(i,n){ w[a[i]].pb(i); } f0r(i,n){ bval[i].insert(b[i]); par[i] = i; sz[i] = 1; } vb vis(n); for(int i = mxn; i>=0; i--){ for(auto dex : w[i]){ bool ok = 0; vis[dex] = 1; if(dex != 0 && vis[dex-1]){ ok = 1; unite(dex-1, dex, i); } if(dex != n-1 && vis[dex + 1]){ ok = 1; unite(dex, dex + 1, i); } if(!ok){ ans = max(ans, a[dex] * b[dex]); } } } out(ans); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...