oj.uz

Submission #834695

# Submission time Handle Problem Language Result Execution time Memory
834695 2023-08-22T17:15:18 Z Mohmad_Zaid Distributing Candies (IOI21_candies) C++17
0 / 100
 5000 ms 8052 KB 
#include "candies.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;

vector<int> distribute_candies(vector<int> c, vector<int> l,vector<int> r, vector<int> v) {
    int n = c.size();
    int q=l.size();
    vector<ll> s(n,0);
    for(int i=0;i<q;i++){
        for(int j=l[i];j<=r[i];j++){
            if(v[i]>0){
                s[j]+=v[i];
                s[j]=min((ll)c[j],s[j]);
            }else{
                s[j]-=v[i];
                s[j]=max((ll)0,s[j]);
            }
        }
    }
    vector<int>ans(n);
    for(int i=0;i<n;i++){
        ans[i]=(int)s[i];
    }
    return ans;
}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

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

Subtask #3
0 / 27.0

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

Subtask #4
0 / 29.0

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

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -