Submission #1168650

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1168650	2025-03-17 18:08:24	rayan_bd	Sequence (APIO23_sequence)	C++20	0 / 100	687 ms	148368 KiB

sequence

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;
const double INF = 5e18;
const int mxN = 5e5+100;
#define fi first
#define se second
#define all(v) v.begin(), v.end()
vector<int> seg[mxN*4];
vector<int> ar;
void build(int node,int start,int end){
  if(start==end){
    seg[node]={ar[start]};
    return;
  }
  int mid=start+(end-start)/2;
  build(node*2+1,start,mid);
  build(node*2+2,mid+1,end);
  merge(all(seg[node*2+1]),all(seg[node*2+2]),back_inserter(seg[node]));
}
int qry(int node,int start,int end,int l,int r,int k){
  if(start>r||end<l) return 0;
  if(start>=l&&end<=r) return upper_bound(all(seg[node]),k)-seg[node].begin();
  int mid=start+(end-start)/2;
  return qry(node*2+1,start,mid,l,r,k)+qry(node*2+2,mid+1,end,l,r,k);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 11
• Subtask 2: 0 / 17
• Subtask 3: 0 / 7
• Subtask 4: 0 / 12
• Subtask 5: 0 / 13
• Subtask 6: 0 / 22
• Subtask 7: 0 / 18