提出 #44116365

---

ソースコード 拡げる

/*  
  hmz is cute!
--------------------------------------------
  You've got to have faith
  Don't let them cut you down cut you down once more
*/
#include<bits/stdc++.h>
using namespace std;
#define TY long long
#define IL inline
#define umap unordered_map
#define ull unsigned long long
#define pq priority_queue
#define mp make_pair
#define pb push_back
#define mod (TY)(1e9+7)
#define MAXN 500005
#define MAXM 200005
#define MAXK 27
#define INF (TY)(1e9)
#define block 300
#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)
IL 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;
}IL bool ischar(char op){
	if(op>='a'&&op<='z')return true;
	if(op>='A'&&op<='Z')return true;
	return false;
}IL char getc(){
	char op=getchar();
	while(!ischar(op))op=getchar();
	return op;
}IL string qs(){
	string op="";char u=getchar();
	while(!ischar(u))u=getchar();
	while(ischar(u))op+=u,u=getchar();
	return op;
}IL 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');
}IL void qw(TY x,char op){qw(x),putchar(op);}
IL void ws(string s){FOR(i,0,s.size())putchar(s[i]);}
IL TY Ceil(TY a,TY b){return a/b+(a%b!=0);}
IL TY Mod(TY a){return (a>=mod?a-mod:a);}
IL TY Abs(TY a,TY b){return a>b?a-b:b-a;}
IL 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,Ans,val[MAXN],st[MAXN][20],Log[MAXN],pre[MAXN],have[MAXN],bst[MAXN][20];
set<TY> lst[MAXN],id;
IL TY query(TY x,TY y){
	TY k=Log[y-x+1];
	return min(st[x][k],st[y-(1ll<<k)+1][k]);
}IL bool Query(TY x,TY y){
	TY k=Log[y-x+1];
	return (bst[x][k]&bst[y-(1ll<<k)+1][k]);
}IL void del(TY l,TY r){
	set<TY>::iterator itl=id.lower_bound(l),itr=id.upper_bound(r);
	for(set<TY>::iterator it=itl;it!=itr;++it)lst[val[*it]].erase(*it);
	id.erase(itl,itr);
}
int main(){
    //freopen(".in","r",stdin);
    //freopen(".out","w",stdout);
	For(i,2,500000)Log[i]=Log[i/2]+1;
    /* init */
	n=qr();For(i,1,n)val[i]=qr();
	For(i,1,n){
		bool ok=0;
		if(val[i]==1)pre[i]=i,ok=1;
		else{
			if(lst[val[i]-1].empty())pre[i]=-1;
			else pre[i]=*--lst[val[i]-1].end(),del(pre[i],i-1),ok=1;
		}if(ok)lst[val[i]].insert(i);id.insert(i);
	}For(i,1,n)st[i][0]=pre[i];
	For(j,1,19)for(TY i=1;i+(1ll<<j)-1<=n;++i)st[i][j]=min(st[i][j-1],st[i+(1ll<<j-1)][j-1]);
	For(i,1,n)have[i]=(val[i]==1||(pre[i]!=-1&&query(pre[i]+1,i)>=pre[i])),bst[i][0]=have[i];
	For(j,1,19)for(TY i=1;i+(1ll<<j)-1<=n;++i)bst[i][j]=(bst[i][j-1]&bst[i+(1ll<<j-1)][j-1]);
	For(i,1,n){
		TY l=i,r=n,ans=i-1;
		while(l<=r){
			TY mid=(l+r)>>1;
			if(Query(i,mid)&&query(i,mid)>=i)l=mid+1,ans=mid;
			else r=mid-1;
		}Ans+=ans-i+1;
	}qw(Ans);
    return 0;
}

提出情報

コンパイルエラー

./Main.cpp: In function ‘void qw(long long int)’:
./Main.cpp:47:2: warning: this ‘if’ clause does not guard... [-Wmisleading-indentation]
   47 |  if(x>=10)qw(x/10);putchar(x%10+'0');
      |  ^~
./Main.cpp:47:20: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘if’
   47 |  if(x>=10)qw(x/10);putchar(x%10+'0');
      |                    ^~~~~~~
./Main.cpp: In function ‘void ws(std::string)’:
./Main.cpp:23: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]
   23 | #define FOR(i,a,b) for(TY i=(a);i<(b);++i)
      |                                  ^
./Main.cpp:49:22: note: in expansion of macro ‘FOR’
   49 | IL void ws(string s){FOR(i,0,s.size())putchar(s[i]);}
      |                      ^~~
./Main.cpp: In function ‘int main()’:
./Main.cpp:86:80: warning: suggest parentheses around ‘-’ inside ‘<<’ [-Wparentheses]
   86 |  For(j,1,19)for(TY i=1;i+(1ll<<j)-1<=n;++i)st[i][j]=min(st[i][j-1],st[i+(1ll<<j-1)][j-1]);
      |                                                                               ~^~
./Main.cpp:88:80: warning: suggest parentheses around ‘-’ inside ‘<<’ [-Wparentheses]
   88 |  For(j,1,19)for(TY i=1;i+(1ll<<j)-1<=n;++i)bst[i][j]=(bst[i][j-1]&bst[i+(1ll<<j-1)][j-1]);
      |                                                                               ~^~

ジャッジ結果