Submission #834669

# Submission time Handle Problem Language Result Execution time Memory
834669 2023-08-22T16:54:55 Z Mohmad_Zaid Distributing Candies (IOI21_candies) C++17
0 / 100
5000 ms 7272 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<int> s(n,0);
    for(int i=0;i<q;i++){
        for(int j=l[i];j<=r[i];j++){
            if(v[i]>0){
                s[i]=min(c[i],s[i]+v[i]);
            }else{
                s[i]=max(0,s[i]-v[i]);
            }
        }
    }
    return s;
}
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 5059 ms 7272 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -