oj.uz

답안 #596710

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
596710 2022-07-15T01:44:47 Z Hacv16 Brperm (RMI20_brperm) C++17
13 / 100
 797 ms 262144 KB 
#include<bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef pair<int, int> pii;
 
const int MAX = 100010;
const int LOG = 18;
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];
 
map<pii, string> memo;

int query(int I, int K){
    string aux;

    if(memo.find({I, K}) != memo.end()) aux = memo[{I, K}];
    else memo[{I, K}] = aux = s.substr(I, (1 << K));

    return aux == 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];
            }

            //cout << ans[i][j] << '\n';
        }
    }
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 58160 KB Output is correct
2 Correct 34 ms 58188 KB Output is correct

Subtask #2
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 58160 KB Output is correct
2 Correct 34 ms 58188 KB Output is correct
3 Runtime error 797 ms 262144 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 81 ms 116880 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 58160 KB Output is correct
2 Correct 34 ms 58188 KB Output is correct
3 Runtime error 797 ms 262144 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -