oj.uz

답안 #868125

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
868125 2023-10-30T13:07:59 Z Cookie Lottery (CEOI18_lot) C++14
35 / 100
 1037 ms 848 KB 
#include<bits/stdc++.h>
#include<fstream>
using namespace std;
ifstream fin("HCN.INP");
ofstream fout("HCN.OUT");
#define sz(a) (int)a.size()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
const ld PI = 3.14159265359;
//using u128 = __uint128_t;
//const int x[4] = {1, -1, 0, 0};
//const int y[4] = {0, 0, 1, -1};
const ll mod = 1e9 + 9;
const int mxn = 1e5 + 5, mxq = 2e5 + 5, sq = 200, mxv = 2e6 + 5;
const ll inf = 1e17 + 5;
//const int base= (1 << 18);
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
int n, l;
int a[10005], ans[10005], res = 0, ok = 0;

void add(int diag, int row){
    int col = diag - n + row;
    if(col >= 1 && col <= n){
        ok++;
        res += (a[row] != a[col]);
    }
}
void rem(int diag, int row){
    int col = diag - n + row;
    if(col >= 1 && col <= n){
        ok--;
        res -= (a[row] != a[col]);
    }
}
signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> l;
    for(int i = 1; i <= n; i++)cin >> a[i];
    int q, k; cin >> q >> k;
    for(int i = 1; i <= n + n - 1; i++){
        res = ok = 0; 
        if(i == n)continue;
        for(int j = 1; j <= l; j++)add(i, j);
        if(ok == l && res <= k){
            ans[1]++;
        }
        
        for(int j = 2; j + l - 1 <= n; j++){
            rem(i, j - 1);
            add(i, j + l - 1);
            if(ok == l && res <= k){
                ans[j]++;
            }
        }
        
        
    }
    for(int i = 1; i + l - 1 <= n; i++)cout << ans[i] << " ";
    return(0);
}

Subtask #1
0 / 25.0

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

Subtask #2
0 / 20.0

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

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1037 ms 776 KB Output is correct
2 Correct 860 ms 348 KB Output is correct
3 Correct 852 ms 596 KB Output is correct
4 Correct 826 ms 628 KB Output is correct
5 Correct 641 ms 600 KB Output is correct
6 Correct 853 ms 612 KB Output is correct
7 Correct 624 ms 604 KB Output is correct
8 Correct 723 ms 848 KB Output is correct
9 Correct 856 ms 620 KB Output is correct
10 Correct 839 ms 616 KB Output is correct
11 Correct 61 ms 504 KB Output is correct
12 Correct 597 ms 588 KB Output is correct
13 Correct 684 ms 600 KB Output is correct
14 Correct 639 ms 600 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1037 ms 776 KB Output is correct
2 Correct 860 ms 348 KB Output is correct
3 Correct 852 ms 596 KB Output is correct
4 Correct 826 ms 628 KB Output is correct
5 Correct 641 ms 600 KB Output is correct
6 Correct 853 ms 612 KB Output is correct
7 Correct 624 ms 604 KB Output is correct
8 Correct 723 ms 848 KB Output is correct
9 Correct 856 ms 620 KB Output is correct
10 Correct 839 ms 616 KB Output is correct
11 Correct 61 ms 504 KB Output is correct
12 Correct 597 ms 588 KB Output is correct
13 Correct 684 ms 600 KB Output is correct
14 Correct 639 ms 600 KB Output is correct
15 Correct 846 ms 540 KB Output is correct
16 Correct 812 ms 848 KB Output is correct
17 Correct 845 ms 608 KB Output is correct
18 Correct 996 ms 624 KB Output is correct
19 Correct 841 ms 600 KB Output is correct
20 Correct 850 ms 788 KB Output is correct
21 Correct 837 ms 624 KB Output is correct

Subtask #5
0 / 20.0

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