Submission #1134176

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1134176	2025-01-09 19:25:32	PagodePaiva	Flight to the Ford (BOI22_communication)	C++20	15 / 100	131 ms	6032 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;
const int N = 20010;
struct Segtree{
  int tree[4*N], lazy[4*N], lf[4*N], rf[4*N];
  int nx;
  void build(int val, int l, int r){
    memset(lazy, -1, sizeof lazy);
    memset(lf, -1, sizeof lf);
    memset(rf, -1, sizeof rf);
    tree[1] = (r-l+1);
    nx = 2;
  }
  void unlazy(int node, int l, int r){
    if(lazy[node] == -1) return;
    tree[node] = (r-l+1)*lazy[node];
    if(l != r){
      int mid = (l+r)/2;
      if(lf[node] == -1){
        lf[node] = nx;
        nx++;
        tree[lf[node]] = (mid-l+1);
      }
      if(rf[node] == -1){
        rf[node] = nx;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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