Submission #3800578

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ull = uint64_t;
using ll = int64_t;
using ld = long double;

const int N = 200228;

vector<int> v[N];
int fen[N];

int main() {
#ifdef BZ
    freopen("input.txt", "r", stdin);
#endif
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cout.setf(ios::fixed); cout.precision(20);
    int h, w, n;
    cin >> h >> w >> n;
    for (int i = 0; i < n; ++i) {
        int x, y;
        cin >> x >> y;
        v[y].push_back(x);
    }

    int p = 0;
    int ans = h + 1;

    for (int i = 1; i <= w; ++i) {
        v[i].push_back(h + 1);
        sort(v[i].begin(), v[i].end());

        for (;;) {
            if (++p > h) {
                break;
            }

            int c = *lower_bound(v[i].begin(), v[i].end(), p);
            if (c != p) {
                ans = min(ans, c);
                break;
            }
        }

        if (p > h) {
            break;
        }

    }

    cout << ans - 1 << "\n";
}

Submission Info

Judge Result