Submission #1136064

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1136064	2025-01-14 17:30:32	duckindog	Progression (NOI20_progression)	C++17	24 / 100	3098 ms	57260 KiB

Progression

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
const int N = 300'000 + 10;
int n, q;
int d[N];
const int null = -1'000'000'000'000;
namespace IT1 { 
  int f[N << 2], asnLazy[N << 2], addLazy[N << 2];
  void push(int s, int l, int r) { 
    int mid = (l + r) >> 1;
    if (asnLazy[s] != null) { 
      f[s << 1] = (mid - l + 1) * asnLazy[s];   
      f[s << 1 | 1] = (r - mid) * asnLazy[s];
      asnLazy[s << 1] = asnLazy[s << 1 | 1] = asnLazy[s];
      addLazy[s << 1] = addLazy[s << 1 | 1] = 0;
      asnLazy[s] = null;
    }
    if (addLazy[s]) { 
      f[s << 1] += (mid - l + 1) * addLazy[s];
      f[s << 1 | 1] += (r - mid) * addLazy[s];
      addLazy[s << 1] += addLazy[s];  addLazy[s << 1 | 1] += addLazy[s];
      addLazy[s] = 0;
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 9 / 9
• Subtask 2: 15 / 15
• Subtask 3: 0 / 35
• Subtask 4: 0 / 11
• Subtask 5: 0 / 13
• Subtask 6: 0 / 17