oj.uz

답안 #983494

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
983494 2024-05-15T15:10:45 Z LOLOLO Lottery (CEOI18_lot) C++11
45 / 100
 55 ms 65536 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;
 
#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (int)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())
 
const int N = 1e4 + 10;
int a[N], f[N], used[N];
vector <int> add[N];
vector <int> lst[N];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n, l;
    cin >> n >> l;

    vector <int> cnt(n - l + 1, 0);

    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }

    for (int d = 1; d <= n; d++) {
        mem(f, 0);
        for (int i = n; i >= d + 1; i--) {
            f[i] = f[i + 1] + (a[i] != a[i - d]);
            if (i + l <= n + 1) {
                int cnt = f[i] - f[i + l];
                add[cnt].pb(i);
                add[cnt].pb(i - d);
            }
        }
    }

    vector <int> ask;

    int q;
    cin >> q;

    for (int i = 0; i < q; i++) {
        int x;
        cin >> x;
        used[x] = 1;
        ask.pb(x);
    }

    for (int i = 0; i <= l; i++) {
        for (auto x : add[i]) {
            cnt[x - 1]++;
        }

        if (used[i])
            lst[i] = cnt;
    }

    for (auto x : ask) {
        for (auto t : lst[x])
            cout << t << " ";

        cout << '\n';
    }

    return 0;
}

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 1 ms 860 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 1 ms 856 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 1 ms 856 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1112 KB Output is correct
10 Correct 2 ms 1528 KB Output is correct
11 Correct 2 ms 1508 KB Output is correct
12 Correct 1 ms 1508 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 1 ms 860 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 1 ms 856 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 1 ms 856 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1112 KB Output is correct
10 Correct 2 ms 1528 KB Output is correct
11 Correct 2 ms 1508 KB Output is correct
12 Correct 1 ms 1508 KB Output is correct
13 Correct 23 ms 25416 KB Output is correct
14 Correct 14 ms 10960 KB Output is correct
15 Correct 13 ms 10704 KB Output is correct
16 Correct 20 ms 19912 KB Output is correct
17 Correct 19 ms 18632 KB Output is correct
18 Correct 18 ms 17864 KB Output is correct

Subtask #3
0 / 20.0

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

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 55 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 860 KB Output is correct
2 Correct 1 ms 860 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 1 ms 856 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 1 ms 856 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1112 KB Output is correct
10 Correct 2 ms 1528 KB Output is correct
11 Correct 2 ms 1508 KB Output is correct
12 Correct 1 ms 1508 KB Output is correct
13 Correct 23 ms 25416 KB Output is correct
14 Correct 14 ms 10960 KB Output is correct
15 Correct 13 ms 10704 KB Output is correct
16 Correct 20 ms 19912 KB Output is correct
17 Correct 19 ms 18632 KB Output is correct
18 Correct 18 ms 17864 KB Output is correct
19 Runtime error 55 ms 65536 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -