Submission #1020705

# Submission time Handle Problem Language Result Execution time Memory
1020705 2024-07-12T08:46:45 Z Blistering_Barnacles Distributing Candies (IOI21_candies) C++17
8 / 100
77 ms 12892 KB
#include "candies.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
    int n = c.size(), q = (int)l.size();
    vector<int> a(n);
    vector<int64_t> pref(n + 1);
    for(int i = 0; i < q; i++){
        pref[l[i]] += v[i];
        pref[r[i] + 1] -= v[i];
    }
    for(int i = 0; i < n; i++){
        pref[i + 1] += pref[i];
        a[i] = min(pref[i], (int64_t)c[i]);
    }
    return a;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 68 ms 9044 KB Output is correct
2 Correct 69 ms 12892 KB Output is correct
3 Correct 77 ms 12884 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -