Submission #1681186


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
int main(void){
  int n=0;
  int m=0;
  cin>>n>>m;
  int*room=new int[n];
  int**clean=new int*[m];
  for(int i=0;i<m;i++){
    room[i]=0;
  }
  for(int i=0;i<m;i++){
    clean[i]=new int[2];
    cin>>clean[i][0]>>clean[i][1];
    for(int j=clean[i][0]-1;j<clean[i][1];j++){
      room[j]++;
    }
  }
  int count=0;
  int*ans=new int[n];
  for(int i=0;i<m;i++){
    bool check=true;
    for(int j=clean[i][0]-1;j<clean[i][1];j++){
      if(room[j]<2)check=false;
    }
    if(check){
      ans[count]=i+1;
      count++;
    }
  }
  cout<<count<<endl;
  for(int i=0;i<count;i++){
    cout<<ans[i]<<endl;
  }
  return 0;
}

Submission Info

Submission Time
Task B - ドキドキデート大作戦高橋君
User shumy
Language C++14 (GCC 5.4.1)
Score 30
Code Size 702 Byte
Status TLE
Exec Time 2103 ms
Memory 6272 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 30 / 30 0 / 70
Status
AC × 3
AC × 12
AC × 17
TLE × 3
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 84 ms 5376 KB
subtask1_02.txt AC 236 ms 6272 KB
subtask1_03.txt AC 81 ms 4992 KB
subtask1_04.txt AC 162 ms 5248 KB
subtask1_05.txt AC 160 ms 5248 KB
subtask1_06.txt AC 1 ms 256 KB
subtask1_07.txt AC 2 ms 384 KB
subtask1_08.txt AC 1 ms 256 KB
subtask1_09.txt AC 1 ms 256 KB
subtask2_01.txt TLE 2103 ms 1920 KB
subtask2_02.txt TLE 2103 ms 1920 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 TLE 2103 ms 3328 KB