CSES - Aalto Competitive Programming 2024 - wk4 - Mon

CSES - Aalto Competitive Programming 2024 - wk4 - Mon - Results

Submission details
Task:	Targeted advertising
Sender:	arnxxau
Submission time:	2024-09-23 17:11:36 +0300
Language:	C++ (C++11)
Status:	READY
Result:	RUNTIME ERROR

Test results
test	verdict	time
#1	ACCEPTED	0.00 s	details
#2	ACCEPTED	0.00 s	details
#3	ACCEPTED	0.00 s	details
#4	ACCEPTED	0.00 s	details
#5	ACCEPTED	0.00 s	details
#6	ACCEPTED	0.00 s	details
#7	ACCEPTED	0.00 s	details
#8	ACCEPTED	0.00 s	details
#9	ACCEPTED	0.00 s	details
#10	ACCEPTED	0.00 s	details
#11	ACCEPTED	0.00 s	details
#12	ACCEPTED	0.00 s	details
#13	ACCEPTED	0.00 s	details
#14	ACCEPTED	0.00 s	details
#15	ACCEPTED	0.00 s	details
#16	ACCEPTED	0.00 s	details
#17	ACCEPTED	0.00 s	details
#18	ACCEPTED	0.00 s	details
#19	ACCEPTED	0.00 s	details
#20	ACCEPTED	0.00 s	details
#21	ACCEPTED	0.00 s	details
#22	ACCEPTED	0.00 s	details
#23	ACCEPTED	0.00 s	details
#24	ACCEPTED	0.00 s	details
#25	ACCEPTED	0.00 s	details
#26	ACCEPTED	0.00 s	details
#27	ACCEPTED	0.00 s	details
#28	ACCEPTED	0.00 s	details
#29	ACCEPTED	0.00 s	details
#30	ACCEPTED	0.00 s	details
#31	ACCEPTED	0.00 s	details
#32	ACCEPTED	0.00 s	details
#33	ACCEPTED	0.00 s	details
#34	ACCEPTED	0.00 s	details
#35	ACCEPTED	0.00 s	details
#36	ACCEPTED	0.00 s	details
#37	ACCEPTED	0.00 s	details
#38	ACCEPTED	0.00 s	details
#39	ACCEPTED	0.00 s	details
#40	ACCEPTED	0.01 s	details
#41	ACCEPTED	0.01 s	details
#42	ACCEPTED	0.01 s	details
#43	ACCEPTED	0.01 s	details
#44	ACCEPTED	0.01 s	details
#45	ACCEPTED	0.00 s	details
#46	ACCEPTED	0.01 s	details
#47	ACCEPTED	0.00 s	details
#48	ACCEPTED	0.01 s	details
#49	ACCEPTED	0.00 s	details
#50	ACCEPTED	0.02 s	details
#51	ACCEPTED	0.03 s	details
#52	ACCEPTED	0.01 s	details
#53	ACCEPTED	0.01 s	details
#54	ACCEPTED	0.03 s	details
#55	ACCEPTED	0.01 s	details
#56	ACCEPTED	0.03 s	details
#57	ACCEPTED	0.01 s	details
#58	ACCEPTED	0.01 s	details
#59	ACCEPTED	0.02 s	details
#60	RUNTIME ERROR	0.39 s	details
#61	RUNTIME ERROR	0.39 s	details
#62	RUNTIME ERROR	0.40 s	details
#63	RUNTIME ERROR	0.40 s	details
#64	RUNTIME ERROR	0.39 s	details
#65	RUNTIME ERROR	0.39 s	details
#66	RUNTIME ERROR	0.39 s	details
#67	RUNTIME ERROR	0.39 s	details
#68	RUNTIME ERROR	0.43 s	details
#69	RUNTIME ERROR	0.39 s	details
#70	RUNTIME ERROR	0.40 s	details

Code

#include <climits>
#include <iostream>
#include <vector>

// Clase para manejar sumas de segmentos
class SumSegmentTree {
   private:
    std::vector<int> tree;
    std::vector<int> data;
    int n;

    void build(int node, int start, int end) {
        if (start == end) {
            tree[node] = data[start];
        } else {
            int mid = (start + end) / 2;
            build(2 * node + 1, start, mid);
            build(2 * node + 2, mid + 1, end);
            tree[node] = tree[2 * node + 1] + tree[2 * node + 2];
        }
    }

    int query(int node, int start, int end, int l, int r) {
        if (r < start || l > end) {
            return 0;
        }
        if (l <= start && end <= r) {
            return tree[node];
        }
        int mid = (start + end) / 2;
        return query(2 * node + 1, start, mid, l, r) + query(2 * node + 2, mid + 1, end, l, r);
    }

    void update(int node, int start, int end, int idx, int value) {
        if (start == end) {
            data[idx] = value;
            tree[node] = value;
        } else {
            int mid = (start + end) / 2;
            if (start <= idx && idx <= mid) {
                update(2 * node + 1, start, mid, idx, value);
            } else {
                update(2 * node + 2, mid + 1, end, idx, value);
            }
            tree[node] = tree[2 * node + 1] + tree[2 * node + 2];
        }
    }

   public:
    SumSegmentTree(const std::vector<int>& initial_data) : data(initial_data) {
        n = initial_data.size();
        tree.resize(4 * n);
        build(0, 0, n - 1);
    }

    int sum(int l, int r) {
        return query(0, 0, n - 1, l, r);
    }

    void update(int idx, int value) {
        update(0, 0, n - 1, idx, value);
    }
};

// Clase para manejar mínimos de segmentos
class MinSegmentTree {
   private:
    std::vector<int> tree;
    std::vector<int> data;
    int n;

    void build(int node, int start, int end) {
        if (start == end) {
            tree[node] = data[start];
        } else {
            int mid = (start + end) / 2;
            build(2 * node + 1, start, mid);
            build(2 * node + 2, mid + 1, end);
            tree[node] = std::min(tree[2 * node + 1], tree[2 * node + 2]);
        }
    }

    int query(int node, int start, int end, int l, int r) {
        if (r < start || l > end) {
            return INT_MAX;
        }
        if (l <= start && end <= r) {
            return tree[node];
        }
        int mid = (start + end) / 2;
        return std::min(query(2 * node + 1, start, mid, l, r), query(2 * node + 2, mid + 1, end, l, r));
    }

    void update(int node, int start, int end, int idx, int value) {
        if (start == end) {
            data[idx] = value;
            tree[node] = value;
        } else {
            int mid = (start + end) / 2;
            if (start <= idx && idx <= mid) {
                update(2 * node + 1, start, mid, idx, value);
            } else {
                update(2 * node + 2, mid + 1, end, idx, value);
            }
            tree[node] = std::min(tree[2 * node + 1], tree[2 * node + 2]);
        }
    }

   public:
    MinSegmentTree(const std::vector<int>& initial_data) : data(initial_data) {
        n = initial_data.size();
        tree.resize(4 * n);
        build(0, 0, n - 1);
    }

    int minimum(int l, int r) {
        return query(0, 0, n - 1, l, r);
    }

    void update(int idx, int value) {
        update(0, 0, n - 1, idx, value);
    }
};

// Clase para manejar máximos de segmentos
class MaxSegmentTree {
   private:
    std::vector<int> tree;
    std::vector<int> data;
    int n;

    void build(int node, int start, int end) {
        if (start == end) {
            tree[node] = data[start];
        } else {
            int mid = (start + end) / 2;
            build(2 * node + 1, start, mid);
            build(2 * node + 2, mid + 1, end);
            tree[node] = std::max(tree[2 * node + 1], tree[2 * node + 2]);
        }
    }

    int query(int node, int start, int end, int l, int r) {
        if (r < start || l > end) {
            return INT_MIN;
        }
        if (l <= start && end <= r) {
            return tree[node];
        }
        int mid = (start + end) / 2;
        return std::max(query(2 * node + 1, start, mid, l, r), query(2 * node + 2, mid + 1, end, l, r));
    }

    void update(int node, int start, int end, int idx, int value) {
        if (start == end) {
            data[idx] = value;
            tree[node] = value;
        } else {
            int mid = (start + end) / 2;
            if (start <= idx && idx <= mid) {
                update(2 * node + 1, start, mid, idx, value);
            } else {
                update(2 * node + 2, mid + 1, end, idx, value);
            }
            tree[node] = std::max(tree[2 * node + 1], tree[2 * node + 2]);
        }
    }

   public:
    MaxSegmentTree(const std::vector<int>& initial_data) : data(initial_data) {
        n = initial_data.size();
        tree.resize(4 * n);
        build(0, 0, n - 1);
    }

    int maximum(int l, int r) {
        return query(0, 0, n - 1, l, r);
    }

    void update(int idx, int value) {
        update(0, 0, n - 1, idx, value);
    }
};

using namespace std;
int main() {
    int n, k, q;
    cin >> n >> k >> q;

    vector<vector<int> > arrs(k, vector<int>(n, 0));

    vector<int> arr(n, 0);
    for (int i = 0; i < n; i++) {
        int _k;
        cin >> _k;
        arrs[_k - 1][i] = 1;
    }

    vector<SumSegmentTree> trees(k, SumSegmentTree(arr));
    for (int i = 0; i < k; i++) {
        SumSegmentTree t(arrs[i]);
        trees[i] = t;
    }

    for (int i = 0; i < q; i++) {


        int a, b;
        cin >> a >> b;

                int type;
        cin >> type;

        cout << trees[type - 1].sum(a - 1, b - 1) << endl;
    }

   // cout << endl;

/*
    for (int i = 0; i < k; i++) {
        for (int j = 0; j < n; j++) {
            cout << arrs[i][j] << ' ';
        }
        cout << endl;
    }*/
}

Test details

Test 1

Verdict: ACCEPTED

input
`1 1 1 1 1 1 1` view save

correct output
`1` view save

user output
`1` view save

Test 2

Verdict: ACCEPTED

input
`1 1 2 1 1 1 1 1 1 1` view save

correct output
`1 1` view save

user output
`1 1` view save

Test 3

Verdict: ACCEPTED

input
`2 1 2 1 1 2 2 1 1 2 1` view save

correct output
`1 2` view save

user output
`1 2` view save

Test 4

Verdict: ACCEPTED

input
`2 2 5 2 1 1 1 2 1 1 2 1 2 2 ...` view save

correct output
`1 1 1 1 1` view save

user output
`1 1 1 1 1` view save

Test 5

Verdict: ACCEPTED

input
`3 2 4 1 1 1 1 3 1 2 3 2 2 2 2 ...` view save

correct output
`3 0 0 0` view save

user output
`3 0 0 0` view save

Test 6

Verdict: ACCEPTED

input
`3 3 8 2 3 1 2 3 2 1 2 2 2 3 1 ...` view save

correct output
`0 1 1 1 1 ...` view save

user output
`0 1 1 1 1 ...` view save

Test 7

Verdict: ACCEPTED

input
`4 2 9 2 2 1 2 2 2 2 2 4 1 2 3 1 ...` view save

correct output
`1 1 1 1 2 ...` view save

user output
`1 1 1 1 2 ...` view save

Test 8

Verdict: ACCEPTED

input
`4 3 11 3 3 2 2 3 3 2 2 4 1 3 3 3 ...` view save

correct output
`1 0 0 1 1 ...` view save

user output
`1 0 0 1 1 ...` view save

Test 9

Verdict: ACCEPTED

input
`4 4 8 4 1 4 2 3 4 2 2 2 1 1 4 2 ...` view save

correct output
`1 1 1 1 1 ...` view save

user output
`1 1 1 1 1 ...` view save

Test 10

Verdict: ACCEPTED

input
`5 3 11 3 3 2 3 2 3 5 2 2 4 2 2 5 1 ...` view save

correct output
`2 1 0 2 1 ...` view save

user output
`2 1 0 2 1 ...` view save

Test 11

Verdict: ACCEPTED

input
`5 5 9 4 5 1 1 2 1 5 2 1 2 1 2 2 4 ...` view save

correct output
`1 0 0 0 1 ...` view save

user output
`1 0 0 0 1 ...` view save

Test 12

Verdict: ACCEPTED

input
`5 1 9 1 1 1 1 1 3 3 1 1 2 1 4 4 1 ...` view save

correct output
`1 2 1 2 1 ...` view save

user output
`1 2 1 2 1 ...` view save

Test 13

Verdict: ACCEPTED

input
`5 1 11 1 1 1 1 1 3 5 1 1 5 1 1 2 1 ...` view save

correct output
`3 5 2 1 4 ...` view save

user output
`3 5 2 1 4 ...` view save

Test 14

Verdict: ACCEPTED

input
`5 5 15 3 1 5 5 4 4 4 3 1 2 5 1 2 4 ...` view save

correct output
`0 0 0 0 0 ...` view save

user output
`0 0 0 0 0 ...` view save

Test 15

Verdict: ACCEPTED

input
`5 1 7 1 1 1 1 1 3 5 1 2 4 1 2 3 1 ...` view save

correct output
`3 3 2 4 5 ...` view save

user output
`3 3 2 4 5 ...` view save

Test 16

Verdict: ACCEPTED

input
`5 5 14 2 2 5 1 1 1 2 5 1 3 3 3 4 3 ...` view save

correct output
`0 0 0 0 0 ...` view save

user output
`0 0 0 0 0 ...` view save

Test 17

Verdict: ACCEPTED

input
`5 2 5 2 1 1 2 2 3 5 1 2 3 2 1 1 1 ...` view save

correct output
`1 0 0 1 1` view save

user output
`1 0 0 1 1` view save

Test 18

Verdict: ACCEPTED

input
`5 1 14 1 1 1 1 1 2 5 1 1 4 1 3 4 1 ...` view save

correct output
`4 4 2 3 3 ...` view save

user output
`4 4 2 3 3 ...` view save

Test 19

Verdict: ACCEPTED

input
`5 2 5 2 1 1 1 1 1 2 1 2 5 1 1 2 1 ...` view save

correct output
`1 4 1 1 2` view save

user output
`1 4 1 1 2` view save

Test 20

Verdict: ACCEPTED

input
`10 6 21 5 6 4 6 4 6 3 4 4 3 3 5 6 1 10 2 4 5 5 ...` view save

correct output
`1 0 0 1 2 ...` view save

user output
`1 0 0 1 2 ...` view save

Test 21

Verdict: ACCEPTED

input
`10 10 18 8 10 1 2 4 10 2 3 1 4 2 4 4 4 7 10 6 9 5 ...` view save

correct output
`0 1 0 0 0 ...` view save

user output
`0 1 0 0 0 ...` view save

Test 22

Verdict: ACCEPTED

input
`10 2 19 1 2 2 2 1 1 1 1 1 1 3 7 2 2 3 1 3 7 2 ...` view save

correct output
`2 0 2 0 3 ...` view save

user output
`2 0 2 0 3 ...` view save

Test 23

Verdict: ACCEPTED

input
`10 1 21 1 1 1 1 1 1 1 1 1 1 1 2 1 1 3 1 5 7 1 ...` view save

correct output
`2 3 3 4 5 ...` view save

user output
`2 3 3 4 5 ...` view save

Test 24

Verdict: ACCEPTED

input
`10 10 30 6 2 10 9 8 7 7 6 3 2 3 10 1 3 7 10 5 7 8 ...` view save

correct output
`0 1 1 1 0 ...` view save

user output
`0 1 1 1 0 ...` view save

Test 25

Verdict: ACCEPTED

input
`10 1 14 1 1 1 1 1 1 1 1 1 1 4 8 1 3 5 1 2 9 1 ...` view save

correct output
`5 3 8 2 3 ...` view save

user output
`5 3 8 2 3 ...` view save

Test 26

Verdict: ACCEPTED

input
`10 10 28 4 3 9 1 1 4 2 10 6 1 6 7 5 4 6 5 7 9 5 ...` view save

correct output
`0 0 0 0 0 ...` view save

user output
`0 0 0 0 0 ...` view save

Test 27

Verdict: ACCEPTED

input
`10 3 11 3 1 2 3 3 2 3 1 2 1 1 6 1 3 5 1 5 6 3 ...` view save

correct output
`1 0 1 0 0 ...` view save

user output
`1 0 1 0 0 ...` view save

Test 28

Verdict: ACCEPTED

input
`10 1 28 1 1 1 1 1 1 1 1 1 1 5 8 1 5 6 1 5 10 1 ...` view save

correct output
`4 2 6 5 4 ...` view save

user output
`4 2 6 5 4 ...` view save

Test 29

Verdict: ACCEPTED

input
`10 4 10 3 2 2 1 1 2 1 1 1 4 2 5 1 1 2 2 4 5 1 ...` view save

correct output
`2 1 2 1 2 ...` view save

user output
`2 1 2 1 2 ...` view save

Test 30

Verdict: ACCEPTED

input
`100 60 210 43 51 37 52 33 51 26 38 39 24 ...` view save

correct output
`0 1 0 1 0 ...` view save

user output
`0 1 0 1 0 ...` Truncated

Test 31

Verdict: ACCEPTED

input
`100 100 183 73 94 1 13 31 100 15 24 10 40 ...` view save

correct output
`0 1 1 0 0 ...` view save

user output
`0 1 1 0 0 ...` Truncated

Test 32

Verdict: ACCEPTED

input
`100 19 187 1 18 11 19 9 10 8 7 7 3 4 14 1...` view save

correct output
`5 0 0 3 4 ...` view save

user output
`5 0 0 3 4 ...` Truncated

Test 33

Verdict: ACCEPTED

input
`100 8 210 6 7 3 1 5 5 8 4 8 1 2 1 2 2 1 ...` view save

correct output
`0 9 0 3 4 ...` view save

user output
`0 9 0 3 4 ...` Truncated

Test 34

Verdict: ACCEPTED

input
`100 91 294 50 16 89 78 66 56 64 55 20 13 ...` view save

correct output
`1 0 0 0 0 ...` view save

user output
`1 0 0 0 0 ...` Truncated

Test 35

Verdict: ACCEPTED

input
`100 6 144 6 5 2 3 6 6 3 1 4 3 5 3 4 3 2 ...` view save

correct output
`7 15 10 15 5 ...` view save

user output
`7 15 10 15 5 ...` Truncated

Test 36

Verdict: ACCEPTED

input
`100 95 279 32 20 79 7 4 36 11 94 57 10 51...` view save

correct output
`0 2 1 1 0 ...` view save

user output
`0 2 1 1 0 ...` Truncated

Test 37

Verdict: ACCEPTED

input
`100 23 115 18 8 11 23 17 11 23 8 13 7 12 ...` view save

correct output
`1 0 0 4 0 ...` view save

user output
`1 0 0 4 0 ...` Truncated

Test 38

Verdict: ACCEPTED

input
`100 2 275 2 1 2 1 2 2 1 1 1 2 1 2 1 1 2 ...` view save

correct output
`26 30 13 11 16 ...` view save

user output
`26 30 13 11 16 ...` Truncated

Test 39

Verdict: ACCEPTED

input
`100 37 102 19 19 19 1 5 12 6 1 9 33 16 6 ...` view save

correct output
`1 1 3 2 1 ...` view save

user output
`1 1 3 2 1 ...` Truncated

Test 40

Verdict: ACCEPTED

input
`200 119 420 86 101 72 103 65 101 51 75 77 ...` view save

correct output
`1 0 0 0 0 ...` view save

user output
`1 0 0 0 0 ...` Truncated

Test 41

Verdict: ACCEPTED

input
`200 200 367 145 187 1 26 61 200 30 48 19 8...` view save

correct output
`0 0 2 0 0 ...` view save

user output
`0 0 2 0 0 ...` Truncated

Test 42

Verdict: ACCEPTED

input
`200 38 374 1 36 21 37 17 19 16 13 13 6 8 ...` view save

correct output
`1 1 3 3 0 ...` view save

user output
`1 1 3 3 0 ...` Truncated

Test 43

Verdict: ACCEPTED

input
`200 15 420 11 13 5 2 8 9 14 7 14 1 2 1 4 ...` view save

correct output
`6 0 11 2 3 ...` view save

user output
`6 0 11 2 3 ...` Truncated

Test 44

Verdict: ACCEPTED

input
`200 181 587 100 32 177 155 130 111 127 109...` view save

correct output
`0 1 2 1 0 ...` view save

user output
`0 1 2 1 0 ...` Truncated

Test 45

Verdict: ACCEPTED

input
`200 12 289 11 10 3 5 12 12 6 2 8 5 10 5 7...` view save

correct output
`2 13 0 3 6 ...` view save

user output
`2 13 0 3 6 ...` Truncated

Test 46

Verdict: ACCEPTED

input
`200 190 558 64 40 157 13 8 71 21 188 114 1...` view save

correct output
`0 0 0 0 0 ...` view save

user output
`0 0 0 0 0 ...` Truncated

Test 47

Verdict: ACCEPTED

input
`200 46 230 36 15 21 45 34 21 45 15 25 13 ...` view save

correct output
`0 0 0 4 1 ...` view save

user output
`0 0 0 4 1 ...` Truncated

Test 48

Verdict: ACCEPTED

input
`200 3 550 3 1 3 2 2 3 1 2 1 2 2 3 2 2 2 ...` view save

correct output
`38 59 26 36 10 ...` view save

user output
`38 59 26 36 10 ...` Truncated

Test 49

Verdict: ACCEPTED

input
`200 73 204 37 37 37 1 10 24 11 1 16 65 31...` view save

correct output
`2 3 0 4 0 ...` view save

user output
`2 3 0 4 0 ...` Truncated

Test 50

Verdict: ACCEPTED

input
`1000 593 2098 425 501 358 509 324 503 252 37...` view save

correct output
`1 0 0 0 4 ...` view save

user output
`1 0 0 0 4 ...` Truncated

Test 51

Verdict: ACCEPTED

input
`1000 998 1834 719 931 1 128 302 998 147 236 ...` view save

correct output
`0 0 0 0 0 ...` view save

user output
`0 0 0 0 0 ...` Truncated

Test 52

Verdict: ACCEPTED

input
`1000 186 1872 5 174 103 177 81 91 79 60 62 2...` view save

correct output
`0 0 1 3 0 ...` view save

user output
`0 0 1 3 0 ...` Truncated

Test 53

Verdict: ACCEPTED

input
`1000 71 2102 51 60 21 9 37 41 64 32 64 2 9 ...` view save

correct output
`1 1 3 15 4 ...` view save

user output
`1 1 3 15 4 ...` Truncated

Test 54

Verdict: ACCEPTED

input
`1000 901 2935 494 156 877 771 645 549 629 53...` view save

correct output
`0 0 1 1 0 ...` view save

user output
`0 0 1 1 0 ...` Truncated

Test 55

Verdict: ACCEPTED

input
`1000 56 1444 49 47 12 21 52 55 28 6 35 23 4...` view save

correct output
`11 11 1 0 2 ...` view save

user output
`11 11 1 0 2 ...` Truncated

Test 56

Verdict: ACCEPTED

input
`1000 948 2786 315 199 779 61 40 351 103 934 ...` view save

correct output
`1 0 1 0 0 ...` view save

user output
`1 0 1 0 0 ...` Truncated

Test 57

Verdict: ACCEPTED

input
`1000 228 1152 178 73 100 224 165 104 223 71 ...` view save

correct output
`1 1 2 3 0 ...` view save

user output
`1 1 2 3 0 ...` Truncated

Test 58

Verdict: ACCEPTED

input
`1000 12 2747 12 3 11 5 7 10 3 6 1 8 6 10 5 ...` view save

correct output
`0 25 15 7 47 ...` view save

user output
`0 25 15 7 47 ...` Truncated

Test 59

Verdict: ACCEPTED

input
`1000 365 1020 184 183 181 3 49 116 52 5 80 3...` view save

correct output
`1 0 0 1 0 ...` view save

user output
`1 0 0 1 0 ...` Truncated

Test 60

Verdict: RUNTIME ERROR

input
`100000 59286 100000 42402 50054 35736 50865 32305 ...` view save

correct output
`1 0 3 1 1 ...` view save

user output
(empty)

Test 61

Verdict: RUNTIME ERROR

input
`100000 99721 100000 71833 92998 12 12777 30150 996...` view save

correct output
`1 0 0 0 0 ...` view save

user output
(empty)

Test 62

Verdict: RUNTIME ERROR

input
`100000 18509 100000 480 17242 10174 17542 8058 897...` view save

correct output
`0 2 1 1 1 ...` view save

user output
(empty)

Test 63

Verdict: RUNTIME ERROR

input
`100000 7073 100000 5009 5941 2058 859 3614 4027 6...` view save

correct output
`6 9 3 2 0 ...` view save

user output
(empty)

Test 64

Verdict: RUNTIME ERROR

input
`100000 90064 100000 49287 15554 87606 77063 64381 ...` view save

correct output
`1 2 0 0 0 ...` view save

user output
(empty)

Test 65

Verdict: RUNTIME ERROR

input
`100000 5519 100000 4806 4589 1141 2008 5070 5406 ...` view save

correct output
`10 1 9 14 0 ...` view save

user output
(empty)

Test 66

Verdict: RUNTIME ERROR

input
`100000 94750 100000 31456 19842 77813 6089 3951 35...` view save

correct output
`0 1 0 1 0 ...` view save

user output
(empty)

Test 67

Verdict: RUNTIME ERROR

input
`100000 22735 100000 17732 7252 9968 22240 16449 10...` view save

correct output
`0 4 0 1 1 ...` view save

user output
(empty)

Test 68

Verdict: RUNTIME ERROR

input
`100000 1112 100000 1078 267 967 420 591 908 259 4...` view save

correct output
`7 13 73 12 23 ...` view save

user output
(empty)

Test 69

Verdict: RUNTIME ERROR

input
`100000 36447 100000 18292 18192 18070 275 4878 115...` view save

correct output
`0 1 1 2 2 ...` view save

user output
(empty)

Test 70

Verdict: RUNTIME ERROR

input
`100000 100000 100000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`100000 100000 100000 100000 100000 ...` view save

user output
(empty)

Aalto Competitive Programming 2024 - wk4 - Mon

Targeted advertising

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Test 32

Test 33

Test 34

Test 35

Test 36

Test 37

Test 38

Test 39

Test 40

Test 41

Test 42

Test 43

Test 44

Test 45

Test 46

Test 47

Test 48

Test 49

Test 50

Test 51

Test 52

Test 53

Test 54

Test 55

Test 56

Test 57

Test 58

Test 59

Test 60

Test 61

Test 62

Test 63

Test 64

Test 65

Test 66

Test 67

Test 68

Test 69

Test 70

Tasks

Submissions (arnxxau)