제출 #320767

#제출 시각아이디문제언어결과실행 시간메모리
320767dolphingarlicLottery (CEOI18_lot)C++14
100 / 100
587 ms12388 KiB
#include <bits/stdc++.h> using namespace std; int a[10000], lb[10001], pref[101][10000], ans[100][10000]; pair<int, int> k[100]; int main() { int n, l, q; scanf("%d %d", &n, &l); for (int i = 0; i < n; i++) scanf("%d", a + i); scanf("%d", &q); for (int i = 0; i < q; i++) { scanf("%d", &k[i].first); k[i].second = i; } sort(k, k + q); fill(lb, lb + l + 1, q); for (int t = q - 1; ~t; t--) { for (int i = 0; i <= l; i++) if (i <= k[t].first) lb[i] = t; } for (int dx = 1; dx <= n - l; dx++) { int diff = 0; for (int p = 0; p < l; p++) diff += (a[p] != a[dx + p]); pref[lb[diff]][0]++, pref[lb[diff]][dx]++; for (int i = 1; i <= n - l - dx; i++) { diff += (a[i + l - 1] != a[i + dx + l - 1]) - (a[i - 1] != a[i + dx - 1]); pref[lb[diff]][i]++, pref[lb[diff]][i + dx]++; } } for (int t = 0; t < q; t++) for (int i = 0; i <= n - l; i++) { if (t) pref[t][i] += pref[t - 1][i]; ans[k[t].second][i] = pref[t][i]; } for (int t = 0; t < q; t++) { for (int i = 0; i <= n - l; i++) printf("%d ", ans[t][i]); printf("\n"); } }

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

lot.cpp: In function 'int main()':
lot.cpp:9:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    9 |     scanf("%d %d", &n, &l);
      |     ~~~~~^~~~~~~~~~~~~~~~~
lot.cpp:10:38: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   10 |     for (int i = 0; i < n; i++) scanf("%d", a + i);
      |                                 ~~~~~^~~~~~~~~~~~~
lot.cpp:11:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   11 |     scanf("%d", &q);
      |     ~~~~~^~~~~~~~~~
lot.cpp:13:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   13 |         scanf("%d", &k[i].first);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...