Submission #523689


Source Code Expand

Copy
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
#include <fstream>
#include <bitset>

using namespace std;

#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)
template <typename T> void print_container(ostream& os, const T& c) { const char* _s = " "; if (!c.empty()) { __typeof__(c.begin()) last = --c.end(); foreach (it, c) { os << *it; if (it != last) os << _s; } } }
template <typename T> ostream& operator<<(ostream& os, const vector<T>& c) { print_container(os, c); return os; }
template <typename T> ostream& operator<<(ostream& os, const set<T>& c) { print_container(os, c); return os; }
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& c) { print_container(os, c); return os; }
template <typename T> ostream& operator<<(ostream& os, const deque<T>& c) { print_container(os, c); return os; }
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& c) { print_container(os, c); return os; }
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) { os << "(" << p.first << ", " << p.second << ")"; return os; }

template <typename T> void print(T a, int n, const string& split = " ") { for (int i = 0; i < n; i++) { cout << a[i]; if (i + 1 != n) cout << split; } cout << endl; }
template <typename T> void print2d(T a, int w, int h, int width = -1, int br = 0) { for (int i = 0; i < h; ++i) { for (int j = 0; j < w; ++j) { if (width != -1) cout.width(width); cout << a[i][j] << ' '; } cout << endl; } while (br--) cout << endl; }
template <typename T> void input(T& a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }
#define dump(v) (cout << #v << ": " << v << endl)

#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define erep(i, n) for (int i = 0; i <= (int)(n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define clr(a, x) memset(a, x, sizeof(a))
#define sz(a) ((int)(a).size())
#define mp(a, b) make_pair(a, b)
#define ten(n) ((long long)(1e##n))

template <typename T, typename U> void upmin(T& a, const U& b) { a = min<T>(a, b); }
template <typename T, typename U> void upmax(T& a, const U& b) { a = max<T>(a, b); }
template <typename T> void uniq(T& a) { sort(a.begin(), a.end()); a.erase(unique(a.begin(), a.end()), a.end()); }
template <class T> string to_s(const T& a) { ostringstream os; os << a; return os.str(); }
template <class T> T to_T(const string& s) { istringstream is(s); T res; is >> res; return res; }
void fast_io() { cin.tie(0); ios::sync_with_stdio(false); }
bool in_rect(int x, int y, int w, int h) { return 0 <= x && x < w && 0 <= y && y < h; }

typedef long long ll;
typedef pair<int, int> pint;

const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { 1, 0, -1, 0 };


int main()
{
    fast_io();

    int n, m;
    cin >> n >> m;
    vector<int> imos(n + 10);
    vector<vector<pint>> right(n + 1);
    rep(i, m)
    {
        int l, r;
        cin >> l >> r;
        --l;
        ++imos[l];
        --imos[r];

        right[l].push_back(pint(r, i + 1));
    }
    rep(i, n)
        imos[i + 1] += imos[i];

    vector<int> is;
    priority_queue<pint, vector<pint>, greater<pint>> q;
    rep(i, n + 1)
    {
        while (!q.empty() && q.top().first == i)
        {
            is.push_back(q.top().second);
            q.pop();
        }

        for (auto& it : right[i])
            q.push(it);

        if (imos[i] <= 1)
            q = priority_queue<pint, vector<pint>, greater<pint>>();
    }
    sort(all(is));
    cout << is.size() << endl;
    for (int i : is)
        cout << i << endl;
}

Submission Info

Submission Time
Task B - ドキドキデート大作戦高橋君
User takapt
Language C++11 (GCC 4.9.2)
Score 100
Code Size 4112 Byte
Status
Exec Time 338 ms
Memory 13780 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 30 / 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 70 / 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 27 ms 732 KB
subtask0_sample_02.txt 23 ms 800 KB
subtask0_sample_03.txt 26 ms 928 KB
subtask1_01.txt 92 ms 12064 KB
subtask1_02.txt 309 ms 11160 KB
subtask1_03.txt 82 ms 9372 KB
subtask1_04.txt 201 ms 7836 KB
subtask1_05.txt 209 ms 7844 KB
subtask1_06.txt 25 ms 800 KB
subtask1_07.txt 24 ms 932 KB
subtask1_08.txt 23 ms 924 KB
subtask1_09.txt 24 ms 792 KB
subtask2_01.txt 315 ms 11412 KB
subtask2_02.txt 329 ms 13780 KB
subtask2_03.txt 25 ms 800 KB
subtask2_04.txt 25 ms 804 KB
subtask2_05.txt 25 ms 924 KB
subtask2_06.txt 25 ms 800 KB
subtask2_07.txt 23 ms 928 KB
subtask2_08.txt 338 ms 10024 KB