Submission #976039

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
976039	2024-05-06 05:51:06	vjudge1	Fountain (eJOI20_fountain)	C++17	100 / 100	353 ms	39784 KiB

fountain

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std; 
#define int long long 
#define fi first 
#define se second 
#define pb push_back
pair<int,int>a[100005]; 
vector<pair<int,int>>que[100005]; 
vector<int>adj[100005]; 
int ans[200005]; 
vector<int>nodes; 
vector<int>pref; 
int n, q; 
void dfs(int node){
    //cout << "here >> " << node << endl; 
    nodes.pb(node); 
    if(node == n + 1)pref.pb(0); 
    else pref.pb(pref.back() + a[node].se); 
    for(auto it : que[node]){
        int l = 1, r = pref.size() - 1, ret = -1;
        while(l <= r){
            int mid = (l+r)/2; 
            if(pref[pref.size()-1] - pref[mid-1] >= it.fi){
                ret = mid; 
                l = mid + 1; 
            }
            else{
                r = mid - 1; 
            }
        }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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