# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
761448 |
2023-06-19T16:29:03 Z |
lis05st |
Brperm (RMI20_brperm) |
C++17 |
|
7 ms |
2728 KB |
#include "brperm.h"
#include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <bitset>
#include <cstring>
#include <unordered_map>
using namespace std;
typedef long long ll;
ll inv(ll n, ll sz){
if(sz == 0)
return 0;
ll res = 0;
for(int i = 0; i < sz; i++){
res += ((n>>i)&1)<<(sz-i);
}
return res;
}
string a;
void init(int n, const char s[]) {
for(int i = 0; i < n; i++)
a.push_back(s[i]);
return;
}
int query(int l, int k) {
for(int i = 0; i < (1 << k); i++)
if(a[l + i] != a[l + inv(i, k)])
return 0;
return 1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
468 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
468 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
7 ms |
2728 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
468 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |