Submission #7929571


Source Code Expand

#include<cstdio>
const int N=300020;
int n,m,i,l[N],r[N],c[N],s[N],Ans;
void init(){
	scanf("%d%d",&n,&m);
	for(i=1;i<=m;i++){
		scanf("%d%d",l+i,r+i);
		c[l[i]]++;
		c[r[i]+1]--;
	}
	for(i=1;i<=n;i++){
		c[i]+=c[i-1];
		s[i]=s[i-1]+(c[i]==1);
		//printf("%d ",c[i]);
	}
	for(i=1;i<=m;i++)
		if(!(s[r[i]]-s[l[i]-1]))
			Ans++;
	printf("%d\n",Ans);
	for(i=1;i<=m;i++)
		if(!(s[r[i]]-s[l[i]-1]))
			printf("%d\n",i);
}
int main(){
	init();
	//while(1);
	//work();
	return 0;
}

Submission Info

Submission Time
Task B - ドキドキデート大作戦高橋君
User iwprc
Language C++14 (GCC 5.4.1)
Score 100
Code Size 502 Byte
Status AC
Exec Time 29 ms
Memory 4864 KB

Compile Error

./Main.cpp: In function ‘void init()’:
./Main.cpp:5:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m);
                     ^
./Main.cpp:7:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",l+i,r+i);
                        ^

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 3
AC × 12
AC × 20
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt
Subtask1 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt
All subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 1 ms 2176 KB
subtask0_sample_02.txt AC 1 ms 2176 KB
subtask0_sample_03.txt AC 1 ms 2176 KB
subtask1_01.txt AC 19 ms 4224 KB
subtask1_02.txt AC 28 ms 4864 KB
subtask1_03.txt AC 19 ms 3712 KB
subtask1_04.txt AC 25 ms 3712 KB
subtask1_05.txt AC 25 ms 3712 KB
subtask1_06.txt AC 1 ms 2176 KB
subtask1_07.txt AC 1 ms 2176 KB
subtask1_08.txt AC 1 ms 2176 KB
subtask1_09.txt AC 1 ms 2176 KB
subtask2_01.txt AC 25 ms 4864 KB
subtask2_02.txt AC 27 ms 4864 KB
subtask2_03.txt AC 1 ms 2176 KB
subtask2_04.txt AC 1 ms 2176 KB
subtask2_05.txt AC 1 ms 2176 KB
subtask2_06.txt AC 1 ms 2176 KB
subtask2_07.txt AC 1 ms 2176 KB
subtask2_08.txt AC 29 ms 4352 KB