Submission #3969862


Source Code Expand

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
struct w{int id,l,r;}e[100010];
bool cmp(w a,w b){return a.l<b.l;}
int a[300010],n,m,cpr,cpr_l,sum;
bool vis[100010];
int main(){
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++){
        scanf("%d%d",&e[i].l,&e[i].r);
        e[i].id=i;
    }
    sort(e+1,e+m+1,cmp);
    cpr=1,cpr_l=e[1].l;
    for(int i=2;i<=m;i++){
        if(e[i].l>cpr_l) if(!vis[e[cpr].id]){sum++;vis[e[cpr].id]=1;}
        if(e[i].r>e[cpr].r){
            cpr_l=max(cpr_l,e[cpr].r+1);
            cpr=i;
        }
        else cpr_l=max(cpr_l,e[i].r+1);
    }
    if(cpr_l<=e[cpr].r) if(!vis[e[cpr].id]){sum++;vis[e[cpr].id]=1;}
    printf("%d\n",m-sum);
    for(int i=1;i<=m;i++) if(!vis[i]) printf("%d\n",i);
    return 0;
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:10:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&m);
                        ^
./Main.cpp:12:38: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&e[i].l,&e[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 34 ms 1536 KB
subtask1_04.txt AC 33 ms 1792 KB
subtask1_05.txt AC 33 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 28 ms 2048 KB
subtask2_02.txt AC 31 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 36 ms 2048 KB