제출 #743500

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
743500	2023-05-17 12:43:06	emptypringlescan	Two Currencies (JOI23_currencies)	C++17	100 / 100	1138 ms	469160 KiB

currencies

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;
struct node{
  long long val,cnt;
  node *l, *r;
  node(long long V, long long C){
    val=V;
    cnt=C;
    l=r=NULL;
  }
  node(node* le, node* ri){
    l=le;
    r=ri;
    val=l->val+r->val;
    cnt=l->cnt+r->cnt;
  }
};
void prop(node* nd){
  if(nd->l==NULL){
    nd->r=new node(0LL,0LL);
    nd->l=new node(0LL,0LL);
  }
}
node* update(node* lol, int s, int e, int x){
  if(s==e) return new node(lol->val+s,lol->cnt+1);
  int mid=(s+e)/2;
  prop(lol);
  if(x<=mid) return new node(update(lol->l,s,mid,x),lol->r);
  else return new node(lol->l,update(lol->r,mid+1,e,x));
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 28 / 28
• Subtask 3: 30 / 30
• Subtask 4: 32 / 32