oj.uz

Submission #640814

# Submission time Handle Problem Language Result Execution time Memory
640814 2022-09-15T10:09:28 Z maks007 Fountain (eJOI20_fountain) C++14
60 / 100
 530 ms 524288 KB 
#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::priority_queue <std::pair <int,int> > s;
	for(int i = 0; i < n; i ++) {
		if(s.size() == 0) {
			s.push({-d[i], i});
		}else {
			while(s.empty() ==false and -(s.top()).first < d[i]) {
				std::pair <int,int> cur = s.top();
				s.pop();
				next[cur.second] = i;
				if(s.size() == 0) break;
			}
			s.push({-d[i], i});
		}
	}
	while(s.size() > 0) {
		next[(s.top()).second] = n;
		s.pop();
	}
	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(where[r].first >= N) while(true);
			if(m >= (int)Pref[where[r].first].size()) while(true);
			
			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;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1748 KB Output is correct
2 Correct 2 ms 1876 KB Output is correct
3 Correct 3 ms 1876 KB Output is correct
4 Correct 4 ms 2004 KB Output is correct
5 Correct 5 ms 1876 KB Output is correct
6 Correct 6 ms 2900 KB Output is correct
7 Correct 5 ms 2004 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 296 ms 7816 KB Output is correct
2 Correct 345 ms 7436 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1748 KB Output is correct
2 Correct 2 ms 1876 KB Output is correct
3 Correct 3 ms 1876 KB Output is correct
4 Correct 4 ms 2004 KB Output is correct
5 Correct 5 ms 1876 KB Output is correct
6 Correct 6 ms 2900 KB Output is correct
7 Correct 5 ms 2004 KB Output is correct
8 Correct 296 ms 7816 KB Output is correct
9 Correct 345 ms 7436 KB Output is correct
10 Correct 5 ms 2008 KB Output is correct
11 Runtime error 530 ms 524288 KB Execution killed with signal 9
12 Halted 0 ms 0 KB -