oj.uz

Submission #58237

# Submission time Handle Problem Language Result Execution time Memory
58237 2018-07-17T08:44:04 Z alenam0161 Candies (JOI18_candies) C++17
0 / 100
 4 ms 508 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5+7;
int a[N];
int l[N],r[N],p[N];
long long val[N];
int fnd(int v){
    return v==p[v] ? v:p[v]=fnd(p[v]);
}
int main(){
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;++i)scanf("%d",a+i);
    for(int i=1;i<=n;++i){
        r[i]=l[i]=p[i]=i;
        val[i]=a[i];
    }
    multiset<pair<long long,int> > st;
    for(int i=1;i<=n;++i){
        st.insert({a[i],i});
    }
    int hw=(n+1)/2;
    long long ans=0;
    while(st.size()>0){
        auto it=st.end();it--;
        long long vl=it->first;
        int ps=it->second;
        ps=fnd(ps);
        ans+=vl;
        hw--;
        if(hw<0){
         cout<<endl;
            return 0;
        }
        cout<<ans<<" ";
        if(l[ps]==1&&r[ps]==n){
            cout<<endl;
            return 0;
        }
        st.erase(st.find({vl,ps}));
        val[ps]*=-1;
        if(l[ps]>1){
            int pl=l[ps]-1;
            pl=fnd(pl);
            val[ps]+=val[pl];
            l[ps]=l[pl];
            p[pl]=ps;
            st.erase(st.find({val[pl],pl}));
        }
        if(r[ps]<n){
            int pr=r[ps]+1;
            pr=fnd(pr);
            val[ps]+=val[pr];
            r[ps]=r[pr];
            p[pr]=ps;
            st.erase(st.find({val[pr],pr}));
        }
        st.insert({val[ps],ps});
    }
    return 0;
}

Compilation message

candies.cpp: In function 'int main()':
candies.cpp:12:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
     ~~~~~^~~~~~~~~
candies.cpp:13:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i=1;i<=n;++i)scanf("%d",a+i);
                          ~~~~~^~~~~~~~~~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 508 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 92.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 508 KB Output isn't correct
2 Halted 0 ms 0 KB -