oj.uz

답안 #947964

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
947964 2024-03-17T10:11:58 Z yeediot 휴가 (IOI14_holiday) C++14
30 / 100
 79 ms 6284 KB 
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
const int mxn=1e5+5;
multiset<long long>bg,sm;
long long n,st,d,L,R;
long long cur,v[mxn];
void sir(int l,int r,int k){
    while(L>l){
        bg.insert(v[--L]);
        cur+=v[L];
        
    }
    while(R<r){
        bg.insert(v[++R]);
        cur+=v[R];
    }
    while(L<l){
        if(bg.find(v[L])!=bg.end()){
            cur-=v[L];
            bg.erase(bg.find(v[L]));
        }
        else{
            sm.erase(sm.find(v[L]));
        }
        L++;
    }
    while(R>r){
        if(bg.find(v[R])!=bg.end()){
            cur-=v[R];
            bg.erase(bg.find(v[R]));
        }
        else{
            sm.erase(sm.find(v[R]));
        }
        R--;
    }
    while(sz(bg) and sz(bg)>k){
        cur-=*bg.begin();
        sm.insert(*bg.begin());
        bg.erase(bg.begin());
    }
    while(sz(sm) and sz(bg)<k){
        cur+=*prev(sm.end());
        bg.insert(*prev(sm.end()));
        sm.erase(prev(sm.end()));
    }
}

long long ans;
void solve(int l,int r,int ql,int qr){
    debug(l,r,ql,qr);
    if(l>r){
        return;
    }
    int mm=l+r>>1;
    long long mx=-1;
    long long best=-1;
    for(int i=ql;i<=qr;i++){
        long long x=d-(min(i-st,st-mm)+i-mm);
        if(x<0)break;
        sir(mm,i,x);
        if((mx==-1 or cur>mx) and sz(bg)<=x){
            best=i;
            mx=cur;
        }
    }
    chmax(ans,mx);
    if(best!=-1)solve(l,mm-1,ql,best);
    if(best!=-1)solve(mm+1,r,best,qr);
}
long long findMaxAttraction(int N,int ST,int D,int a[]){
    n=N,st=ST,d=D;
    for(int i=0;i<n;i++){
        v[i]=a[i];
    }
    bg.insert(v[0]);
    cur+=v[0];
    sir(0,n-1,n);
    solve(0,st,st,n-1);
    return ans;
}
#ifdef local
int main(){
    setio();
    int a,b,c;
    cin>>a>>b>>c;
    int x[n];
    for(int i=0;i<a;i++){
        cin>>x[i];
    }
    cout<<findMaxAttraction(a,b,c,x)<<'\n';
}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

 /*
 input:
 
 */

Compilation message

holiday.cpp: In function 'void solve(int, int, int, int)':
holiday.cpp:92:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   92 |     int mm=l+r>>1;
      |            ~^~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 6232 KB Output is correct
2 Correct 38 ms 6236 KB Output is correct
3 Correct 37 ms 6260 KB Output is correct
4 Correct 37 ms 6080 KB Output is correct
5 Correct 66 ms 5836 KB Output is correct
6 Correct 15 ms 2140 KB Output is correct
7 Correct 29 ms 3516 KB Output is correct
8 Correct 39 ms 4188 KB Output is correct
9 Correct 10 ms 1920 KB Output is correct

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 860 KB Output is correct
2 Correct 2 ms 992 KB Output is correct
3 Correct 2 ms 860 KB Output is correct
4 Correct 8 ms 984 KB Output is correct
5 Correct 6 ms 856 KB Output is correct
6 Correct 2 ms 860 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Incorrect 4 ms 856 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 6284 KB Output is correct
2 Correct 40 ms 6236 KB Output is correct
3 Incorrect 11 ms 3164 KB Output isn't correct
4 Halted 0 ms 0 KB -