oj.uz

답안 #711781

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
711781 2023-03-17T13:45:55 Z Filya 결혼 문제 (IZhO14_marriage) C++14
66 / 100
 452 ms 3148 KB 
/////////////////////include/////////////////////
//#include <bits/stdc++.h>
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
#include <set>
#include <map>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stdio.h>
#include <climits>
#include <numeric>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//template <typename T>
//using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
/////////////////////define/////////////////////
#define ci(x) if(x) cout << "YES" << '\n'; else cout << "NO" << '\n';
#define cii(x) if(check(x))
#define MOD 1000000007
#define MOD2 998244353
#define oo 1e9
#define ool 1e18L
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mii map<int, int>
#define vi vector<int>
#define vpi vector<pair<int, int>>
#define vll vector <ll>
#define ff first
#define ss second
#define mp make_pair
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define sz(x) (int((x).size()))
#define all(x) (x).begin(), (x).end()
#define alll(x) (x), (x) + n
#define clr(x) (x).clear();
#define fri(x) for(int i = 0; i < x; ++i)
#define frj(x) for(int j = 0; j < x; ++j)
#define frp(x) for(int p = 0; p < x; ++p)
#define frr(a, b) for(int i = a; i < b; ++i)
#define frrj(a, b) for(int j = a; j < b; ++j)
#define fra(x) for(int i = 0; i < x; ++i) cin >> a[i];
#define frb(x) for(int i = 0; i < x; ++i) cin >> b[i];
#define frs(x) for(auto it = x.begin(); it != x.end(); ++it)
#define fr(x) for(auto it : x) //el
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);
#define dbg(x) cerr << #x << ": " << x << endl;
#define ce(x) cout << x << endl;
#define uniq(x) x.resize(unique(all(x)) - x.begin()); //make all one after sorting
#define blt __builtin_popcount
/////////////////////print array, vector, deque, set, multiset, pair, map /////////////////////
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]"; cout << endl;}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(stack <T> v) {cerr << "[ "; stack<T> s = v; while(s.size()) {T i = s.top(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(queue <T> v) {cerr << "[ "; queue<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(deque <T> v) {cerr << "[ "; deque<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop_front(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
/////////////////////code/////////////////////
vi g[40005]; 
int mt[40005]; 
bool used[40005];
bool kuhn(int v, int l, int r) {
    if(used[v]) return 0;
    used[v] = 1;
    for(int u : g[v]) {
        if(u < l || u > r) continue;
        if(mt[u] == -1 || kuhn(mt[u], l, r)) {
            mt[u] = v;
            mt[v] = u;
            return 1;
        }
    }
    return 0;
}

int main() {
    fastio;
    int n, m, k, x, y;
    cin >> n >> m >> k;
    fri(k) {
        cin >> x >> y; x += m;
        g[x].pb(y);
        g[y].pb(x);
    }
    n += m;
    int l = 2 * m, r = n, ans = -1, mid; //l=2m qani vor gone m hat arqa piti lini
    while(l <= r) {
        mid = (l + r) / 2;
        frr(1, 1 + n) {
            mt[i] = -1;
            used[i] = 0;
        }
        bool f = 1;
        frr(1, 1 + m) 
            if(!kuhn(i, m+1, mid)) {
                f = 0;
                break;
            }
        if(f) {
            ans = mid;
            r = mid - 1;
        } else l = mid + 1;
    }
    if(ans == -1) {
        cout << 0;
        return 0;
    }
    int answ = n - ans + 1; //1ov sksvoxneri tivy
    frr(1, 1 + n)
        mt[i] = -1;
    frr(1, 1 + m) {
        frrj(1, 1 + n)
            used[j] = 0;
        kuhn(i, m+1, ans);
    }
    // print(mt, n + 1);
    for(int i = m + 1; i <= n; i++) { //i-rdy hanum enq mer kandidatneric
        if(mt[i] == -1) {
            answ += n - ans + 1; //ans ic sksac minchev n+m bolory bavarar en
            continue;
        }
        int girl = mt[i];
        mt[girl] = -1;
        mt[i] = -1;
        while(ans <= n) {
            frrj(1, 1 + n) used[j] = 0;
            if(kuhn(girl, i + 1, ans)) {
                answ += n - ans + 1;
                break;
            }
            ans++;
        }
        if(ans == n + 1) break;
    }
    cout << answ;
    return 0;
}

//	           ♥ ♥ ♥  ♥  ♥    ♥   ♥    ♥
//	           ♥      ♥  ♥     ♥ ♥    ♥ ♥
//	           ♥ ♥ ♥  ♥  ♥      ♥    ♥   ♥
//	           ♥      ♥  ♥      ♥   ♥ ♥ ♥ ♥
//	           ♥      ♥  ♥ ♥ ♥  ♥  ♥       ♥
//
//        God loves Fil, Fil accepts God's will

Subtask #1
66.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1236 KB Output is correct
2 Correct 1 ms 1236 KB Output is correct
3 Correct 1 ms 1236 KB Output is correct
4 Incorrect 1 ms 1236 KB Output isn't correct
5 Correct 1 ms 1236 KB Output is correct
6 Correct 1 ms 1236 KB Output is correct
7 Incorrect 1 ms 1236 KB Output isn't correct
8 Correct 2 ms 1236 KB Output is correct
9 Correct 1 ms 1236 KB Output is correct
10 Correct 1 ms 1236 KB Output is correct
11 Incorrect 1 ms 1236 KB Output isn't correct
12 Correct 1 ms 1236 KB Output is correct
13 Correct 1 ms 1236 KB Output is correct
14 Correct 1 ms 1236 KB Output is correct
15 Incorrect 1 ms 1236 KB Output isn't correct
16 Incorrect 1 ms 1236 KB Output isn't correct
17 Correct 1 ms 1228 KB Output is correct
18 Correct 1 ms 1236 KB Output is correct
19 Correct 2 ms 1236 KB Output is correct
20 Incorrect 1 ms 1236 KB Output isn't correct
21 Correct 1 ms 1236 KB Output is correct
22 Incorrect 1 ms 1236 KB Output isn't correct
23 Correct 1 ms 1236 KB Output is correct
24 Correct 1 ms 1236 KB Output is correct
25 Incorrect 27 ms 1364 KB Output isn't correct
26 Incorrect 3 ms 1236 KB Output isn't correct
27 Correct 1 ms 1236 KB Output is correct
28 Incorrect 1 ms 1236 KB Output isn't correct
29 Correct 2 ms 1364 KB Output is correct
30 Correct 3 ms 1364 KB Output is correct
31 Incorrect 149 ms 1876 KB Output isn't correct
32 Incorrect 2 ms 1364 KB Output isn't correct
33 Correct 1 ms 1236 KB Output is correct
34 Incorrect 1 ms 1236 KB Output isn't correct
35 Correct 66 ms 2296 KB Output is correct
36 Correct 50 ms 2324 KB Output is correct
37 Incorrect 452 ms 2112 KB Output isn't correct
38 Correct 16 ms 2516 KB Output is correct
39 Incorrect 2 ms 1364 KB Output isn't correct
40 Correct 5 ms 1492 KB Output is correct
41 Correct 7 ms 1748 KB Output is correct
42 Correct 7 ms 1876 KB Output is correct
43 Correct 12 ms 1956 KB Output is correct
44 Correct 20 ms 2380 KB Output is correct
45 Correct 22 ms 2252 KB Output is correct
46 Incorrect 61 ms 3148 KB Output isn't correct
47 Correct 22 ms 2772 KB Output is correct
48 Correct 22 ms 2772 KB Output is correct
49 Correct 59 ms 3060 KB Output is correct
50 Incorrect 2 ms 1492 KB Output isn't correct