Submission #1157621

#TimeUsernameProblemLanguageResultExecution timeMemory
1157621mocha단층 (JOI16_ho_t5)C++20
34 / 100
2094 ms8008 KiB
#include <bits/stdc++.h> #define int long long #define ff first #define ss second using namespace std; const int mx = 2e5+5; int n, q; pair<int, int> p[mx]; struct node { int x, ty, l; } qu[mx]; signed main() { cin >> n >> q; for (int i=1;i<=n;i++) p[i] = {i, 0}; for (int i=1;i<=q;i++) { cin >> qu[i].x >> qu[i].ty >> qu[i].l; } for (int i=q;i>=1;i--) { auto [x, ty, l] = qu[i]; if (ty == 1) { for (int i=1;i<=n;i++) { if (p[i].ff <= x) p[i].ss += l; } } else { for (int i=1;i<=n;i++) { int X = p[i].ff - 2 * p[i].ss, Y = 0; if (X > x) { p[i].ff += 2 * l; p[i].ss += l; } } } } for (int i=1;i<=n;i++) cout << p[i].ss << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...