Submission #1159819

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1159819	2025-03-01 08:40:30	jmuzhen	3D Histogram (COCI20_histogram)	C++20	0 / 110	10 ms	10048 KiB

histogram

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
//GrabFood
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int N = 2e5+5, L = log2(N)+1;
constexpr bool DEBUG = 0;
vector<int> a(N), b(N);
int n;
// min st on vector b
struct ST {
  int st[N][L], lg[N]={0};
  ST(int s[]) {
    for (int i = 2; i <= n; i++) lg[i]=lg[i>>1]+1;
    for (int i = 0; i < n; i++) st[i][0] = s[i];
    
    for (int j=1; (1<<j)<=n; j++) {
      for (int i=0; i+(1<<j)-1<n; i++) {
        st[i][j] = min(st[i][j-1],st[i+(1<<(j-1))][j-1]);
      }
    }
  }
  
  int query(int l,int r) {
    int i = lg[r-l+1];
    return min(st[l][i], st[r-(1<<i)+1][i]);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 20
• Subtask 2: 0 / 90