제출 #869348

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
869348	2023-11-04 06:16:04	pi61	Rabbit Carrot (LMIO19_triusis)	C++14	100 / 100	164 ms	15556 KiB

triusis

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
int n,k,a[200005], dp[200005], key[200005], tree[800020];
vector<int> b;
void update(int pos, int val, int id=1, int l=1, int r=n)
{
  if (pos < l or r < pos) return;
  if (l==r)
  {
    tree[id]=val;
    return;
  }
  int mid=(l+r)/2;
  update(pos,val,id*2,l,mid);
  update(pos,val,id*2+1,mid+1,r);
  tree[id]=min(tree[id*2],tree[id*2+1]);
}
int get(int u, int v , int id=1, int l=1, int r=n)
{
  if (r < u or v < l) return 1e18;
  if (u <= l and r <= v) return tree[id];
  int mid=(l+r)/2;
  return min(get(u,v,id*2,l,mid),get(u,v,id*2+1,mid+1,r));
}
signed main()
{
  fill(tree,tree+800010,1e18);
  cin>>n>>k;
  n+=2;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 14 / 14
• Subtask 2: 21 / 21
• Subtask 3: 28 / 28
• Subtask 4: 37 / 37