제출 #483359

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
483359		BERNARB01	Lottery (CEOI18_lot)	C++17	100 / 100	1852 ms	12120 KiB

lot

#include <bits/stdc++.h>
 
using namespace std;
 
const int N = 10004;
 
int n, l, a[N], q;
long long v[102][N];
pair<int, int> k[102];
 
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> l;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  cin >> q;
  for (int i = 0; i < q; i++) {
    cin >> k[i].first;
    k[i].second = i;
  }
  sort(k, k + q);
  for (int i = 1; i + l <= n; i++) {
    int c = 0;
    for (int j = 0; j < l - 1; j++) {
      c += (a[j] != a[j + i]);
    }
    for (int s = 0, ss = i; ss + l <= n; s++, ss++) {
      c += (a[s + l - 1] != a[ss + l - 1]);
      if (k[q - 1].first >= c) {
        int lb = -1, r = q - 1;
        while (r - lb > 1) {
          int mid = (lb + r) >> 1;
          if (k[mid].first >= c) {
            r = mid;
          } else {
            lb = mid;
          }
        }
        v[k[r].second][s] += 1;
        v[k[r].second][ss] += 1;
      }
      c -= (a[s] != a[ss]);
    }
  }
  for (int j = 1; j < q; j++) {
    for (int i = 0; i + l <= n; i++) {
      v[k[j].second][i] += v[k[j - 1].second][i];
    }
  }
  for (int j = 0; j < q; j++) {
    for (int i = 0; i + l <= n; i++) {
      if (i > 0) {
        cout << " ";
      }
      cout << v[j][i];
    }
    cout << '\n';
  }
  return 0;
}

• Subtask 1: 25 / 25
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 15 / 15
• Subtask 5: 20 / 20