# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1070207 |
2024-08-22T12:16:16 Z |
AdamGS |
Brperm (RMI20_brperm) |
C++17 |
|
3000 ms |
2168 KB |
#include "brperm.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=5e5+7;
char T[LIM];
void init(int n, const char s[]) {
rep(i, n) T[i]=s[i];
}
int odw(int x, int k) {
int y=0;
rep(i, k) if(x&(1<<i)) y+=1<<(k-i-1);
return y;
}
int query(int i, int k) {
rep(j, 1<<k) if(T[i+j]!=T[i+odw(j, k)]) return 0;
return 1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
14 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
14 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3037 ms |
2168 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
14 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |