Submission #7926007


Source Code Expand

#include <iostream>
#include <queue>
#include <vector>
#include <iostream>
#include <vector>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <map>
#include <iomanip>
#include <utility>
using ll = long long;
using ld = long double;
using namespace std;
ll MOD = 1e9 + 7;
//vector<ld> vec;

int main(){
    int n,m;
    cin>>n>>m;
    vector<int> vec(n+3);
    vector<pair<int,int>> reg(n+3);
    for(int i=0;i<m;i++){
        int s,t;
        cin>>s>>t;
        vec[s]++;
        vec[t+1]--;
        reg[i]=make_pair(s,t);
    }
    
    for(int i=1;i<=n;i++){
        vec[i]+=vec[i-1];
    }
   
//   /  cout<<endl;
  //  cout<<endl;
    for(int i=1;i<=n;i++){
        vec[i]--;
        if(vec[i]){
            vec[i]=0;
        }else{
            vec[i]=1;
        }
    }
     
    for(int i=1;i<=n;i++){
        vec[i]+=vec[i-1];
    }
  //  int res=0;
    
    
  ///  cout<<reg[4].second-reg[i].first
  vector<int> resv;
    for(int i=0;i<m;i++){
        //cout<<vec[reg[i].second]<<" "<<vec[reg[i].first]<<endl;
        if((vec[reg[i].second]-vec[reg[i].first-1])==0){
            resv.push_back(i+1);
        }
    }
    cout<<resv.size()<<endl;
    for(int i=0;i<resv.size();i++){
        cout<<resv[i]<<endl;
    }
  //  cout<<res<<endl;
}
    

Submission Info

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

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 63 ms 3712 KB
subtask1_02.txt AC 222 ms 4856 KB
subtask1_03.txt AC 62 ms 2560 KB
subtask1_04.txt AC 140 ms 2684 KB
subtask1_05.txt AC 140 ms 2684 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 209 ms 4856 KB
subtask2_02.txt AC 220 ms 4856 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 219 ms 3704 KB