oj.uz

Submission #619609

# Submission time Handle Problem Language Result Execution time Memory
619609 2022-08-02T13:36:00 Z Koosha_mv Distributing Candies (IOI21_candies) C++17
3 / 100
 5000 ms 32496 KB 
#include "candies.h"
#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,int(v.size())) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<x.F<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first

const int N=2e5+99;

int n,q,c[N],a[N];
ll b[N];
vector<int> s,t,val,ad[N],dl[N];

vector<int> distribute_candies(vector<int> _c,vector<int> _s,vector<int> _t,vector<int> _val){
    s=_s,t=_t,val=_val;
    n=_c.size(),q=s.size();
    vector<int> ans(n);
    f(i,0,n) c[i]=_c[i];
    f(i,0,q){
        ad[s[i]].pb(i);
        dl[t[i]].pb(i);
    }
    f(i,0,n){
        for(auto x : ad[i]) a[x+1]+=val[x];
        int mnid=q,mxid=q,b0=q,b1=q;
        ll sum=0;
        f(j,1,q+1){
            b[j]=b[j-1]+a[j];
            sum+=a[j];
            maxm(sum,0ll);
            minm(sum,1ll*c[i]);
        }
        f_(j,q,0){
            if(b[j]<b[mnid]){
                mnid=j;
                if(b[mxid]-b[j]<c[i]){
                    b0=j;
                }
            }
            if(b[j]>b[mxid]){
                mxid=j;
                if(b[j]-b[mnid]<c[i]){
                    b1=j;
                }
            }
        }
        //dbga(b,0,q+1);
        //cout<<b0<<" "<<b1<<endl;
        ans[i]=sum;
        for(auto x : dl[i]) a[x+1]-=val[x];
        if(b0<b1){
         //   ans[i]=b[q]-b[b0];
        }
        else{
           // ans[i]=c[i]-(b[b1]-b[q]);
        }
        int mn=b[q],mx=b[q];
        f_(j,q,0){
            if(b[j]<mn){
                mn=b[j];
                if(j<min(b0,b1)){
                    ans[i]=c[i]-(b[b1]-b[q]);
                }
                break ;
            }
            if(b[j]>mx){
                mx=b[j];
                if(j<min(b0,b1)){
                    ans[i]=b[q]-b[b0];
                }
                break ;
            }
        }
    }
    return ans;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9812 KB Output is correct
4 Correct 9 ms 9812 KB Output is correct
5 Correct 24 ms 9812 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5088 ms 29432 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 1805 ms 22008 KB Output is correct
3 Correct 1989 ms 16388 KB Output is correct
4 Execution timed out 5007 ms 32496 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 7 ms 9812 KB Output is correct
3 Correct 1896 ms 20860 KB Output is correct
4 Correct 1900 ms 13076 KB Output is correct
5 Execution timed out 5021 ms 23964 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9812 KB Output is correct
4 Correct 9 ms 9812 KB Output is correct
5 Correct 24 ms 9812 KB Output is correct
6 Execution timed out 5088 ms 29432 KB Time limit exceeded
7 Halted 0 ms 0 KB -