Submission #691728

#	Time	Username	Problem	Language	Result	Execution time	Memory
691728		Nelt	Fountain (eJOI20_fountain)	C++17	0 / 100	66 ms	3256 KiB

fountain

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
// #include "cave.h"
/* DEFINES */
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define sync                      \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

void solve()
{
    ll n, q;
    cin >> n >> q;
    pp(ll, ll) a[n];
    for (auto &i : a)
        cin >> i.F >> i.S;
    ll pref[n + 1];
    pref[0] = a[0].S;
    for (ll i = 1; i < n; i++)
        pref[i] = pref[i - 1] + a[i].S;
    pref[n] = 1e15;
    while (q--)
    {
        ll x, s;
        cin >> x >> s;
        ll ind = lower_bound(all(pref), s + pref[x - 1]) - pref;
        cout << (ind == n ? 0 : ind + 1) << endl;
    }
}
/*

*/
int main()
{
    sync
        // precomp();
        ll t = 1;
    // cin >> t;
    for (ll i = 1; i <= t; i++)
        // cout << "Case #" << i << ": ",
        solve();
    cerr << "\nTime elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
}

• Subtask 1: 0 / 30
• Subtask 2: 0 / 30
• Subtask 3: 0 / 40