Submission #41045181

---

Source Code Expand

//This code is written by hmz,and hmz is cute!!!
#include<bits/stdc++.h>
using namespace std;
#define TY long long
#define umap unordered_map
#define ull unsigned long long
#define pq priority_queue
#define mp make_pair
#define mod (TY)(1e9+7)
#define MAXN 600005
#define MAXM 600005
#define MAXK 27
#define INF (TY)1e9
#define Birthday 20090321
#define Read(name) freopen(#name,"r",stdin);
#define Write(name) freopen(#name,"w",stdout);
#define For(i,a,b) for(TY i=(a);i<=(b);++i)
#define FOR(i,a,b) for(TY i=(a);i<(b);++i)
#define Rof(i,a,b) for(TY i=(a);i>=(b);--i)
#define ROF(i,a,b) for(TY i=(a);i>(b);--i)
inline TY qr(){
	TY x=0,f=1;char op=getchar();
	for(;op<'0'||op>'9';op=getchar())if(op=='-')f=-1;
	for(;op>='0'&&op<='9';op=getchar())x=x*10+(op^48);
	return x*f;
}inline bool ischar(char op){
	if(op=='o'||op=='x')return true;
	return false;
}inline char getc(){
	char op=getchar();
	while(!ischar(op))op=getchar();
	return op;
}inline string qs(){
	string op="";char u=getchar();
	while(!ischar(u))u=getchar();
	while(ischar(u))op+=u,u=getchar();
	return op;
}inline void qw(TY x){
	if(!x){putchar('0');return;}
	if(x<0)putchar('-'),x=-x;
	if(x>=10)qw(x/10);putchar(x%10+'0');
}inline void qw(TY x,char op){qw(x),putchar(op);}
inline void ws(string s){FOR(i,0,s.size())putchar(s[i]);}
inline TY Ceil(TY a,TY b){return a/b+(a%b!=0);}
inline TY Mod(TY a){return (a>=mod?a-mod:a);}
inline TY Abs(TY a,TY b){return a>b?a-b:b-a;}
inline TY Pow(TY a,TY b){
	TY ans=1,base=a;
	while(b){
		if(b&1)ans=ans*base%mod;
		base=base*base%mod;b>>=1;
	}return ans;
}TY n,m,k,ans,a[MAXN],b[MAXN];string s;
inline TY check(TY now){
	TY sum=0;For(i,0,min(n,now))sum=max(sum,a[i]+b[now-i]);
	return sum;
}int main(){
	n=qr();m=qr();k=qr();
	s=qs();TY cnt=0;
	FOR(i,0,s.size())cnt+=s[i]=='x';
	TY need=k/cnt;if(need==m){qw(n*m);return 0;}
	TY c=0;FOR(i,0,s.size()){
		if(s[i]=='x')++c,a[c-1]=i;
	}c=0;Rof(i,s.size()-1,0){
		if(s[i]=='x')++c,b[c-1]=s.size()-1-i;
	}a[cnt]=b[cnt]=n;
	if(need==m-1)ans=max(ans,need*n+max(a[k%cnt],b[k%cnt]));
	else ans=max(ans,need*n+check(k%cnt));
	if(need)ans=max(ans,(need-1)*n+check(k%cnt+cnt));
	else{
		For(i,k,cnt){
			if(i==k)ans=max(ans,a[i]);
			else ans=max(ans,a[i]-a[i-k-1]-1);
		}
	}qw(ans);
    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘void qw(long long int)’:
./Main.cpp:41:2: warning: this ‘if’ clause does not guard... [-Wmisleading-indentation]
   41 |  if(x>=10)qw(x/10);putchar(x%10+'0');
      |  ^~
./Main.cpp:41:20: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘if’
   41 |  if(x>=10)qw(x/10);putchar(x%10+'0');
      |                    ^~~~~~~
./Main.cpp: In function ‘void ws(std::string)’:
./Main.cpp:18:34: warning: comparison of integer expressions of different signedness: ‘long long int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   18 | #define FOR(i,a,b) for(TY i=(a);i<(b);++i)
      |                                  ^
./Main.cpp:43:26: note: in expansion of macro ‘FOR’
   43 | inline void ws(string s){FOR(i,0,s.size())putchar(s[i]);}
      |                          ^~~
./Main.cpp: In function ‘int main()’:
./Main.cpp:18:34: warning: comparison of integer expressions of different signedness: ‘long long int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   18 | #define FOR(i,a,b) for(TY i=(a);i<(b);++i)
      |                                  ^
./Main.cpp:60:2: note: in expansion of macro ‘FOR’
   60 |  FOR(i,0,s.size())cnt+=s[i]=='x';
      |  ^~~
./Main.cpp:18:34: warning: comparison of integer expressions of different signedness: ‘long long int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   18 | #define FOR(i,a,b) for(TY i=(a);i<(b);++i)
      |                                  ^
./Main.cpp:62:9: note: in expansion of macro ‘FOR’
   62 |  TY c=0;FOR(i,0,s.size()){
      |         ^~~

Judge Result