提出 #41047714

---

ソースコード 拡げる

#include<bits/stdc++.h>
#pragma optimize ("g",on)
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
#pragma comment(linker, "/stack:200000000")
using namespace std;
typedef long long ll;
ll n,m,k;
int psum[2000005];
ll f(ll u,ll x){
	if(!u) return 0;
	if(u==1){
		ll ret = 0;
		for(ll i=1; i<=n; i++){
			int l = 1,r = i;
			while(l<=r){
				int mid = (l+r)>>1;
				if(psum[i] - psum[mid-1] > x) l = mid+1;
				else r = mid-1;
			}
			ret = max(ret,i-l+1);
		}
		return ret;
	}
	
	ll ret = 0;
	for(ll i=n; i<=2*n; i++){
		int l = 1,r = n;
		if(i>n) r++;
		
		while(l<=r){
			int mid = (l+r)>>1;
			if(psum[i] - psum[mid-1] > x) l = mid+1;
			else r = mid-1;
		}
		
		if(i==n){
			if(l<=n) ret = max(ret,i-l+1);
		}
		else{
			if(l<=n+1) ret = max(ret,i-l+1);
		}
	}
	return ret;
}
int main(){
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	cin>>n>>m>>k;
	string s; cin>>s;
	ll cnt = 0;
	for(int i=0; s[i]; i++) cnt+=(s[i]=='x');
	s = '1' + s + s;
	for(int i=1; s[i]; i++){
		if(s[i]=='x') psum[i] = 1;
		else psum[i] = 0;
	}
	for(int i=1; s[i]; i++) psum[i]+=psum[i-1];
	if(m<=2){
		cout<<f(m,k);
		return 0;
	}
	
	ll d = k / cnt;
	ll r = k % cnt;
	ll ans = f(m-min(d,m),r) + n*min(d,m);
	ans = max(ans,f(1,k));
	ans = max(ans,f(2,k));
	
	for(int i=0; i<10; i++){
		if(d){
			d--;
			r+=cnt;
			ans = max(ans,f(m-min(d,m),r) + n*min(d,m));
		}
		else break;
	}
	cout<<ans;
}

提出情報

コンパイルエラー

./Main.cpp:2: warning: ignoring #pragma optimize  [-Wunknown-pragmas]
    2 | #pragma optimize ("g",on)
      | 
./Main.cpp:8: warning: ignoring #pragma comment  [-Wunknown-pragmas]
    8 | #pragma comment(linker, "/stack:200000000")
      | 

ジャッジ結果