Submission #549298

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
549298	2022-04-15 14:57:10	brunnorezendes	Arranging Tickets (JOI17_arranging_tickets)	C++17	0 / 100	1 ms	1192 KiB

arranging_tickets

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>
#define maxn 200000
#define s second
#define f first
using namespace std;
typedef pair<int,int> ii;
typedef vector <ii> vii;
typedef vector <int> vi;
int seg[4*maxn], lazy[4*maxn];
void unlazy(int u){
  seg[u]+=lazy[u];
  lazy[(2*u)] += lazy[u];
  lazy[(2*u)+1] += lazy[u];
  lazy[u]=0;
}
void update(int u, int l, int r, int ql, int qr, int c){
  int mid;
  mid = (l+r)/2;
  unlazy(u);
  if(ql>r || qr<l) mid=0;
  else{
    if(l>=ql && r<=qr) lazy[u]+=c;
    else{
      update(2*u, l, mid, ql, qr, c);
      update((2*u)+1, mid+1, r, ql, qr, c);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 10
• Subtask 2: 0 / 35
• Subtask 3: 0 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 15