Submission #463310

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
463310	2021-08-11 03:53:13	amunduzbaev	Fountain (eJOI20_fountain)	C++14	100 / 100	479 ms	40084 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
void solve(){
  int n, q; cin>>n>>q;
  vector<array<int, 20>> par(n),  sum(n);
  vector<array<int, 2>> a(n), ss;
  for(int i=0;i<n;i++) cin>>a[i][0]>>a[i][1], par[i][0] = i, sum[i][0] = 0;
  
  ss.push_back({(int)(1e9+1), n});
  for(int i=n-1;~i;i--){
    while(ss.back()[0] <= a[i][0]) ss.pop_back();
    par[i][1] = ss.back()[1];
    sum[i][1] = a[i][1];
    ss.push_back({a[i][0], i});
  }
  for(int j=2;j<20;j++){
    for(int i=0;i<n;i++){
      if(par[i][j-1] < n) par[i][j] = par[par[i][j-1]][j-1];
      else par[i][j] = n;
    }
  }
  
  //~ for(int i=0;i<n;i++) cout<<sum[i][0]<<" ";
  //~ cout<<"\n";
  //~ for(int i=0;i<n;i++) cout<<sum[i][1]<<" ";
  //~ cout<<"\n";
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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