oj.uz

답안 #1091882

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1091882 2024-09-22T13:01:50 Z gyg Lottery (CEOI18_lot) C++17
0 / 100
 541 ms 596 KB 
#pragma GCC optimize("Ofast", "unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
#define int short
#define arr array
#define vct vector
const int MX_N = 1e4 + 5, MX_Q = 1e2 + 5;

int n, l;
arr<int, MX_N> vl;
int q;
arr<int, MX_Q> qry;

arr<arr<int, MX_N>, 2> sm;
vct<int> sms;
arr<arr<int, MX_N>, MX_Q> ans;
void cmp() {
    for (int i = n; i >= 1; i--) {
        int prt = i % 2, opp_prt = (i + 1) % 2;
        
        for (int j = 1; j <= n; j++) sm[prt][j] = (vl[i] == vl[j]) + sm[opp_prt][j + 1];
        
        sms.clear();
        for (int j = 1; j <= n - l + 1; j++)
            if (j != i) sms.push_back(sm[prt][j]);
        
        for (int j = 1; j <= q; j++) 
            ans[j][i] = count_if(sms.begin(), sms.end(), [j](int x) { return x >= l - qry[j]; } );   
        
        for (int j = 1; j <= n; j++) {
            int nw_i = i + l - 1, nw_j = j + l - 1;
            if (max(nw_i, nw_j) > n) continue;
            sm[prt][j] -= (vl[nw_i] == vl[nw_j]);
        }
    }
}

signed main() {
    // freopen("lttry.in", "r", stdin);
    cin >> n >> l;
    for (int i = 1; i <= n; i++) cin >> vl[i];
    cin >> q;
    for (int i = 1; i <= q; i++) cin >> qry[i];

    cmp();

    for (int i = 1; i <= q; i++) {
        for (int j = 1; j <= n - l + 1; j++) cout << ans[i][j] << " ";
        cout << endl;
    }
}

Subtask #1
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 533 ms 568 KB Output is correct
2 Correct 527 ms 560 KB Output is correct
3 Correct 541 ms 596 KB Output is correct
4 Incorrect 249 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 533 ms 568 KB Output is correct
2 Correct 527 ms 560 KB Output is correct
3 Correct 541 ms 596 KB Output is correct
4 Incorrect 249 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -