제출 #570969

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
570969	2022-05-31 20:01:08	four_specks	비밀 (JOI14_secret)	C++17	100 / 100	456 ms	4492 KiB

secret

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 "secret.h"
#include <bits/stdc++.h>
using namespace std;
inline namespace ns
{
    template <typename T, typename Op>
    struct SRQ
    {
        explicit SRQ(const vector<T> &vec, Op _op = Op())
            : n((int)vec.size()), table(__lg(n) + 1, vector<T>(n)), op(_op)
        {
            table[0] = vec;
            for (int x = 1; x < (int)table.size(); x++)
            {
                int j = 1 << x;
                for (int i = j; i < n; i += j << 1)
                {
                    table[x][i - 1] = vec[i - 1];
                    for (int l = i - 2, r = i - j; l >= r; l--)
                        table[x][l] = op(vec[l], table[x][l + 1]);
                    table[x][i] = vec[i];
                    for (int l = i + 1, r = min(n, i + j); l < r; l++)
                        table[x][l] = op(table[x][l - 1], vec[l]);
                }
            }
        }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 100 / 100