# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
577307 | Mher777 | Fountain (eJOI20_fountain) | C++14 | 1567 ms | 3544 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 <iostream>
#include <vector>
#include <array>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <string>
using namespace std;
typedef int itn;
typedef long long ll;
#define MAXL 1e18 + 9
#define MAX 1e9 + 9
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mii map<int,int>
#define mll map<ll,ll>
#define vi vector<int>
#define vll vector<ll>
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
// 30 points
const int N = 1e5 + 10;
int go[N], pref[N];
void solve() {
int n, q;
ll n1, n2;
cin >> n >> q;
vector<pair<int, pll>> v;
for (int i = 0; i < n; i++) {
cin >> n1 >> n2;
v.pub({ i + 1, { n1, n2 } });
}
v.pub({ 0, { MAXL, MAXL } });
ll sum;
if (true) {
for (int i = 0; i < v.size(); i++) {
for (int j = i + 1; j < v.size(); j++) {
if (v[j].ss.ff > v[i].ss.ff) {
go[v[i].ff] = v[j].ff;
break;
}
}
}
while (q--) {
cin >> n1 >> n2;
sum = 0;
while (sum < n2) {
if (sum + v[n1 - 1].ss.ss >= n2) {
cout << n1 << '\n';
break;
}
else {
sum += v[n1 - 1].ss.ss;
n1 = go[n1];
if (n1 == 0) {
cout << n1 << '\n';
break;
}
}
}
}
}
else {
}
}
int main() {
solve();
return 0;
}
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... |