oj.uz

답안 #736462

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
736462 2023-05-05T17:12:04 Z study Lottery (CEOI18_lot) C++17
0 / 100
 3000 ms 65536 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 1e4+1;

short a[N], diff[N][N], ans[N][N];

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n,l;
    cin >> n >> l;
    for (int i=0; i<n; ++i){
        cin >> a[i];
    }
    for (int i=1; i<n-l+1; ++i){
        for (int j=0; j<l; ++j){
            if (a[i+j] != a[j]) diff[0][i]++;
        }
        ans[0][diff[0][i]]++;
        ans[i][diff[0][i]]++;
    }
    for (int i=1; i<n-l+1; ++i){
        for (int j=i+1; j<n-l+1; ++j){
            diff[i][j] = diff[i-1][j-1]-(a[i-1] != a[j-1])+(a[i+l-1] != a[j+l-1]);
            ans[i][diff[i][j]]++;
            ans[j][diff[i][j]]++;
        }
    }
    for (int i=0; i<n; ++i){
        for (int j=1; j<=l; ++j){
            ans[i][j] += ans[i][j-1];
        }
    }
    int q;
    cin >> q;
    while (q--){
        int k;
        cin >> k;
        for (int i=0; i<n-l+1; ++i) cout << ans[i][k] << ' ';
        cout << '\n';
    }
	return 0;
}

Subtask #1
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 924 KB Output is correct
5 Execution timed out 3058 ms 65536 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 924 KB Output is correct
5 Execution timed out 3058 ms 65536 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 131 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 131 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 924 KB Output is correct
5 Execution timed out 3058 ms 65536 KB Time limit exceeded
6 Halted 0 ms 0 KB -