Submission #268284

#TimeUsernameProblemLanguageResultExecution timeMemory
268284imeimi2000A Game with Grundy (CCO20_day1problem1)C++17
25 / 25
76 ms5224 KiB
#include <bits/stdc++.h> using namespace std; int n, L, R, Y; int ans[100001]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> L >> R >> Y; vector<pair<int, int>> P; for (int i = 1; i <= n; ++i) { int x, v, h; cin >> x >> v >> h; int l = max(L, x - (Y * h - 1) / v); int r = min(R, x + (Y * h - 1) / v); P.emplace_back(l, 1); P.emplace_back(r + 1, -1); } P.emplace_back(R + 1, 0); sort(P.begin(), P.end()); int x = L, sum = 0; for (auto [i, c] : P) { ans[sum] += i - x; x = i; sum += c; } for (int i = 1; i <= n; ++i) ans[i] += ans[i - 1]; for (int i = 0; i <= n; ++i) printf("%d\n", ans[i]); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...