提出 #813430

---

ソースコード 拡げる

#include <string>
#include <iostream>
#include <cstdlib>
#include <vector>
#include <unordered_set>
#include <algorithm>

int main () {
  std::string line;
  std::getline(std::cin, line);

  char * p;
  int N = std::strtol(line.data(), &p, 10);
  int M = std::strtol(p, NULL, 10);

  std::vector<std::vector<int>> cs(N);
  std::vector<std::vector<int>> ct(N);

  for (int i = 0; i < M; ++i) {
    std::getline(std::cin, line);
    int s = std::strtol(line.data(), &p, 10) - 1;
    int t = std::strtol(p, NULL, 10) - 1;
    cs[s].push_back(i);
    ct[t].push_back(i);
  }

std::unordered_set<int> set;
std::vector<int> buffer;

std::vector<int> result;

for (int i = 0; i < N; ++i) {
  for (int j : cs[i]) {
    set.emplace(j);
  }

  if (set.size() == 1) {
    set.clear();
  }

  buffer.clear();
  for (int j : set) {
    auto it = std::find(ct[i].begin(), ct[i].end(), j);
    if (it < ct[i].end()) {
      result.push_back(j);
      buffer.push_back(j);
    }
  }
  for (int j : buffer) {
    set.erase(j);
  }
}

std::sort(result.begin(), result.end());
std::cout << result.size() << std::endl;

for (int i : result) {
  std::cout << i + 1<< std::endl;
}
}

提出情報

ジャッジ結果