Submission #7897027


Source Code Expand

#pragma GCC optimize(3,"Ofast","inline")
#define R register
#include<iostream>
#include<cstdio>
#include<algorithm>
const int MAXN=1e5+7;
struct node{
	int ser,l,r;
}classroom[MAXN];
int a[MAXN*3],n,m,sum;
bool vis[MAXN];
bool cmp(node x,node y) {
	return x.l<y.l;
}
int MAX(int a,int b){
	return a>b?a:b;
}
int main(void) {
	scanf("%d%d",&n,&m);
	sum=m;
	for(R int i=1; i<=m; i++) {
		scanf("%d%d",&classroom[i].l,&classroom[i].r);
		classroom[i].ser=i;
	}
	std::sort(classroom+1,classroom+m+1,cmp);
	int flag=1,flag_l=classroom[1].l;
	for(R int i=2; i<=m; i++) {
		if(classroom[i].l>flag_l){
			if(!vis[classroom[flag].ser]) {
				sum--;
				vis[classroom[flag].ser]=true;
			}
		} 	
		if(classroom[i].r>classroom[flag].r) {
			flag_l=MAX(flag_l,classroom[flag].r+1);
			flag=i;
		} else flag_l=MAX(flag_l,classroom[i].r+1);
	}
	if(flag_l<=classroom[flag].r){
		if(!vis[classroom[flag].ser]) {
			sum--;
			vis[classroom[flag].ser]=true;
		}
	} 
	printf("%d\n",sum);
	for(int i=1; i<=m; i++) 
		if(!vis[i]) 
			printf("%d\n",i);
	return 0;
}

Submission Info

Submission Time
Task B - ドキドキデート大作戦高橋君
User luogu_bot2
Language C++ (GCC 5.4.1)
Score 100
Code Size 1092 Byte
Status AC
Exec Time 37 ms
Memory 2048 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:19: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:22:48: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&classroom[i].l,&classroom[i].r);
                                                ^

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 256 KB
subtask0_sample_02.txt AC 1 ms 256 KB
subtask0_sample_03.txt AC 1 ms 256 KB
subtask1_01.txt AC 24 ms 1536 KB
subtask1_02.txt AC 32 ms 2048 KB
subtask1_03.txt AC 35 ms 1536 KB
subtask1_04.txt AC 34 ms 1792 KB
subtask1_05.txt AC 35 ms 1792 KB
subtask1_06.txt AC 1 ms 256 KB
subtask1_07.txt AC 1 ms 256 KB
subtask1_08.txt AC 1 ms 256 KB
subtask1_09.txt AC 1 ms 256 KB
subtask2_01.txt AC 29 ms 2048 KB
subtask2_02.txt AC 32 ms 2048 KB
subtask2_03.txt AC 1 ms 256 KB
subtask2_04.txt AC 1 ms 256 KB
subtask2_05.txt AC 1 ms 256 KB
subtask2_06.txt AC 1 ms 256 KB
subtask2_07.txt AC 1 ms 256 KB
subtask2_08.txt AC 37 ms 2048 KB