oj.uz

Submission #828708

# Submission time Handle Problem Language Result Execution time Memory
828708 2023-08-17T14:02:54 Z fatemetmhr Distributing Candies (IOI21_candies) C++17
38 / 100
 5000 ms 15936 KB 
//#pragma GCC optimize ("O3")
#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops,O3")

#include "candies.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define debug(x)  cerr << "(" << (#x) << "): " << (x) << endl;
#define all(x)    x.begin(), x.end()
#define MAX(x, y) ((x) > (y) ? (x) : (y))
#define MIN(x, y) ((x) < (y) ? (x) : (y))
#define fi        first
#define se        second
#define pb        push_back
#define mp        make_pair

const int ss    = 2000;
const int maxn5 = 2e5 + 10;

int ret[maxn5], c[maxn5];

std::vector<int> distribute_candies(std::vector<int> C, std::vector<int> L,
                                    std::vector<int> R, std::vector<int> V) {
    int n = C.size(), q = L.size();
    for(int i = 0; i < n; i++)
        c[i] = C[i];
    for(int tt = 0; tt < n; tt += ss){
        for(int i = 0; i < q; i++){
            int l = MAX(L[i], tt), r = MIN(R[i] + 1, MIN(tt + ss, n)), v = V[i];
            if(v > 0){
                for(int i = l; i < r; i++){
                    ret[i] = MIN(c[i], ret[i] + v);
                }
            }
            else{
                for(int i = l; i < r; i++){
                    ret[i] = MAX(0, ret[i] + v);
                }
            }
        }
    }

    std::vector<int> s;
    for(int i = 0; i < n; i++)
        s.pb(ret[i]);
    return s;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 372 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2921 ms 14020 KB Output is correct
2 Correct 2950 ms 13316 KB Output is correct
3 Correct 2911 ms 13136 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 74 ms 8032 KB Output is correct
3 Correct 65 ms 7708 KB Output is correct
4 Correct 2759 ms 15136 KB Output is correct
5 Correct 2744 ms 15576 KB Output is correct
6 Correct 2751 ms 15936 KB Output is correct
7 Correct 2605 ms 15344 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 118 ms 7628 KB Output is correct
4 Correct 112 ms 5800 KB Output is correct
5 Execution timed out 5039 ms 11412 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 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 372 KB Output is correct
6 Correct 2921 ms 14020 KB Output is correct
7 Correct 2950 ms 13316 KB Output is correct
8 Correct 2911 ms 13136 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 74 ms 8032 KB Output is correct
11 Correct 65 ms 7708 KB Output is correct
12 Correct 2759 ms 15136 KB Output is correct
13 Correct 2744 ms 15576 KB Output is correct
14 Correct 2751 ms 15936 KB Output is correct
15 Correct 2605 ms 15344 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 308 KB Output is correct
18 Correct 118 ms 7628 KB Output is correct
19 Correct 112 ms 5800 KB Output is correct
20 Execution timed out 5039 ms 11412 KB Time limit exceeded
21 Halted 0 ms 0 KB -