Submission #140673

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
140673	2019-08-04 11:57:39	khrbuddy03	XCorr (KOI18_XCorr)	C++14	100 / 100	393 ms	37308 KiB

XCorr

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;
using lint = long long;
const int inf = (int)1e9 + 9;
const int siz = (int)3e5 + 9;
struct seg {
    lint tree[siz * 4];
    lint query(int left, int right, int node, int low, int high) {
        if (right < low || high < left) return 0LL;
        if (left <= low && high <= right) return tree[node] * 1LL;
        int mid = (low + high) / 2;
        return query(left, right, node * 2, low, mid) * 1LL + query(left, right, node * 2 + 1, mid + 1, high);
    }
    void update(int idx, int val, int node, int low, int high) {
        if (idx < low || high < idx) return;
        if (low == high) tree[node] = val * 1LL;
        else {
            int mid = (low + high) / 2;
            update(idx, val, node * 2, low, mid);
            update(idx, val, node * 2 + 1, mid + 1, high);
            tree[node] = tree[node * 2] * 1LL + tree[node * 2 + 1] * 1LL;
        }
    }
} seg;
map<int, int> X;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 19 / 19
• Subtask 2: 42 / 42
• Subtask 3: 39 / 39