oj.uz

Submission #641925

# Submission time Handle Problem Language Result Execution time Memory
641925 2022-09-17T22:26:27 Z ivaziva Fountain (eJOI20_fountain) C++14
0 / 100
 273 ms 10640 KB 
#include <bits/stdc++.h>

using namespace std;

#define MAXN 100010

vector<long long> adj[MAXN];
bool pos[MAXN];
long long d[MAXN],c[MAXN];
long long n,q;
long long br;

void dfs(long long node,long long vv)
{
    pos[node]=true;
    vv=-c[node];

    if (vv<=0)
    {
        br=node;
        return;
    }

    long long s=adj[node].size();

    for (long long i=0;i<s;i++)
    {
        long long sled=adj[node][i];

        if (pos[sled]==false) dfs(sled,vv);
    }
}

int main()
{
    cin>>n>>q;

    for (long long i=1;i<=n;i++) cin>>d[i]>>c[i];

    for (long long i=1;i<n;i++) adj[i].push_back(i+1);

    for (long long i=1;i<=q;i++)
    {
        long long r,v;
        cin>>r>>v;

        br=0;

        dfs(r,v);

        cout<<br<<endl;
    }
}

Subtask #1
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 273 ms 10640 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -