제출 #217519

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
217519		DystoriaX	Lottery (CEOI18_lot)	C++14	45 / 100	63 ms	16248 KiB

lot

#include <bits/stdc++.h>

using namespace std;

int n, l;
int a[2010], b[2010];
int cnt[2010][2010];
int q;

int main(){
    scanf("%d%d", &n, &l);

    for(int i = 1; i <= n; i++) scanf("%d", &a[i]), b[i] = a[i];

    for(int d = 1; d < n - l + 1; d++){
        int diff = 0;

        for(int j = 1; j <= l; j++){
            if(a[j] != a[j + d]) diff++;
        }

        cnt[diff][1]++;
        cnt[diff][d + 1]++;

        for(int i = 2; i + l + d - 1 <= n; i++){
            if(a[i - 1] != a[i + d - 1]) diff--;
            if(a[i + l - 1] != a[i + l - 1 + d]) diff++;

            // cout << "Comparing " << i + l - 1 << " with " << i + l + d - 

            cnt[diff][i]++;
            cnt[diff][i + d]++;
        }
    }

    for(int i = 1; i <= n; i++){
        for(int k = 1; k <= n; k++)
            cnt[k][i] += cnt[k - 1][i];
    }

    scanf("%d", &q);

    while(q--){
        int k; scanf("%d", &k);

        for(int i = 1; i <= n - l + 1; i++) printf("%d ", cnt[k][i]);
        printf("\n");
    }
    
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

lot.cpp: In function 'int main()':
lot.cpp:11:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &l);
     ~~~~~^~~~~~~~~~~~~~~~
lot.cpp:13:51: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 1; i <= n; i++) scanf("%d", &a[i]), b[i] = a[i];
                                 ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
lot.cpp:41:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &q);
     ~~~~~^~~~~~~~~~
lot.cpp:44:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         int k; scanf("%d", &k);
                ~~~~~^~~~~~~~~~

• 서브태스크 1: 25 / 25
• 서브태스크 2: 20 / 20
• 서브태스크 3: 0 / 20
• 서브태스크 4: 0 / 15
• 서브태스크 5: 0 / 20