結果

問題 No.1557 Binary Variable
ユーザー rniyarniya
提出日時 2021-06-25 22:38:31
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 393 ms / 2,000 ms
コード長 5,076 bytes
コンパイル時間 2,392 ms
コンパイル使用メモリ 214,776 KB
実行使用メモリ 42,208 KB
最終ジャッジ日時 2023-09-07 14:45:47
合計ジャッジ時間 12,991 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 197 ms
27,476 KB
testcase_01 AC 185 ms
25,316 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 1 ms
4,380 KB
testcase_04 AC 68 ms
7,736 KB
testcase_05 AC 67 ms
7,692 KB
testcase_06 AC 62 ms
7,676 KB
testcase_07 AC 65 ms
7,696 KB
testcase_08 AC 86 ms
8,072 KB
testcase_09 AC 92 ms
8,284 KB
testcase_10 AC 139 ms
10,716 KB
testcase_11 AC 140 ms
10,972 KB
testcase_12 AC 85 ms
8,068 KB
testcase_13 AC 145 ms
11,208 KB
testcase_14 AC 341 ms
35,916 KB
testcase_15 AC 151 ms
12,032 KB
testcase_16 AC 335 ms
33,740 KB
testcase_17 AC 286 ms
27,740 KB
testcase_18 AC 259 ms
23,600 KB
testcase_19 AC 386 ms
41,396 KB
testcase_20 AC 388 ms
40,552 KB
testcase_21 AC 385 ms
40,388 KB
testcase_22 AC 393 ms
41,000 KB
testcase_23 AC 372 ms
40,280 KB
testcase_24 AC 386 ms
41,632 KB
testcase_25 AC 381 ms
41,588 KB
testcase_26 AC 382 ms
41,944 KB
testcase_27 AC 392 ms
41,856 KB
testcase_28 AC 385 ms
42,004 KB
testcase_29 AC 386 ms
42,132 KB
testcase_30 AC 389 ms
42,064 KB
testcase_31 AC 386 ms
41,996 KB
testcase_32 AC 387 ms
42,208 KB
testcase_33 AC 360 ms
39,564 KB
testcase_34 AC 1 ms
4,384 KB
testcase_35 AC 2 ms
4,380 KB
testcase_36 AC 1 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(), (x).end()

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    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, typename U, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
    return os;
}
template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}

void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                                   \
    cerr << " ";                                                                     \
    cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \
    cerr << " ";                                                                     \
    debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
#pragma endregion

/**
 * @brief compress
 */
template <typename T> map<T, int> compress(vector<T>& v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    map<T, int> res;
    for (int i = 0; i < v.size(); i++) res[v[i]] = i;
    return res;
}

const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
const long long MOD = 1000000007;
// const long long MOD = 998244353;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, M;
    cin >> N >> M;
    vector<int> L(M), R(M);
    for (int i = 0; i < M; i++) cin >> L[i] >> R[i], L[i]--;

    vector<int> comp;
    comp.emplace_back(0);
    for (int& x : L) comp.emplace_back(x);
    for (int& x : R) comp.emplace_back(x);
    map<int, int> mp = compress(comp);
    int n = mp.size();
    vector<vector<int>> check(n + 1);
    for (int i = 0; i < M; i++) check[mp[R[i]]].emplace_back(mp[L[i]]);

    vector<int> sum(n + 1, 0);
    for (int r = 1; r <= n; r++) {
        sum[r] = sum[r - 1];
        bool ok = true;
        for (int& l : check[r]) {
            if (sum[r] - sum[l] == 0) {
                ok = false;
            }
        }
        if (!ok) sum[r]++;
    }

    int ans = N - sum.back();
    cout << ans << '\n';
    return 0;
}
0