oj.uz

답안 #128721

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
128721 2019-07-11T08:39:15 Z letrongdat 결혼 문제 (IZhO14_marriage) C++17
100 / 100
 317 ms 1528 KB 
/*
    Author: Le Trong Dat.
    Idea: Kuhn Munkres + two pointer.
*/
#include <bits/stdc++.h>
using namespace std;
#define forn(i, a, b)           for(int i=a; i<=b; ++i)
const int maxN = 3e4 +10;
const int maxM = 2e3 +10;
int matched[maxN];
vector<int> E[maxM];
int le, ri, t = 1;
int N, M, K;
long long result;
int visited[maxM];
bool flag[maxM];
vector<int> not_match;
bool visit(int u) {
    if (visited[u] == t) return false;
    visited[u] = t;
    while (E[u].size() && E[u].back() < le) E[u].pop_back();
    for(auto v: E[u]) if (v <= ri) {
        if (!matched[v] || visit(matched[v])) {
            matched[v] = u;
            return true;
        } 
    }
    return false;
}
int main() {
    ios::sync_with_stdio(0);
    cin >> N >> M >> K;
    forn(i, 1, K) {
        int Ai, Bi; 
        cin >> Ai >> Bi;
        E[Bi].push_back(Ai);
    }
    forn(i, 1, M) {
        sort(E[i].begin(), E[i].end());
        reverse(E[i].begin(), E[i].end());
    }
    forn(i, 1, M) not_match.push_back(i);
    for(le = 1; le <= N; ++le) {
        ri = max(ri, le);
        while (not_match.size()) {
            t ++;
            if (visit(not_match.back())) not_match.pop_back(); else {
                if (ri > N) break; 
                ri ++;
            }
        }
        if (not_match.empty()) result += N - ri + 1;
        if (matched[le]) not_match.push_back(matched[le]);
    }
    cout << result;
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 432 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 420 KB Output is correct
17 Correct 2 ms 424 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 3 ms 504 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 13 ms 632 KB Output is correct
26 Correct 4 ms 504 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 4 ms 504 KB Output is correct
30 Correct 4 ms 504 KB Output is correct
31 Correct 120 ms 1016 KB Output is correct
32 Correct 7 ms 504 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 5 ms 476 KB Output is correct
35 Correct 146 ms 1392 KB Output is correct
36 Correct 115 ms 1408 KB Output is correct
37 Correct 317 ms 1272 KB Output is correct
38 Correct 26 ms 1348 KB Output is correct
39 Correct 85 ms 608 KB Output is correct
40 Correct 5 ms 632 KB Output is correct
41 Correct 8 ms 888 KB Output is correct
42 Correct 9 ms 860 KB Output is correct
43 Correct 14 ms 1144 KB Output is correct
44 Correct 23 ms 1400 KB Output is correct
45 Correct 12 ms 1016 KB Output is correct
46 Correct 47 ms 1528 KB Output is correct
47 Correct 26 ms 1528 KB Output is correct
48 Correct 24 ms 1528 KB Output is correct
49 Correct 64 ms 1528 KB Output is correct
50 Correct 234 ms 632 KB Output is correct