Submission #397039

#	Time	Username	Problem	Language	Result	Execution time	Memory
397039		tibinyte	Cambridge (info1cup18_cambridge)	C++14	55 / 100	2077 ms	4772 KiB

cambridge

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <bitset>
#include <string>
#include <unordered_map>
#define mod 1000000007
using namespace std;
int main() {
	int n, q;
	cin >> n >> q;
	vector<pair<int, int>> a(n + 1);
	for (int i = 1; i <= n; ++i) {
		cin >> a[i].second >> a[i].first;
	}
	while (q--) {
		int st, dr;
		cin >> st >> dr;
		vector<pair<int, int>> tibi(1);
		for (int i = st; i <= dr; ++i) {
			tibi.push_back(a[i]);
		}
		sort(tibi.begin() + 1, tibi.end());
		long long sum = 0;
		int m = tibi.size() - 1;
		bool ok = true;
		for (int i = 1; i <= m; ++i) {
			sum += tibi[i].second;
			if (sum >= tibi[i].first) {
				ok = false;
				break;
			}
		}
		cout << ok << '\n';
	}
}

• Subtask 1: 15 / 15
• Subtask 2: 25 / 25
• Subtask 3: 15 / 15
• Subtask 4: 0 / 45