Submission #640705

#TimeUsernameProblemLanguageResultExecution timeMemory
640705maks007Fountain (eJOI20_fountain)C++14
60 / 100
593 ms524288 KiB
#include "bits/stdc++.h" #define int long long #define N (int)1e5 int next[N+1]; std::pair <int,int> where[N+1]; std::vector <std::vector <int>> Pref; std::vector <std::vector <int> > who; signed main () { for(int i = 0; i <= N; i ++) where[i] = {-1,-1}; int n, q; std::cin >> n >> q; int d[n], c[n]; for(int i = 0; i < n; i ++) std::cin >> d[i] >> c[i]; std::set <std::pair <int,int> > s; s.insert({LONG_LONG_MAX, LONG_LONG_MAX}); for(int i = 0; i < n; i ++) { if(s.size() == 1) { s.insert({d[i], i}); }else { while((*s.begin()).first < d[i]) { std::pair <int,int> cur = *s.begin(); s.erase(s.begin()); next[cur.second] = i; if(s.size() == 1) break; } s.insert({d[i], i}); } } while(s.size() > 1) { next[(*s.begin()).second] = n; s.erase(s.begin()); } for(int i = 0; i < n; i ++) { if(where[i].first != -1) continue; std::vector <int> pref; pref.push_back(c[i]); where[i] = {Pref.size(), 0}; std::vector <int> forwho; forwho.push_back(i+1); for(int j = next[i]; j != n; j = next[j]) { if(j == n) break; if(next[j] > 1e5) break; pref.push_back(pref.back() + c[j]); forwho.push_back(j+1); where[j] = {Pref.size(),pref.size()-1}; } Pref.push_back(pref); who.push_back({}); for(auto j : forwho) { who.back().push_back(j); } } while(q --) { int v, r; std::cin >> v >> r; std::swap(v, r); r --; int l = 0, rr = Pref[where[r].first].size()-1; while(l < rr) { int m = (l + rr)/2; if(Pref[where[r].first][m] - (where[r].second==0?0:Pref[where[r].first][where[r].second-1]) >= v) rr = m; else l = m + 1; } if(Pref[where[r].first].back()< v) std::cout << 0LL << "\n"; else std::cout << who[where[r].first][rr] << "\n"; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...