Submission #2321942


Source Code Expand

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;
const int N=100010;
char s[N];
int fa[N],v[N],c[N];
inline int gi() {
    int x=0,o=1;
    char ch=getchar();
    while(ch!='-'&&(ch<'0'||ch>'9')) ch=getchar();
    if(ch=='-') o=-1,ch=getchar();
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*o;
}
inline int find(int x) {return fa[x]==x?x:fa[x]=find(fa[x]);}
int main() {
    int n,m,p;
    scanf("%s%d",s+1,&m);
    n=strlen(s+1),p=n/2+1;
    for(int i=1;i<p;i++) fa[i]=i,s[i]-=s[n-i+1],c[i]=s[i]-s[i-1];
    fa[p]=p,c[p]=-s[p-1];
    while(m--) {
	int l=gi(),r=gi(),t=1;
	if(n&1) {
	    if(l==p&&r==p) continue;
	    if(l==p) ++l;
	    if(r==p) --r;
	}
	if(l<p&&r>=p) r=n-r+1,t=0;
	else if(l>p) l=n-l+1,r=n-r+1;
	if(l>r) swap(l,r);
	fa[find(l)]=find(r+t);
    }
    for(int i=1;i<=p;i++) v[find(i)]+=c[i];
    for(int i=1;i<=p;i++)
	if(i==find(i)&&v[i]%26) return puts("NO"),0;
    puts("YES");
    return 0;
}

Submission Info

Submission Time
Task E - Combination Lock
User Anson
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1042 Byte
Status WA
Exec Time 15 ms
Memory 896 KB

Compile Error

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

Judge Result

Set Name sample All
Score / Max Score 0 / 0 0 / 1000
Status
AC × 3
AC × 65
WA × 1
Set Name Test Cases
sample sample-01.txt, sample-02.txt, sample-03.txt
All sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 01-27.txt, 01-28.txt, 01-29.txt, 01-30.txt, 01-31.txt, 01-32.txt, 01-33.txt, 01-34.txt, 01-35.txt, 01-36.txt, 01-37.txt, 01-38.txt, 01-39.txt, 01-40.txt, 01-41.txt, 01-42.txt, 01-43.txt, 01-44.txt, 01-45.txt, 01-46.txt, 01-47.txt, 01-48.txt, 01-49.txt, 01-50.txt, 01-51.txt, 01-52.txt, 01-53.txt, 01-54.txt, 01-55.txt, 01-56.txt, 01-57.txt, 01-58.txt, 01-59.txt, 01-60.txt, sample-01.txt, sample-02.txt, sample-03.txt
Case Name Status Exec Time Memory
01-01.txt AC 8 ms 256 KB
01-02.txt AC 8 ms 256 KB
01-03.txt AC 10 ms 256 KB
01-04.txt AC 15 ms 896 KB
01-05.txt AC 8 ms 256 KB
01-06.txt AC 9 ms 256 KB
01-07.txt AC 8 ms 256 KB
01-08.txt AC 9 ms 256 KB
01-09.txt AC 10 ms 256 KB
01-10.txt AC 10 ms 256 KB
01-11.txt AC 10 ms 384 KB
01-12.txt AC 11 ms 384 KB
01-13.txt AC 12 ms 512 KB
01-14.txt AC 13 ms 640 KB
01-15.txt AC 14 ms 768 KB
01-16.txt AC 15 ms 896 KB
01-17.txt AC 15 ms 896 KB
01-18.txt AC 15 ms 896 KB
01-19.txt AC 15 ms 896 KB
01-20.txt WA 15 ms 896 KB
01-21.txt AC 15 ms 896 KB
01-22.txt AC 15 ms 896 KB
01-23.txt AC 15 ms 896 KB
01-24.txt AC 2 ms 896 KB
01-25.txt AC 2 ms 896 KB
01-26.txt AC 2 ms 896 KB
01-27.txt AC 2 ms 896 KB
01-28.txt AC 3 ms 896 KB
01-29.txt AC 8 ms 256 KB
01-30.txt AC 8 ms 256 KB
01-31.txt AC 8 ms 256 KB
01-32.txt AC 10 ms 256 KB
01-33.txt AC 10 ms 384 KB
01-34.txt AC 12 ms 384 KB
01-35.txt AC 13 ms 640 KB
01-36.txt AC 14 ms 768 KB
01-37.txt AC 15 ms 896 KB
01-38.txt AC 15 ms 896 KB
01-39.txt AC 15 ms 896 KB
01-40.txt AC 15 ms 896 KB
01-41.txt AC 15 ms 896 KB
01-42.txt AC 15 ms 896 KB
01-43.txt AC 15 ms 896 KB
01-44.txt AC 15 ms 896 KB
01-45.txt AC 15 ms 896 KB
01-46.txt AC 14 ms 896 KB
01-47.txt AC 15 ms 896 KB
01-48.txt AC 15 ms 896 KB
01-49.txt AC 14 ms 896 KB
01-50.txt AC 15 ms 896 KB
01-51.txt AC 2 ms 896 KB
01-52.txt AC 2 ms 896 KB
01-53.txt AC 2 ms 896 KB
01-54.txt AC 2 ms 896 KB
01-55.txt AC 3 ms 896 KB
01-56.txt AC 6 ms 896 KB
01-57.txt AC 6 ms 896 KB
01-58.txt AC 6 ms 896 KB
01-59.txt AC 6 ms 896 KB
01-60.txt AC 6 ms 896 KB
sample-01.txt AC 1 ms 256 KB
sample-02.txt AC 1 ms 256 KB
sample-03.txt AC 1 ms 256 KB