Submission #233349

#TimeUsernameProblemLanguageResultExecution timeMemory
233349VimmerSegway (COI19_segway)C++14
0 / 100
5 ms384 KiB
#include <bits/stdc++.h> //#include <ext/pb_ds/assoc_container.hpp> //#include <ext/pb_ds/tree_policy.hpp> //#pragma GCC optimize("unroll-loops") //#pragma GCC optimize("-O3") //#pragma GCC optimize("Ofast") #define sz(x) ll(x.size()) #define N 100015 #define base 1000000 #define M ll(1e9+7) #define F first #define S second #define pb push_back #define in insert #define eb emplace_back #define ed "\n" using namespace std; //using namespace __gnu_pbds; typedef long long ll; typedef long double ld; typedef short int si; //typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; // int t[N], pos[20005], dob[20005], been[20005]; bool booster[305]; void upd(int v, int val) {for (; v < N; v = (v | (v + 1))) t[v] += val;} int get(int v) {int res = 0; for (; v >= 0; v = (v & (v + 1)) - 1) res += t[v]; return res;} unordered_map <int, int> koler; int main() { // freopen("input.txt","r",stdin); freopen("output.txt","w",stdout); ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; if (n <= 305) exit(0); int a[n], b[n], c[n]; int mx = 0; for (int i = 0; i < n; i++) {cin >> a[i] >> b[i] >> c[i]; mx = max(mx, (a[i] + b[i] + c[i]) * 100);} int m; cin >> m; if (m == 0) { for (int i = 0; i < n; i++) cout << (a[i] + b[i] + c[i]) * 100 << endl; exit(0); } else if (m == 1) { // int t; // // cin >> t; // // int when[n]; // // for (int i = 0; i < n; i++) // { // if (t <= 100) when[i] = t * a[i]; // else if (t <= 200) when[i] = 100 * a[i] + (t - 100) * b[i]; // else when[i] = 100 * (a[i] + b[i]) + (t - 200) * c[i]; // // upd(when[i], 1); // } // // for (int i = 0; i < n; i++) // { // int tp = get(when[i] - 1) % 20; // // int ans = when[i] + min(tp, 300 - t); // // int tr = t + tp; // // if (tr <= 100) ans += (b[i] + c[i]) * 100 + a[i] * (100 - tr); // else if (tr <= 200) ans += c[i] * 100 + b[i] * (200 - tr); // else if (tr <= 300) ans += c[i] * (300 - tr); // // cout << ans << '\n'; // } } else { for (; m > 0; m--) {int t; cin >> t; booster[t] = 1;} int ans[n]; for (int i = 1; i <= mx; i++) { vector <int> vr; vr.clear(); vector <int> check; check.clear(); vr.pb(1e9); koler.clear(); for (int j = 0; j < n; j++) { int lst = pos[j]; if (lst == 300) {vr.pb(lst); continue;} int spd = 0; if (dob[j] != 0) { spd = 1; dob[j]--;} else if (lst < 100) spd = a[j]; else if (lst < 200) spd = b[j]; else spd = c[j]; if (i - been[j] >= spd) { been[j] = i; pos[j] = lst + 1; koler[lst + 1]++; if (booster[pos[j]]) check.pb(j); if (lst + 1 == 300) ans[j] = i; } else pos[j] = lst; vr.pb(pos[j]); } sort(vr.begin(), vr.end()); for (auto it : check) { if (dob[it] != 0) continue; int kol = sz(vr) - (lower_bound(vr.begin(), vr.end(), pos[it]) - vr.begin()) - 1 - koler[pos[it]]; dob[it] = kol % 20; } } for (int i = 0; i < n; i++) cout << ans[i] << '\n'; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...