Submission #1501943


Source Code Expand

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <limits.h>
#define swap(type,a,b) do{type t=a;a=b;b=t;}while(0);
#define MAX(a,b) (((a)>(b))?(a):(b))
#define MIN(a,b) (((a)<(b))?(a):(b))
#define ll long long
#define INF 100000000
#define FOR(i,a,n) for(i=(a);i<(n);i++)
int comp(const void* a,const void* b){
	return *(int*)a-*(int*)b;
}
void fill(int a[],int b,int c){
	int i;
	FOR(i,0,b) a[i]=c;
	return;
}
int s[100000],t[100000];
int a[300002];
int sec[300001];
int res[100000];
int main(void)
{
	int n,m,size=0,i; 
	scanf("%d%d",&n,&m);
	FOR(i,0,m){
		scanf("%d%d",&s[i],&t[i]);
		a[s[i]]++,a[t[i]+1]--;
	}
	FOR(i,2,n+1) a[i]+=a[i-1];
	FOR(i,1,n+1) sec[i]=(a[i]>1);
	FOR(i,2,n+1) sec[i]+=sec[i-1];
	FOR(i,0,m){
		if(sec[t[i]]-sec[s[i]-1]==t[i]-s[i]+1){
			res[size++]=i+1;
		}
	}
	printf("%d\n",size);
	FOR(i,0,size) printf("%d\n",res[i]);
	return 0;
}

Submission Info

Submission Time
Task B - ドキドキデート大作戦高橋君
User trainstation
Language C (GCC 5.4.1)
Score 100
Code Size 939 Byte
Status AC
Exec Time 30 ms
Memory 4224 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:27:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m);
  ^
./Main.c:29:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&s[i],&t[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 0 ms 128 KB
subtask0_sample_02.txt AC 0 ms 128 KB
subtask0_sample_03.txt AC 0 ms 128 KB
subtask1_01.txt AC 21 ms 3328 KB
subtask1_02.txt AC 29 ms 4224 KB
subtask1_03.txt AC 20 ms 2560 KB
subtask1_04.txt AC 25 ms 2560 KB
subtask1_05.txt AC 25 ms 2560 KB
subtask1_06.txt AC 0 ms 128 KB
subtask1_07.txt AC 0 ms 128 KB
subtask1_08.txt AC 0 ms 128 KB
subtask1_09.txt AC 0 ms 128 KB
subtask2_01.txt AC 27 ms 4224 KB
subtask2_02.txt AC 29 ms 4224 KB
subtask2_03.txt AC 1 ms 128 KB
subtask2_04.txt AC 0 ms 128 KB
subtask2_05.txt AC 1 ms 128 KB
subtask2_06.txt AC 1 ms 128 KB
subtask2_07.txt AC 0 ms 128 KB
subtask2_08.txt AC 30 ms 3456 KB