oj.uz

Submission #836777

# Submission time Handle Problem Language Result Execution time Memory
836777 2023-08-24T15:37:13 Z oscar1f Distributing Candies (IOI21_candies) C++17
3 / 100
 5000 ms 14256 KB 
#include<bits/stdc++.h>
#include "candies.h"

using namespace std;
using ll=long long;

const int TAILLE_MAX=200*1000+5;
int nbVal,nbReq;
vector<int> capa,debReq,finReq,typeReq;
vector<int> rep;

vector<int> distribute_candies(vector<int> c,vector<int> l,vector<int> r,vector<int> v) {
    capa=c;
    debReq=l;
    finReq=r;
    typeReq=v;
    nbVal=capa.size();
    nbReq=typeReq.size();
    rep.resize(nbVal);
    /*ll val=0,deb=0;
    for (int i=0;i<nbReq;i++) {
        if (typeReq[i]>0) {
            val+=(ll)typeReq[i];
            deb=max(deb,val);
        }
        else {
            val+=(ll)typeReq[i];
            if (val<=0) {
                val=0;
                deb=0;
            }
        }
    }
    for (int j=0;j<nbVal;j++) {
        if (capa[j]>=deb) {
            rep[j]=val;
        }
        else {
            rep[j]=max(val-(deb-capa[j]),(ll)0);
        }
        //cout<<rep[j]<<" ";
    }
    //cout<<endl;*/
    for (int ireq=0;ireq<nbReq;ireq++) {
        for (int i=debReq[ireq];i<=finReq[ireq];i++) {
            if (typeReq[ireq]>0) {
                rep[i]=min(capa[i],rep[i]+typeReq[ireq]);
            }
            else {
                rep[i]=max(0,rep[i]+typeReq[ireq]);
            }
        }
        /*for (int i:rep) {
            cout<<i<<" ";
        }
        cout<<endl;*/
    }
    return rep;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 372 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 146 ms 10396 KB Output is correct
3 Correct 144 ms 7596 KB Output is correct
4 Execution timed out 5057 ms 14256 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 356 ms 9932 KB Output is correct
4 Correct 358 ms 5584 KB Output is correct
5 Execution timed out 5085 ms 13904 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 372 KB Output is correct
6 Execution timed out 5061 ms 10468 KB Time limit exceeded
7 Halted 0 ms 0 KB -