Submission #703659

#TimeUsernameProblemLanguageResultExecution timeMemory
703659Chal1shkanFountain (eJOI20_fountain)C++14
30 / 100
1560 ms3908 KiB
# include <bits/stdc++.h> # define pb push_back # define ff first # define ss second # define nl "\n" # define sz(x) ((int)(x).size()) # define deb(x) cerr << #x << " = " << x << endl; # define pll pair <ll, ll> typedef long long ll; typedef unsigned long long ull; typedef long double ld; const ll maxn = 1e5 + 25; const ll inf = 2e9 + 0; const ll mod = 1e9 + 7; const ll dx[] = {-1, 1, 0, 0}; const ll dy[] = {0, 0, -1, 1}; using namespace std; ll n, q; pll p[maxn]; void ma1n (/* SABR */) { cin >> n >> q; for (ll i = 1; i <= n; ++i) { cin >> p[i].ff >> p[i].ss; } p[n + 1] = {inf, inf}; while (q--) { ll id, v; cin >> id >> v; if (v > p[id].ss) { ll last = id, ans = id; v -= p[id].ss; for (ll i = id + 1; i <= n + 1; ++i) { if (p[i].ff > p[last].ff) { if (v > p[i].ss) { v -= p[i].ss; last = i; } else { ans = i; break; } } } if (ans == n + 1) ans = 0; cout << ans << nl; } else { cout << id << nl; } } } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); // freopen("file.in", "r", stdin); // freopen("file.out", "w", stdout); int ttt = 1; // cin >> ttt; for (int test = 1; test <= ttt; ++test) { // cout << "Case " << test << ":" << ' '; ma1n(); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...