답안 #930499

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
930499	2024-02-20T03:33:11 Z	Regulus	Lottery (CEOI18_lot)	C++17	25 / 100	224 ms	604 KB

lot

#include <bits/stdc++.h>
#define IO ios::sync_with_stdio(false);cin.tie(0);
#define debug(x) cerr << #x << " = " << (x) << ' '
#define bug(x) cerr << (x) << ' '
#define endl cerr << '\n'
#define all(v) (v).begin(), (v).end()
#define SZ(v) (ll)(v).size()
#define lowbit(x) (x)&-(x)
#define pb emplace_back
#define F first
#define S second
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
//#define TEST

const int N = 305;
int sum[N][N], a[N];

int main(void)
{ IO
    int n, i, len, Q;

    cin >> n >> len;
    for (i=1; i <= n; ++i) cin >> a[i];
    for (i=1; i <= n-len+1; ++i)
    {
        for (int j=1; j <= n-len+1; ++j)
        {
            if (i == j) continue;
            int cnt = 0;
            for (int k=0; k < len; ++k)
                if (a[i+k] != a[j+k]) ++cnt;
            ++sum[cnt][i];
        }
        for (int j=1; j <= len; ++j) sum[j][i] += sum[j-1][i];
    }

    cin >> Q;
    do {
        int x; cin >> x;
        for (i=1; i <= n-len+1; ++i) cout << sum[x][i] << ' ';
        cout << '\n';
    } while (--Q);

    return 0;
}

Subtask #1

25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	3 ms	604 KB	Output is correct
9	Correct	2 ms	604 KB	Output is correct
10	Correct	2 ms	348 KB	Output is correct
11	Correct	1 ms	492 KB	Output is correct
12	Correct	2 ms	344 KB	Output is correct

Subtask #2

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	3 ms	604 KB	Output is correct
9	Correct	2 ms	604 KB	Output is correct
10	Correct	2 ms	348 KB	Output is correct
11	Correct	1 ms	492 KB	Output is correct
12	Correct	2 ms	344 KB	Output is correct
13	Incorrect	16 ms	348 KB	Output isn't correct
14	Halted	0 ms	0 KB	-

Subtask #3

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	224 ms	344 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	224 ms	344 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	3 ms	604 KB	Output is correct
9	Correct	2 ms	604 KB	Output is correct
10	Correct	2 ms	348 KB	Output is correct
11	Correct	1 ms	492 KB	Output is correct
12	Correct	2 ms	344 KB	Output is correct
13	Incorrect	16 ms	348 KB	Output isn't correct
14	Halted	0 ms	0 KB	-