Submission #2321983

---

Source Code Expand

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<iostream>
#define db double
#define LL long long
#define inf 0x3f3f3f3f
#define N 100005
using namespace std;
int gi()
{
    int res=0,s=1; char ch;
    for(ch=getchar();(ch<'0'||ch>'9')&&ch!='-';ch=getchar());
    if(ch=='-') s=-1,ch=getchar();
    for(;ch>='0'&&ch<='9';ch=getchar()) res=res*10+ch-48;
    return res*s;
}
int n,key[N],fa[N],sum[N],flag;
char s[N];
int findfa(int x) {return fa[x]==x?x:fa[x]=findfa(fa[x]);}
int main()
{
    scanf("%s",s+1); n=strlen(s+1);
    if(n&1) flag=1,n--;
    for(int i=1;i<=n/2;++i) 
	key[i]=s[flag?(n+2-i):(n+1-i)]-s[i],fa[i]=i;
    fa[n/2+1]=n/2+1,key[n/2+1]=0;
    for(int i=n/2;i;--i) key[i]-=key[i-1];
    for(int T=gi(),le,ri;T;--T) {
	le=gi(),ri=gi();
	if(flag) {
	    if(le>n/2+1) le--;
	    if(ri>n/2) ri--;
	}
	if(le>ri) continue;
	if(le<=n/2 && ri>n/2) {
	    if(n/2+1-le >= ri-n/2) ri=n-ri;
	    else le=n+2-le;
	}
	if(le>ri) continue;
	if(le>n/2)
	    le=n+1-le,ri=n+1-ri,swap(le,ri);
	ri++;
	if(findfa(le)!=findfa(ri)) fa[fa[le]]=fa[ri];
    }
    findfa(n/2+1);
    for(int i=1;i<=n/2;++i) sum[findfa(i)]+=key[i];
    for(int i=1;i<=n/2;++i) {
	if(fa[i]==fa[n/2+1]) continue;
	if(sum[fa[i]]%26) {puts("NO"); return 0;}
    }
    puts("YES");
    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:25:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s",s+1); n=strlen(s+1);
                    ^

Judge Result