# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
596584 | 2022-07-14T21:12:38 Z | Deepesson | Brperm (RMI20_brperm) | C++17 | 3000 ms | 52644 KB |
#include <bits/stdc++.h> #define MAX 505000 void init(int n, const char s[]); int query(int i, int k); int prefsum[MAX][26]; int inverte(int x,int k){ int ans=0; for(int i=0;i!=k;++i){ int u = (k-1)-i; if((1<<i)&x)ans+=1<<u; } return ans; } int lim; char vals[MAX]; void init(int n, const char s[]) { for(int j=0;j!=n;++j){ vals[j]=s[j]; for(int k=0;k!=26;++k){ prefsum[j+1][k]=prefsum[j][k]; } prefsum[j+1][s[j]-'a']++; } lim = n; } int query(int i, int k) { int sz = 1<<(k); if(i+sz>lim)return 0; int r=i+sz-1; int count=0; for(int j=0;j!=sz;++j){ int mirror = inverte(j,k); if(vals[mirror+i]!=vals[j+i])return 0; ++count; if(count==1000)break; } return 1; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
3 | Correct | 26 ms | 10836 KB | Output is correct |
4 | Correct | 26 ms | 10836 KB | Output is correct |
5 | Correct | 27 ms | 10836 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3067 ms | 52644 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
3 | Correct | 26 ms | 10836 KB | Output is correct |
4 | Correct | 26 ms | 10836 KB | Output is correct |
5 | Correct | 27 ms | 10836 KB | Output is correct |
6 | Execution timed out | 3067 ms | 52644 KB | Time limit exceeded |
7 | Halted | 0 ms | 0 KB | - |