# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
460834 | bigo | Fountain (eJOI20_fountain) | C++14 | 1155 ms | 524292 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
int main() {
int n, q;
cin >> n >> q;
vector<pii>vec(n);
for (int i = 0; i < n; i++) {
cin >> vec[i].first >> vec[i].second;
}
vector<vector<int>>sed(n);
for (int i = 0; i < n; i++) {
sed[i].push_back(i+1);
for (int j = i + 1; j < n; j++) {
if (vec[sed[i][sed[i].size() - 1]-1].first < vec[j].first)
sed[i].push_back(j+1);
}
}
vector<int>ans1;
while (q--) {
int r, c;
cin >> r >> c;
vector<int>tmp = sed[r - 1];
int ans = -1;
for (int i = 0; i < tmp.size(); i++) {
if ((c - vec[tmp[i]-1].second) > 0) {
c -= vec[tmp[i]-1].second;
}
else {
ans = tmp[i];
break;
}
}
if (ans == -1)
ans = 0;
ans1.push_back(ans);
}
for (int i = 0; i < ans1.size(); i++) {
cout << ans1[i] << endl;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |