# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
924233 |
2024-02-08T16:44:42 Z |
Camillus |
Brperm (RMI20_brperm) |
C++17 |
|
3000 ms |
1984 KB |
#define debug(...) 42
#include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#include "brperm.h"
#else
void init(int n, const char s[]);
int query(int i, int k);
#endif
int n;
string s;
void init(int N, const char S[]) {
n = N;
s = string(S, S + N);
}
int swapped(int poz, int put) {
int a = 0;
for (int i = 0;i < put;i++) {
a = (a<<1) + (poz&1);
poz = (poz>>1);
}
return a;
}
int query(int i, int k) {
if (i + (1 << k) > n) {
return 0;
}
if (k < 2) {
return 1;
}
for (int j = 0; j < (1 << k); j++) {
if (s[i + j] != s[i + swapped(j, k)]) {
return 0;
}
}
return 1;
}
#ifdef LOCAL
char __s[(int)5e5 + 10] = {};
int main() {
cin >> __s;
init(strlen(__s), __s);
int __x, __y;
while (cin >> __x >> __y)
cout << query(__x, __y) << '\n';
return 0;
}
#endif
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
17 ms |
1676 KB |
Output is correct |
4 |
Correct |
17 ms |
1628 KB |
Output is correct |
5 |
Correct |
17 ms |
1620 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3038 ms |
1984 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
17 ms |
1676 KB |
Output is correct |
4 |
Correct |
17 ms |
1628 KB |
Output is correct |
5 |
Correct |
17 ms |
1620 KB |
Output is correct |
6 |
Execution timed out |
3038 ms |
1984 KB |
Time limit exceeded |
7 |
Halted |
0 ms |
0 KB |
- |