Submission #740426

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
740426	2023-05-12T12:58:15 Z	kirakaminski968	Lottery (CEOI18_lot)	C++17	45 / 100	529 ms	65536 KB

lot

#include <bits/stdc++.h>
using namespace std;

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    int N,L; cin >> N >> L;
    vector<int> arr(N); vector<vector<int>> dist(N,vector<int>(N+1,0));
    for(int i = 0;i<N;++i) cin >> arr[i];
    for(int i = 0;i<N-L+1;++i){
        for(int j = i+1;j<N-L+1;++j){
            int dis = 0;
            for(int k = 0;k<L;++k){
                if(arr[i+k] != arr[j+k]) ++dis;
            }
            ++dist[i][dis]; ++dist[j][dis];
        }
    }
    for(int i = 0;i<N;++i){
        for(int j = 1;j<=N;++j) dist[i][j] += dist[i][j-1];
    }
    int Q; cin >> Q;
    while(Q--){
        int k; cin >> k;
        for(int i = 0;i<N-L+1;++i){
            if(i != N-L) cout << dist[i][k] << " ";
            else cout << dist[i][k] << "\n";
        }
    }
    return 0;
}

Subtask #1

25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	5 ms	580 KB	Output is correct
9	Correct	3 ms	596 KB	Output is correct
10	Correct	2 ms	596 KB	Output is correct
11	Correct	2 ms	580 KB	Output is correct
12	Correct	3 ms	596 KB	Output is correct

Subtask #2

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	5 ms	580 KB	Output is correct
9	Correct	3 ms	596 KB	Output is correct
10	Correct	2 ms	596 KB	Output is correct
11	Correct	2 ms	580 KB	Output is correct
12	Correct	3 ms	596 KB	Output is correct
13	Correct	46 ms	16060 KB	Output is correct
14	Correct	500 ms	16076 KB	Output is correct
15	Correct	529 ms	16080 KB	Output is correct
16	Correct	331 ms	16088 KB	Output is correct
17	Correct	365 ms	16076 KB	Output is correct
18	Correct	430 ms	16084 KB	Output is correct

Subtask #3

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	32 ms	65536 KB	Execution killed with signal 9
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	32 ms	65536 KB	Execution killed with signal 9
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	5 ms	580 KB	Output is correct
9	Correct	3 ms	596 KB	Output is correct
10	Correct	2 ms	596 KB	Output is correct
11	Correct	2 ms	580 KB	Output is correct
12	Correct	3 ms	596 KB	Output is correct
13	Correct	46 ms	16060 KB	Output is correct
14	Correct	500 ms	16076 KB	Output is correct
15	Correct	529 ms	16080 KB	Output is correct
16	Correct	331 ms	16088 KB	Output is correct
17	Correct	365 ms	16076 KB	Output is correct
18	Correct	430 ms	16084 KB	Output is correct
19	Runtime error	32 ms	65536 KB	Execution killed with signal 9
20	Halted	0 ms	0 KB	-