oj.uz

Submission #1028633

# Submission time Handle Problem Language Result Execution time Memory
1028633 2024-07-20T06:31:56 Z JahonaliX Distributing Candies (IOI21_candies) C++17
0 / 100
 64 ms 12256 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();
    vector<int> a(n);
    if (n <= 2000 && q <= 2000) {
        for (int i = 0; i < q; ++i) for (int j = l[i]; j <= r[i]; ++j) a[i] = max(0, min(c[j], a[j] + v[i]));
    }
    else {
        bool ok = true;
        for (int i : v) ok &= i > 0;
        if (ok) {

        }
        else {

        }
    }
    return a;
}

Subtask #1
0 / 3.0

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

Subtask #2
0 / 8.0

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

Subtask #4
0 / 29.0

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

Subtask #5
0 / 33.0

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