| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1049820 | 2024-08-09T05:31:16 Z | vjudge1 | Art Exhibition (JOI18_art) | C++17 | 0 ms | 348 KB |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define f first
#define s second
#define int unsigned long long
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define pb push_back
#define fast ios::sync_with_stdio(false);cin.tie(0); cout.tie(0)
int mod = 100000000;
typedef __gnu_pbds::tree<int, __gnu_pbds::null_type, less<int>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update> ordered_set;
const int N=1e6+150;
// int mind[N];
int d,n;
vector<int> t;
void init (int nn){
d=nn;
t.assign (d, 0);
}
int sum (int r){
int result = 0;
for (; r >= 0; r = (r & (r+1)) - 1)
result += t[r];
return result;
}
void inc (int i, int delta){
for (; i < d; i = (i | (i+1)))
t[i] += delta;
}
int sum (int l, int r){
return sum (r) - sum (l-1);
}
int ans=0,sze=0,k;
vector<int>sz;
// vector<int>cnt;
vector<int>used;
vector<vector<int>>g;
void precalc(int v,int p){
sz[v]=1;
for(auto k:g[v]){
if(k!=p and !used[k]){
precalc(k,v);
sz[v]+=sz[k];
}
}
sze=max(sz[v],sze);
}
int centroid(int v,int p){
for(auto k:g[v]){
if(k!=p and sz[k]>sze/2 and !used[k]){
return centroid(k,v);
}
}
return v;
}
void dfs(int v,int p,int len){
if(len>=d){
return;
}
// cout<<v<<' '<<sum(k-len-1)<<" "<<sum(d-len)<<" "<<len<<' '<<sum(k-len,d-len)<<'\n';
ans+=sum(k-len,d-len-1);
for(auto to:g[v]){
if(to!=p and !used[to]){
dfs(to,v,len+1);
}
}
}
void update(int v,int p,int len){
if(len>=d){
return;
}
//cout<<k<<" "<<v<<" "<<len<<"\n";
inc(len,1);
//cout<<k<<" "<<v<<" "<<len<<" "<<cnt[len]<<"\n";
for(auto to:g[v]){
if(to!=p and !used[to]){
update(to,v,len+1);
}
}
}
int h;
void cent(int v){
sze=0;
precalc(v,h);
if(sze<=k)
return;
v=centroid(v,h);
//cout<<v<<" ";
inc(0,1);
used[v]=1;
// cout<<t[0]<<'\n';
for(auto to:g[v]){
if(to!=h and !used[to]){
dfs(to,v,1);
update(to,v,1);
}
}
for(int i=0;i<d;i++){
t[i]=0;
}
// cout<<sum(1,d)<<"\n";
for(auto to:g[v]){
if(to!=h and !used[to]){
h=v;
cent(to);
}
}
}
void solve(){
int m,x,q,b=2,c=20,e=0,f=0,a=0,z;
cin>>n;
vector<pair<int,int>>v(n);
for(int i=0;i<n;i++){
cin>>v[i].f>>v[i].s;
}
sort(all(v));
int l=0;
set<int>s;
c=0;
a=0;
for(int i=0;i<n;i++){
// cout<<v[i].s<<" ";
c+=v[i].s;
s.insert(v[i].f);
auto it=s.end();
--it;
// cout<<c<<" "<<(*it-*s.begin())<<'\n';
while(c-(*it-*s.begin())<0 and !s.empty()){
s.erase(s.find(v[l].f));
c-=v[l].s;
auto it=s.end();
--it;
l++;
}
a=max(c-(*it-*s.begin()),a);
}
cout<<a<<" ";
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
// precalc();
// cin >> t;
while(t--) {
solve();
}
}
Compilation message
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
| 2 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
| 2 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
| 2 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
| 2 | Halted | 0 ms | 0 KB | - |