提出 #74030922


ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
const ll mod = 998244353;

// #include <atcoder/all>
// using mint = atcoder::modint998244353;
// using namespace atcoder;

int main() {
    int n, w, k;
    cin >> n >> w >> k;

    vector<int> l(k);
    for (int i=0; i<k; i++) {
      cin >> l[i];
      l[i]--;
    }
    
    vector<int> imos(n+1, 0);
    for (int i=0; i<k; i++) {
      imos[l[i]]++;
      imos[l[i]+w]--;
    }
    
    for (int i=0; i<n; i++) {
      cout << imos[i] << " ";
      imos[i+1] += imos[i];
    }
    cout << endl;
    
    return 0;
}

提出情報

提出日時
問題 D - 蛍光ペンでマーキング
ユーザ aonyx64
言語 C++23 (GCC 15.2.0)
得点 366
コード長 672 Byte
結果 AC
実行時間 45 ms
メモリ 5012 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 366 / 366
結果
AC × 3
AC × 70
セット名 テストケース
Sample sample01.txt, sample02.txt, sample03.txt
All sample01.txt, sample02.txt, sample03.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in56.txt, in57.txt, in58.txt, in59.txt, in60.txt, in61.txt, in62.txt, in63.txt, in64.txt, in65.txt, in66.txt, in67.txt
ケース名 結果 実行時間 メモリ
in01.txt AC 1 ms 3532 KiB
in02.txt AC 1 ms 3492 KiB
in03.txt AC 1 ms 3532 KiB
in04.txt AC 1 ms 3532 KiB
in05.txt AC 1 ms 3440 KiB
in06.txt AC 1 ms 3532 KiB
in07.txt AC 1 ms 3552 KiB
in08.txt AC 1 ms 3476 KiB
in09.txt AC 9 ms 3996 KiB
in10.txt AC 45 ms 4824 KiB
in11.txt AC 44 ms 4880 KiB
in12.txt AC 9 ms 4048 KiB
in13.txt AC 9 ms 3952 KiB
in14.txt AC 9 ms 4060 KiB
in15.txt AC 41 ms 4824 KiB
in16.txt AC 27 ms 4664 KiB
in17.txt AC 37 ms 4764 KiB
in18.txt AC 44 ms 4752 KiB
in19.txt AC 42 ms 5000 KiB
in20.txt AC 27 ms 4792 KiB
in21.txt AC 43 ms 4664 KiB
in22.txt AC 42 ms 4752 KiB
in23.txt AC 38 ms 4888 KiB
in24.txt AC 27 ms 5012 KiB
in25.txt AC 1 ms 3584 KiB
in26.txt AC 1 ms 3524 KiB
in27.txt AC 1 ms 3496 KiB
in28.txt AC 1 ms 3436 KiB
in29.txt AC 1 ms 3620 KiB
in30.txt AC 45 ms 4696 KiB
in31.txt AC 27 ms 4892 KiB
in32.txt AC 5 ms 3596 KiB
in33.txt AC 1 ms 3440 KiB
in34.txt AC 1 ms 3496 KiB
in35.txt AC 1 ms 3512 KiB
in36.txt AC 1 ms 3524 KiB
in37.txt AC 1 ms 3620 KiB
in38.txt AC 1 ms 3492 KiB
in39.txt AC 1 ms 3492 KiB
in40.txt AC 1 ms 3600 KiB
in41.txt AC 1 ms 3512 KiB
in42.txt AC 35 ms 4892 KiB
in43.txt AC 44 ms 4748 KiB
in44.txt AC 33 ms 4744 KiB
in45.txt AC 43 ms 4880 KiB
in46.txt AC 41 ms 4828 KiB
in47.txt AC 43 ms 4764 KiB
in48.txt AC 41 ms 4808 KiB
in49.txt AC 37 ms 4368 KiB
in50.txt AC 43 ms 4764 KiB
in51.txt AC 1 ms 3532 KiB
in52.txt AC 1 ms 3492 KiB
in53.txt AC 1 ms 3532 KiB
in54.txt AC 1 ms 3396 KiB
in55.txt AC 1 ms 3496 KiB
in56.txt AC 1 ms 3492 KiB
in57.txt AC 4 ms 3576 KiB
in58.txt AC 4 ms 3660 KiB
in59.txt AC 1 ms 3492 KiB
in60.txt AC 1 ms 3600 KiB
in61.txt AC 1 ms 3532 KiB
in62.txt AC 1 ms 3552 KiB
in63.txt AC 1 ms 3432 KiB
in64.txt AC 1 ms 3532 KiB
in65.txt AC 1 ms 3524 KiB
in66.txt AC 9 ms 3984 KiB
in67.txt AC 9 ms 3984 KiB
sample01.txt AC 1 ms 3524 KiB
sample02.txt AC 1 ms 3396 KiB
sample03.txt AC 1 ms 3532 KiB