제출 #1134154

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
1134154	2025-01-09 18:11:39	PagodePaiva	Flight to the Ford (BOI22_communication)	C++20	15 / 100	152 ms	31088 KiB

communication

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>
#include"communication.h"
#define recieve receive
using namespace std;
struct Node{
  Node *lf, *rf;
  int val, lz;
  Node(int v, int ll, int rr){
    val = (rr-ll+1)*v;
    lz = -1;
    lf = rf = NULL;
  }
  void unlazy(int l, int r){
    if(lz==-1) return;
    val = lz*(r-l+1);
    if(l != r){
      int mid = (l+r)/2;
      if(!lf) lf = new Node(1, l, mid);
      if(!rf) rf = new Node(1, mid+1, r);
      lf->lz = lz;
      rf->lz = lz;
    }
    lz = -1;
  }
  void update(int l, int r, int tl, int tr, int v){
    unlazy(tl, tr);
    if(l > tr or tl > r) return;
    if(l <= tl and tr <= r){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 15 / 15
• Subtask 2: 0 / 85