Submission #1077463

---

Source Code Expand

#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>

#define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i))
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define all(v) begin(v), end(v)
#define debug(x) cerr<< #x <<": "<<x<<endl
#define debug2(x,y) cerr<< #x <<": "<< x <<", "<< #y <<": "<< y <<endl

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<ll> vll;
typedef vector<vector<ll> > vvll;
template<class T> using vv=vector<vector< T > >;

// cout vector
template<typename T> ostream& operator<<(ostream& s, const vector<T>& v) {
  int len = v.size(); s << "\n";
  for (int i = 0; i < len; ++i) {
    s << v[i]; if (i < len - 1) s << "\t";
  }
  s << "\n"; return s;
}

int main() {
  int n, m;
  scanf("%d %d", &n, &m);
  vi part(n+1, 0);
  vi accum(n+1, 0);
  vi s(m), t(m);
  rep (i, m) {
    scanf("%d %d", &s[i], &t[i]);
    s[i] -= 1;
    part[s[i]] += 1;
    part[t[i]] -= 1;
  }
  accum[0] = part[0];
  FOR (i, 1, n+1) {
    accum[i] = accum[i-1] + part[i];
  }
  //assert(accum[n] == 0);
  vi max_range(n+1);
  rep (i, n) {
    max_range[i] = i;
  }
  int current = 0;
  rep (i, n+1) {
    if (accum[i] < 2) {
      max_range[current] = i;
      current = i+1;
    }
  }
  FOR (i, 1, n+1) {
    max_range[i] = max(max_range[i-1], max_range[i]);
  }
  int ans = 0;
  rep (i, m) {
    if (max_range[s[i]] >= t[i]) {
      ans += 1;
    }
  }
  printf("%d\n", ans);
  rep (i, m) {
    if (max_range[s[i]] >= t[i]) {
      printf("%d\n", i+1);
    }
  }

  return 0;
}

Submission Info

Judge Result