Please sign in first.
Submission #33602655
Source Code Expand
//Was yea ra,rra yea ra synk sphilar yor en me exec hymme METAFALICA waath!
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
using namespace std;
#define rg register
#define ll long long
#define ull unsigned ll
#define lowbit(x) (x&(-x))
#define djq 1000000007
const double eps=1e-8;
const short sint=0x3f3f;
const int inf=0x3f3f3f3f;
const ll linf=0x3f3f3f3f3f3f3f3f;
const double alpha=0.73;
inline void file(){
freopen("mayuri.in","r",stdin);
freopen("mayuri.out","w",stdout);
}
char buf[1<<21],*p1=buf,*p2=buf;
inline int getc(){
return p1==p2&&(p2=(p1=buf)+fread(buf,1,(1<<20)+5,stdin),p1==p2)?EOF:*p1++;
}
#define getc getchar
inline ll read(){
rg ll ret=0,f=0;char ch=getc();
while(!isdigit(ch)){if(ch==EOF)exit(0);if(ch=='-')f=1;ch=getc();}
while(isdigit(ch)){ret=ret*10+ch-48;ch=getc();}
return f?-ret:ret;
}
#define epb emplace_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define it iterator
#define mkp make_pair
#define naive return 0*puts("correct")
#define angry return 0*puts("incorrect")
#define fls fflush(stdout)
#define rep(i,a) for(rg int i=1;i<=a;++i)
#define per(i,a) for(rg int i=a;i;--i)
#define rep0(i,a) for(rg int i=0;i<=a;++i)
#define per0(i,a) for(rg int i=a;~i;--i)
typedef vector<int> vec;
typedef pair<int,int> pii;
struct point{ int x,y; point(int x=0,int y=0):x(x),y(y) {} inline bool operator<(const point& T)const{ return x^T.x?x<T.x:y<T.y; }; };
inline int ksm(int base,int p){int ret=1;while(p){if(p&1)ret=1ll*ret*base%djq;base=1ll*base*base%djq,p>>=1;}return ret;}
inline void pls(int& x,const int k){ x=(x+k>=djq?x+k-djq:x+k); }
inline int add(const int a,const int b){ return a+b>=djq?a+b-djq:a+b; }
inline void sub(int& x,const int k){ x=(x-k<0?x-k+djq:x-k); }
inline void ckmn(int& x,const int k){ x=(k<x?k:x); }
inline void ckmx(int& x,const int k){ x=(k>x?k:x); }
int n,k;
string s,rs,ans;
signed mian(){
n=read(),k=read(); k=(1<<min(k-1,15));
cin>>s; rs=s; reverse(all(rs)); s=s+rs;
ans=string(n,'z');
rep0(i,n) ans=min(ans,s.substr(i,n));
int len=1;
while(len<n&&ans[len]==ans[len-1]) ++len;
k=min(n,len*k);
for(rg int i=0;i<k;++i) printf("%c",ans[0]);
for(rg int i=0;i<n-k;++i) printf("%c",ans[i+len]);
puts("");
return 0;
}
signed main(){
int _=1;
while(_--) mian();
return 0;
}
/*
*/
Submission Info
| Submission Time | |
|---|---|
| Task | E - Reversing and Concatenating |
| User | luogu_bot4 |
| Language | C++ (GCC 9.2.1) |
| Score | 1300 |
| Code Size | 2512 Byte |
| Status | AC |
| Exec Time | 9 ms |
| Memory | 3636 KiB |
Compile Error
./Main.cpp: In function ‘long long int read()’:
./Main.cpp:27:8: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
27 | rg ll ret=0,f=0;char ch=getc();
| ^~~
./Main.cpp:27:14: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
27 | rg ll ret=0,f=0;char ch=getc();
| ^
./Main.cpp: In function ‘int mian()’:
./Main.cpp:61:7: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
61 | rep0(i,n) ans=min(ans,s.substr(i,n));
| ^
./Main.cpp:43:30: note: in definition of macro ‘rep0’
43 | #define rep0(i,a) for(rg int i=0;i<=a;++i)
| ^
./Main.cpp:65:13: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
65 | for(rg int i=0;i<k;++i) printf("%c",ans[0]);
| ^
./Main.cpp:66:13: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
66 | for(rg int i=0;i<n-k;++i) printf("%c",ans[i+len]);
| ^
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 1300 / 1300 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | sample01.txt, sample02.txt |
| All | sample01.txt, sample02.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in56.txt, in57.txt, in58.txt, in59.txt, in60.txt, in61.txt, in62.txt, in63.txt, in64.txt, in65.txt, in66.txt, in67.txt, in68.txt, in69.txt, in70.txt, in71.txt, in72.txt, sample01.txt, sample02.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| in01.txt | AC | 9 ms | 3556 KiB |
| in02.txt | AC | 3 ms | 3588 KiB |
| in03.txt | AC | 3 ms | 3504 KiB |
| in04.txt | AC | 4 ms | 3592 KiB |
| in05.txt | AC | 4 ms | 3544 KiB |
| in06.txt | AC | 3 ms | 3528 KiB |
| in07.txt | AC | 3 ms | 3608 KiB |
| in08.txt | AC | 4 ms | 3548 KiB |
| in09.txt | AC | 3 ms | 3488 KiB |
| in10.txt | AC | 8 ms | 3612 KiB |
| in11.txt | AC | 3 ms | 3576 KiB |
| in12.txt | AC | 3 ms | 3596 KiB |
| in13.txt | AC | 4 ms | 3512 KiB |
| in14.txt | AC | 4 ms | 3548 KiB |
| in15.txt | AC | 4 ms | 3568 KiB |
| in16.txt | AC | 3 ms | 3556 KiB |
| in17.txt | AC | 3 ms | 3556 KiB |
| in18.txt | AC | 5 ms | 3556 KiB |
| in19.txt | AC | 5 ms | 3544 KiB |
| in20.txt | AC | 5 ms | 3476 KiB |
| in21.txt | AC | 3 ms | 3532 KiB |
| in22.txt | AC | 3 ms | 3596 KiB |
| in23.txt | AC | 4 ms | 3608 KiB |
| in24.txt | AC | 3 ms | 3512 KiB |
| in25.txt | AC | 5 ms | 3636 KiB |
| in26.txt | AC | 4 ms | 3492 KiB |
| in27.txt | AC | 4 ms | 3548 KiB |
| in28.txt | AC | 3 ms | 3512 KiB |
| in29.txt | AC | 3 ms | 3548 KiB |
| in30.txt | AC | 3 ms | 3544 KiB |
| in31.txt | AC | 3 ms | 3632 KiB |
| in32.txt | AC | 3 ms | 3512 KiB |
| in33.txt | AC | 3 ms | 3532 KiB |
| in34.txt | AC | 3 ms | 3552 KiB |
| in35.txt | AC | 3 ms | 3596 KiB |
| in36.txt | AC | 3 ms | 3632 KiB |
| in37.txt | AC | 3 ms | 3552 KiB |
| in38.txt | AC | 3 ms | 3548 KiB |
| in39.txt | AC | 3 ms | 3572 KiB |
| in40.txt | AC | 4 ms | 3612 KiB |
| in41.txt | AC | 8 ms | 3556 KiB |
| in42.txt | AC | 3 ms | 3476 KiB |
| in43.txt | AC | 3 ms | 3552 KiB |
| in44.txt | AC | 4 ms | 3632 KiB |
| in45.txt | AC | 4 ms | 3508 KiB |
| in46.txt | AC | 4 ms | 3636 KiB |
| in47.txt | AC | 4 ms | 3632 KiB |
| in48.txt | AC | 3 ms | 3472 KiB |
| in49.txt | AC | 4 ms | 3552 KiB |
| in50.txt | AC | 3 ms | 3536 KiB |
| in51.txt | AC | 4 ms | 3548 KiB |
| in52.txt | AC | 3 ms | 3596 KiB |
| in53.txt | AC | 4 ms | 3512 KiB |
| in54.txt | AC | 5 ms | 3472 KiB |
| in55.txt | AC | 5 ms | 3612 KiB |
| in56.txt | AC | 3 ms | 3596 KiB |
| in57.txt | AC | 4 ms | 3592 KiB |
| in58.txt | AC | 3 ms | 3588 KiB |
| in59.txt | AC | 3 ms | 3544 KiB |
| in60.txt | AC | 3 ms | 3528 KiB |
| in61.txt | AC | 4 ms | 3592 KiB |
| in62.txt | AC | 3 ms | 3596 KiB |
| in63.txt | AC | 4 ms | 3636 KiB |
| in64.txt | AC | 3 ms | 3600 KiB |
| in65.txt | AC | 2 ms | 3556 KiB |
| in66.txt | AC | 3 ms | 3508 KiB |
| in67.txt | AC | 4 ms | 3596 KiB |
| in68.txt | AC | 4 ms | 3492 KiB |
| in69.txt | AC | 3 ms | 3592 KiB |
| in70.txt | AC | 4 ms | 3592 KiB |
| in71.txt | AC | 3 ms | 3488 KiB |
| in72.txt | AC | 6 ms | 3596 KiB |
| sample01.txt | AC | 2 ms | 3580 KiB |
| sample02.txt | AC | 4 ms | 3548 KiB |