제출 #444178

#제출 시각아이디문제언어결과실행 시간메모리
444178BeanZLottery (CEOI18_lot)C++14
100 / 100
1474 ms8396 KiB
// I_Love_LPL 1y0m3d #include <bits/stdc++.h> using namespace std; #define ll int #define endl '\n' const int N = 1e4 + 5; long long mod = 1000007; const int lim = 4e5 + 5; const int lg = 20; const int base = 311; const long double eps = 1e-6; ll a[N], dp[N][105], Q[N]; int main(){ ios_base::sync_with_stdio(false); cin.tie(0); if (fopen("tests.inp", "r")){ freopen("test.inp", "r", stdin); freopen("test.out", "w", stdout); } ll n, l; cin >> n >> l; for (int i = 1; i <= n; i++){ cin >> a[i]; } ll q; cin >> q; vector<ll> mem; for (int i = 1; i <= q; i++){ cin >> Q[i]; mem.push_back(Q[i]); } sort(mem.begin(), mem.end()); for (int d = 1; (d + l) <= n; d++){ ll cost = 0; for (int i = 1; i <= l; i++){ if (a[i] != a[i + d]) cost++; } ll id = lower_bound(mem.begin(), mem.end(), cost) - mem.begin(); dp[1][id]++; dp[1 + d][id]++; for (int i = 2; (i + d + l - 1) <= n; i++){ if (a[i - 1] != a[i + d - 1]) cost--; if (a[i + l - 1] != a[i + d + l - 1]) cost++; id = lower_bound(mem.begin(), mem.end(), cost) - mem.begin(); dp[i][id]++; dp[i + d][id]++; } } for (int i = 1; i <= n; i++){ for (int j = 1; j < q; j++){ dp[i][j] += dp[i][j - 1]; } } for (int i = 1; i <= q; i++){ ll idx = lower_bound(mem.begin(), mem.end(), Q[i]) - mem.begin(); for (int j = 1; (j + l - 1) <= n; j++){ cout << dp[j][idx] << " "; } cout << endl; } } /* Ans: Out: */

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

lot.cpp: In function 'int main()':
lot.cpp:17:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |         freopen("test.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
lot.cpp:18:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |         freopen("test.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
#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...