Submission #233636

#TimeUsernameProblemLanguageResultExecution timeMemory
233636VimmerSegway (COI19_segway)C++14
40 / 100
1054 ms295544 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 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[305], pos[20005], dob[20005], been[20005]; bool booster[305]; void upd(int v, int val) {for (; v < 305; 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; vector <int> g[15005]; 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; 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; for (; m > 0; m--) {int t; cin >> t; booster[t] = 1;} int ans[n]; for (int i = 0; i < n; i++) {g[a[i]].pb(i); upd(0, 1);} for (int i = 1; i <= mx; i++) { vector <int> check; check.clear(); koler.clear(); for (auto j : g[i]) { int lst = pos[j]; if (lst == 300) 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); upd(lst, -1); upd(lst + 1, 1); if (dob[j] != 0) spd = 1; else if (lst < 100) spd = a[j]; else if (lst < 200) spd = b[j]; else spd = c[j]; if (lst + 1 == 300) ans[j] = i; } else pos[j] = lst; g[i + 1].pb(j); } for (auto it : check) { if (dob[it] != 0) continue; int kol = n - get(pos[it] - 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...