oj.uz

Submission #248763

# Submission time Handle Problem Language Result Execution time Memory
248763 2020-07-13T10:17:19 Z Sorting Lottery (CEOI18_lot) C++14
45 / 100
 1018 ms 65540 KB 
#include <bits/stdc++.h>

using namespace std;

const int k_N = 1e4 + 3;

int n, l;
int a[k_N];

short cnt[k_N][k_N];
short prefix[k_N];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> l;
    for(int i = 0; i < n; ++i)
        cin >> a[i];

    int q;
    cin >> q;

    for(int d = 1; d < n - l + 1; d++){
        prefix[0] = (a[0] != a[d]);
        for(int i = 1; i < n - d; ++i)
            prefix[i] = (a[i] != a[i + d]) + prefix[i - 1];

        for(int i = 0; i < n - l + 1 - d; ++i){
            int sum = prefix[i + l - 1];
            if(i)
                sum -= prefix[i - 1];
            cnt[i][sum]++;
            cnt[i + d][sum]++;
        }
    }

    for(int i = 0; i < n; ++i)
        for(int j = 1; j < n; ++j)
            cnt[i][j] += cnt[i][j - 1]; 

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

        for(int j = 0; j < n - l + 1; ++j)
            cout << cnt[j][k] << " ";
        cout << "\n";
    }
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 1 ms 768 KB Output is correct
4 Correct 1 ms 768 KB Output is correct
5 Correct 1 ms 768 KB Output is correct
6 Correct 1 ms 768 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 2 ms 1792 KB Output is correct
9 Correct 2 ms 1792 KB Output is correct
10 Correct 2 ms 1792 KB Output is correct
11 Correct 2 ms 1792 KB Output is correct
12 Correct 2 ms 1792 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 1 ms 768 KB Output is correct
4 Correct 1 ms 768 KB Output is correct
5 Correct 1 ms 768 KB Output is correct
6 Correct 1 ms 768 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 2 ms 1792 KB Output is correct
9 Correct 2 ms 1792 KB Output is correct
10 Correct 2 ms 1792 KB Output is correct
11 Correct 2 ms 1792 KB Output is correct
12 Correct 2 ms 1792 KB Output is correct
13 Correct 46 ms 16292 KB Output is correct
14 Correct 31 ms 16384 KB Output is correct
15 Correct 28 ms 16256 KB Output is correct
16 Correct 43 ms 16376 KB Output is correct
17 Correct 38 ms 16376 KB Output is correct
18 Correct 39 ms 16376 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 1018 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 1018 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 1 ms 768 KB Output is correct
4 Correct 1 ms 768 KB Output is correct
5 Correct 1 ms 768 KB Output is correct
6 Correct 1 ms 768 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 2 ms 1792 KB Output is correct
9 Correct 2 ms 1792 KB Output is correct
10 Correct 2 ms 1792 KB Output is correct
11 Correct 2 ms 1792 KB Output is correct
12 Correct 2 ms 1792 KB Output is correct
13 Correct 46 ms 16292 KB Output is correct
14 Correct 31 ms 16384 KB Output is correct
15 Correct 28 ms 16256 KB Output is correct
16 Correct 43 ms 16376 KB Output is correct
17 Correct 38 ms 16376 KB Output is correct
18 Correct 39 ms 16376 KB Output is correct
19 Runtime error 1018 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
20 Halted 0 ms 0 KB -