oj.uz

Submission #1064205

# Submission time Handle Problem Language Result Execution time Memory
1064205 2024-08-18T10:22:04 Z glupan Distributing Candies (IOI21_candies) C++17
8 / 100
 74 ms 12884 KB 
#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 = l.size();
    vector<int>s(n);
    vector<long long> pref(n+1,0);
    for(int i=0; i<q; i++) {
        pref[l[i]] += v[i];
        pref[r[i]+1] -= v[i];
    }
    for(int i=1; i<=n; i++)
        pref[i]+=pref[i-1];
    for(int i=0; i<n; i++)
        s[i] = min((long long)c[i],pref[i]);
    return s;
}

Subtask #1
0 / 3.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 8948 KB Output is correct
2 Correct 72 ms 12884 KB Output is correct
3 Correct 63 ms 12884 KB Output is correct

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 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 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

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