#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MAX = 1015;
const int LOG = 25;
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];
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; (1 << j) < n; j++){
for(int i = 0; i + (1 << j) < n; i++){
//ans[i][j] = ans[i][j - 1];
for(int k = 0; k < sz(ans[i][j - 1]); k++){
ans[i][j] += ans[i][j - 1][k];
ans[i][j] += ans[i + (1 << (j - 1))][j - 1][k];
}
}
}
}
int query(int I, int K){
string aux = s.substr(I, (1 << K));
return aux == ans[I][K];
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
6 ms |
2460 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
6 ms |
2460 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
3 ms |
3088 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
6 ms |
2460 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |