oj.uz

Submission #831572

# Submission time Handle Problem Language Result Execution time Memory
831572 2023-08-20T10:32:04 Z haxorman Distributing Candies (IOI21_candies) C++17
0 / 100
 90 ms 10080 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 = v.size();
    
    int cur = 0, mx = 0, mn = INT_MAX;
    for (int i = 0; i < q; ++i) {
        cur += v[i];
        if (mx < cur) {
            mx = cur;
            mn = mx;
        }
        mn = min(mn, cur);

        if (cur <= 0) {
            cur = 0, mx = 0, mn = INT_MAX;
        }
        //cout << cur << ' ' << mx << ' ' << mn << "\n";
    }
    
    vector<int> ans;
    for (int i = 0; i < n; ++i) {
        ans.push_back(cur - max(0, min(mx - c[i], mn)));
    }
    return ans;
}

Subtask #1
0 / 3.0

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

Subtask #2
0 / 8.0

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