oj.uz

Submission #1063455

# Submission time Handle Problem Language Result Execution time Memory
1063455 2024-08-17T18:46:03 Z deera Distributing Candies (IOI21_candies) C++17
3 / 100
 68 ms 12880 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 = v.size();

    if (n <= 2000 && q <= 2000) {
        vector<int> res(n, 0);
        for (int i = 0; i < q; i++) {
            for (int j = l[i]; j <= r[i]; j++) {
                res[j] = max(min(res[j] + v[i], c[j]), 0);
            }
        }
        return res;
    }

    bool non_neg = true;
    for (int val: v) if (val < 0) {
        non_neg = false;
        break;
    }

    if (non_neg) {
        // difference array
        vector<int> diff(n + 1, 0);

        for (int i = 0; i < q; i++) {
            diff[l[i]] += v[i];
            diff[r[i] + 1] -= v[i];
        }

        for (int i = 1; i < n; i++) {
            diff[i] += diff[i - 1];
        }

        vector<int> res(n, 0);
        for (int i = 0; i < n; i++) {
            res[i] = min(c[i], diff[i]);
        }

        return res;
    }

}

Compilation message

candies.cpp: In function 'std::vector<int> distribute_candies(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
candies.cpp:45:1: warning: control reaches end of non-void function [-Wreturn-type]
   45 | }
      | ^

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 27.0

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

Subtask #4
0 / 29.0

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

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Incorrect 68 ms 12880 KB Output isn't correct
7 Halted 0 ms 0 KB -