oj.uz

Submission #597037

# Submission time Handle Problem Language Result Execution time Memory
597037 2022-07-15T12:10:32 Z Hacv16 Brperm (RMI20_brperm) C++17
13 / 100
 9 ms 10964 KB 
#include<bits/stdc++.h>
using namespace std;
 
#pragma GCC optimize("Ofast")
#pragma GCC target("fma,sse,sse2,sse3,avx")
#pragma GCC optimize("unroll-loops")

typedef long long ll;
typedef pair<int, int> pii;
 
const int MAX = 10001;
const int LOG = 15;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
 
#define pb push_back
#define sz(x) (int) x.size()
#define fr first
#define sc second
#define mp make_pair
#define all(x) x.begin(), x.end()
#define dbg(x) cout << #x << ": " << "[ " << x << " ]\n"
 
string s, ans[MAX][LOG];

int query(int I, int K){
    if(I + (1 << K) > sz(s)) return 0;
    return s.substr(I, (1 << K)) == ans[I][K];
}

void init(int n, const char S[]){
    for(int i = 0; i < n; i++)
        s += S[i], ans[i][0] = S[i];
 
    for(int j = 1; j < LOG; j++){
        for(int i = 0; i + (1 << j) <= n; i++){
            for(int k = 0; k < min(sz(ans[i][j - 1]), sz(ans[i + (1 << (j - 1))][j - 1])); k++){
                ans[i][j] += ans[i][j - 1][k];
                ans[i][j] += ans[i + (1 << (j - 1))][j - 1][k];
            }
        }
    }
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 6228 KB Output is correct
2 Correct 9 ms 6228 KB Output is correct

Subtask #2
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 6228 KB Output is correct
2 Correct 9 ms 6228 KB Output is correct
3 Runtime error 9 ms 10196 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 9 ms 10964 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 6228 KB Output is correct
2 Correct 9 ms 6228 KB Output is correct
3 Runtime error 9 ms 10196 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -