Submission #758503

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
758503	2023-06-14 17:32:22	rainboy	Sequence (APIO23_sequence)	C++17	100 / 100	698 ms	36752 KiB

sequence

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 "sequence.h"
#include <vector>
using namespace std;
typedef vector<int> vi;
const int N = 500000, N_ = 1 << 19; /* N_ = pow2(ceil(log2(N + 1))) */
unsigned int X = 12345;
int rand_() {
  return (X *= 3) >> 1;
}
int aa[N], ii[N], pp[N], qq[N], n;
int ss1[N_ * 2], pp1[N_ * 2], qq1[N_ * 2], ss2[N_ * 2], pp2[N_ * 2], qq2[N_ * 2], n_;
void pul(int *ss, int *pp, int *qq, int i) {
  int l = i << 1, r = l | 1;
  ss[i] = ss[l] + ss[r];
  pp[i] = max(pp[l], ss[l] + pp[r]);
  qq[i] = max(qq[l] + ss[r], qq[r]);
}
void build(int *ss, int *pp, int *qq, int x) {
  for (int i = 0; i < n_; i++)
    ss[n_ + i] = i < n ? x : 0, pp[n_ + i] = qq[n_ + i] = max(ss[n_ + i], 0);
  for (int i = n_ - 1; i > 0; i--)
    pul(ss, pp, qq, i);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 11 / 11
• Subtask 2: 17 / 17
• Subtask 3: 7 / 7
• Subtask 4: 12 / 12
• Subtask 5: 13 / 13
• Subtask 6: 22 / 22
• Subtask 7: 18 / 18