oj.uz

Submission #1020698

# Submission time Handle Problem Language Result Execution time Memory
1020698 2024-07-12T08:44:04 Z Blistering_Barnacles Distributing Candies (IOI21_candies) C++17
3 / 100
 5000 ms 13396 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);
    for(int i = 0; i < q; i++){
        for(int j = l[i]; j <= r[i]; j++){
            a[j] += v[i];
            a[j] = max(a[j], 0);
            a[j] = min(a[j], c[j]);
        }
    }
    return a;
}

Subtask #1
3.0 / 3.0

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

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5083 ms 12112 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 132 ms 8016 KB Output is correct
3 Correct 134 ms 6040 KB Output is correct
4 Execution timed out 5058 ms 13396 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 312 ms 7788 KB Output is correct
4 Correct 323 ms 4028 KB Output is correct
5 Execution timed out 5065 ms 10932 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Execution timed out 5083 ms 12112 KB Time limit exceeded
7 Halted 0 ms 0 KB -