제출 #596538

#제출 시각아이디문제언어결과실행 시간메모리
596538DeepessonBrperm (RMI20_brperm)C++17
0 / 100
2 ms1364 KiB
#include <bits/stdc++.h> #define MAX 2500 void init(int n, const char s[]); int query(int i, int k); 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; } char vals[MAX]; void init(int n, const char s[]) { for(int j=0;j!=n;++j){ vals[j]=s[j]; } return; } int query(int i, int k) { int sz = 1<<k; for(int j=i;j!=i+sz;++j){ int mirror = inverte(j-i,k)+i; if(vals[mirror]!=vals[j])return 0; } return 1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...