oj.uz

답안 #624531

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
624531 2022-08-08T12:24:56 Z Blagoj Fountain (eJOI20_fountain) C++14
0 / 100
 88 ms 6932 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
bool visited[100002];
int belong[100002];
pair<ll, ll> f[100002];
vector<pair<int, ll>> v[100002];
int main()
{
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);
    int n, q;
    cin >> n >> q;
    for (int i = 1; i <= n; i++)
    {
        cin >> f[i].first >> f[i].second;
    }
    int counter = 1;
    for (int i = 1; i <= n; i++)
    {
        if (visited[i])
        {
            continue;
        }
        int place = i, liquid = 0;
        v[counter].push_back({place, 0});
        belong[place] = counter;
        liquid += f[place].second;
        bool possible = true;
        while (possible)
        {
            possible = false;
            for (int j = place; j <= n; j++)
            {
                if (f[j].first > f[place].first)
                {
                    belong[j] = counter;
                    visited[j] = true;
                    possible = true;
                    place = j;
                    v[counter].push_back({j, liquid + 1});
                    liquid += f[j].second;
                    break;
                }
            }
        }
        v[counter].push_back({0, liquid + 1});
        counter++;
    }
    int start, hold;
    for (int i = 0; i < q; i++)
    {
        cin >> start >> hold;
        int moves = 2, sz = v[belong[start]].size(), minus;
        int l = 0, r = sz;
        if (v[belong[start]][0].first != start)
        {
            while (l + 1 < r)
            {
                int mid = (l + r) / 2;
                if (v[belong[start]][mid].first == start)
                {
                    l = mid;
                    break;
                }
                if (v[belong[start]][mid].first > start)
                {
                    r = mid;
                }
                if (v[belong[start]][mid].first < start)
                {
                    l = mid;
                }
            }
        }
        minus = v[belong[start]][l].second - 1;
        for (int j = 0; (1 << j) <= sz; j++)
        {
            moves++;
        }
        while (moves--)
        {
            if (l + r < sz)
            {
                if (hold >= v[belong[start]][l + r].second - minus)
                {
                    l += r;
                }
            }
            r = max(r / 2, 1);
        }
        cout << v[belong[start]][l].first << "\n";
    }
}

Subtask #1
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 88 ms 6932 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -