Submission #795024

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
795024	2023-07-27 05:21:06	PoonYaPat	Sjeckanje (COCI21_sjeckanje)	C++14	110 / 110	977 ms	45880 KiB

Main

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;
typedef long long ll;
ll s[1<<19][3][3],c[200005],lz[1<<19];
int n,q;
void merge(int a, int b, int res) {
    for (int i=0; i<3; ++i) {
        for (int j=0; j<3; ++j) {
            s[res][i][j]=-1e15;
            for (int k=0; k<3; ++k) s[res][i][j]=max(s[res][i][j],s[a][i][k]+s[b][2-k][j]);
            if (i!=1) s[res][i][j]=max(s[res][i][j],s[b][i][j]);
            if (j!=1) s[res][i][j]=max(s[res][i][j],s[a][i][j]);
        }
    }
}
void push(int l, int r, int idx) {
    if (lz[idx]==-1e16) return;
    if (l!=r) {
        for (int i=0; i<3; ++i) {
            for (int j=0; j<3; ++j) {
                if (i==0) s[idx][i][j]-=lz[idx];
                if (i==2) s[idx][i][j]+=lz[idx];
                if (j==0) s[idx][i][j]-=lz[idx];
                if (j==2) s[idx][i][j]+=lz[idx];
            }
        }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 15 / 15
• Subtask 2: 40 / 40
• Subtask 3: 55 / 55