Submission #523494


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
#define mem(a) memset(a,0,sizeof(a))
#define pd(a) printf("%.10f\n",a)
#define pb(a) push_back(a)
#define in(a) insert(a)
#define pi M_PI
#define R cin>>
#define F first
#define S second
#define C class
#define ll long long
#define ln cout<<'\n'
#define _(_1,_2,_3,N,...)N
#define pr(...) _(__VA_ARGS__,pr3,pr2,pr1)(__VA_ARGS__)
template<C T>void pr1(T a){cout<<a;ln;}
template<C T,C T2>void pr2(T a,T2 b){cout<<a<<' '<<b;ln;}
template<C T,C T2,C T3>void pr3(T a,T2 b,T3 c){cout<<a<<' '<<b<<' '<<c;ln;}
template<C T>void PR(T a,int n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
bool check(int n,int m,int x,int y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;

void Main() {
  int n,m;
  cin >> n >> m;
  P a[n];
  rep(i,m) cin >> a[i].F >> a[i].S;
  int d[300010];
  mem(d);
  rep(i,m) {
    d[a[i].F]++;
    d[a[i].S+1]--;
  }
  REP(i,1,300010) d[i]+=d[i-1];
  REP(i,1,300010) {
    if(d[i]<2) d[i]=0;
    else d[i]=1;
  }
  REP(i,1,300010) d[i]+=d[i-1];
  vector<int> ans;
  rep(i,m) {
    if(d[a[i].S]-d[a[i].F-1]==a[i].S-a[i].F+1) ans.pb(i+1);
  }
  pr(ans.size());
  rep(i,ans.size()) pr(ans[i]);
}

int main() {
  ios::sync_with_stdio(0);cin.tie(0);
  Main();return 0;
}

Submission Info

Submission Time
Task B - ドキドキデート大作戦高橋君
User kzyKT
Language C++ (GCC 4.9.2)
Score 0
Code Size 1631 Byte
Status
Exec Time 120 ms
Memory 4948 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt
Subtask1 0 / 30 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 0 / 70 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 28 ms 2076 KB
subtask0_sample_02.txt 29 ms 1956 KB
subtask0_sample_03.txt 28 ms 2080 KB
subtask1_01.txt 60 ms 4256 KB
subtask1_02.txt 114 ms 4904 KB
subtask1_03.txt 58 ms 3488 KB
subtask1_04.txt 89 ms 3476 KB
subtask1_05.txt 90 ms 3492 KB
subtask1_06.txt 30 ms 1956 KB
subtask1_07.txt 30 ms 1952 KB
subtask1_08.txt 27 ms 2080 KB
subtask1_09.txt 30 ms 2072 KB
subtask2_01.txt 120 ms 4888 KB
subtask2_02.txt 119 ms 4948 KB
subtask2_03.txt 30 ms 1948 KB
subtask2_04.txt 28 ms 1964 KB
subtask2_05.txt 28 ms 1948 KB
subtask2_06.txt 28 ms 1948 KB
subtask2_07.txt 31 ms 2068 KB
subtask2_08.txt 118 ms 4124 KB