제출 #443243

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
443243		LittleCube	Lottery (CEOI18_lot)	C++14	25 / 100	2 ms	1100 KiB

lot

#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
using namespace std;

ll N, l, Q, val[355], ans[355][355];

signed main()
{
    ios::sync_with_stdio(0), cin.tie(0);
    cin >> N >> l;
    for (int i = 1; i <= N; i++)
        cin >> val[i];
    for (int i = 1; i <= N - l + 1; i++)
        for (int j = i + 1; j <= N - l + 1; j++)
        {
            map<int, int> mp;
            int k = l;
            for (int x = 0; x < l; x++)
                if(val[x + i] == val[x + j])
                    k--;
            ans[i][k]++;
            ans[j][k]++;
            //cout << i << " " << j << " " << k << '\n';
        }
    for (int i = 1; i <= N - l + 1; i++)
        for (int j = 1; j <= l; j++)
            ans[i][j] += ans[i][j - 1];
    cin >> Q;
    for (int i = 1; i <= Q; i++)
    {
        int k;
        cin >> k;
        for (int j = 1; j <= N - l + 1; j++)
            cout << ans[j][k] << " \n"[j == N - l + 1];
    }
}

• Subtask 1: 25 / 25
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20