Submission #1229421


Source Code Expand

#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<iostream>
#define N 510000
using namespace std;
struct node{int y,nex;}a[N];
int nex[N][27],n,inf,id,fir[N],len,dfn[N],las[N],m;
char s[N];
void ins(int x,int y)
{
	a[++len].y=y;a[len].nex=fir[x];fir[x]=len;
}
void dfs(int x)
{
	dfn[x]=++id;
	for(int k=fir[x];k;k=a[k].nex)
	{
		int y=a[k].y;
		dfs(y);
	}
	las[x]=id;
}
int main()
{
	scanf("%s",s+1);
	n=strlen(s+1);inf=n+2;
	for(int i=0;i<=26;i++) nex[n][i]=nex[n+1][i]=nex[n+2][i]=inf;
	nex[n][s[n]-'a'+1]=n+1;
	ins(n+2,n+1);
	ins(n+2,n);
	for(int i=n-1;i>=1;i--)
	{
		int c=s[i]-'a'+1;
		nex[i][c]=i+1;
		for(int j=c+1;j<=26;j++) nex[i][j]=nex[nex[i][j-1]][j-1];
		nex[i][0]=nex[nex[i][26]][26];
		for(int j=1;j<c;j++) nex[i][j]=nex[nex[i][0]][j];
		ins(nex[i][0],i);
	}
	dfs(n+2);
	scanf("%d",&m);
	while(m--)
	{
		int l,r;scanf("%d%d",&l,&r);
		r++;
		if(dfn[r]<=dfn[l] && las[r]>=dfn[l]) printf("Yes\n");
		else printf("No\n");
	}
	return 0;
}

Submission Info

Submission Time
Task A - Robot Racing
User la1la1la
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1028 Byte
Status RE
Exec Time 101 ms
Memory 8448 KB

Compile Error

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

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 0 / 500 0 / 400
Status
WA × 4
WA × 11
RE × 3
WA × 22
RE × 6
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
Subtask 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 2_00.txt, 2_01.txt, 2_02.txt, 2_03.txt, 2_04.txt, 2_05.txt, 2_06.txt, 2_07.txt, 2_08.txt, 2_09.txt, 2_10.txt, 2_11.txt, 2_12.txt
Case Name Status Exec Time Memory
0_00.txt WA 3 ms 8448 KB
0_01.txt WA 3 ms 8448 KB
0_02.txt WA 3 ms 8448 KB
0_03.txt WA 3 ms 8448 KB
1_00.txt WA 3 ms 8448 KB
1_01.txt WA 3 ms 8448 KB
1_02.txt RE 98 ms 8448 KB
1_03.txt WA 3 ms 8448 KB
1_04.txt WA 3 ms 8448 KB
1_05.txt RE 98 ms 8448 KB
1_06.txt WA 3 ms 8448 KB
1_07.txt WA 3 ms 8448 KB
1_08.txt WA 3 ms 8448 KB
1_09.txt WA 3 ms 8448 KB
1_10.txt RE 98 ms 8448 KB
2_00.txt WA 3 ms 8448 KB
2_01.txt WA 3 ms 8448 KB
2_02.txt RE 99 ms 8448 KB
2_03.txt WA 3 ms 8448 KB
2_04.txt WA 3 ms 8448 KB
2_05.txt WA 3 ms 8448 KB
2_06.txt WA 3 ms 8448 KB
2_07.txt WA 3 ms 8448 KB
2_08.txt WA 3 ms 8448 KB
2_09.txt WA 3 ms 8448 KB
2_10.txt WA 3 ms 8448 KB
2_11.txt RE 101 ms 8448 KB
2_12.txt RE 99 ms 8448 KB