oj.uz

답안 #1027733

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1027733 2024-07-19T09:32:24 Z caterpillow 결혼 문제 (IZhO14_marriage) C++17
22 / 100
 1500 ms 4948 KB 
#include <bits/stdc++.h>

using namespace std;

using db = long double;
using ll = long long;
using pl = pair<ll, ll>;
using pi = pair<int, int>;
#define vt vector
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(), x.end() 
#define size(x) ((int) (x).size())
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define F0R(i, b) FOR (i, 0, b)
#define endl '\n'
const ll INF = 1e18;
const int inf = 1e9;

template<typename Tuple, size_t... Is>
void print_tuple(const Tuple& t, index_sequence<Is...>) {
    ((cerr << (Is == 0 ? "{" : ", ") << get<Is>(t)), ...);
    cerr << "}";
}

template<typename... Args>
ostream& operator<<(ostream& os, const tuple<Args...>& t) {
    print_tuple(t, index_sequence_for<Args...>{});
    return os;
}

ostream& operator<<(ostream& os, string& s) {
    for (char c : s) os << c; 
    return os;
}

template<template<typename> class Container, typename T>
ostream& operator<<(ostream& os, Container<T> o) {
    os << "{"; 
    int g = size(o); 
    for (auto i : o) os << i << ((--g) == 0 ? "" : ", "); 
    os << "}";
    return os;
}

template<typename T, typename V>
ostream& operator<<(ostream& os, const pair<T, V> p) {
    os << "{" << p.f << ", " << p.s << "}";
    return os;
}

template <typename T, typename... V>
void printer(const char *names, T &&head, V &&...tail) {
    int i = 0;
    while (names[i] != '\0' && names[i] != ',') i++;
    constexpr bool is_str = is_same_v<decay_t<T>, const char*>;
    if constexpr (is_str) cerr << head; // ignore directly passed strings
    else cerr.write(names, i) << " = " << head; 
    if constexpr (sizeof...(tail)) cerr << (is_str ? "" : ","), printer(names + i + 1, tail...);
    else cerr << endl;
}

#ifdef LOCAL
#define dbg(...) std::cerr << __LINE__ << ": ", printer(#__VA_ARGS__, __VA_ARGS__)
#else
#define dbg(x...)
#define cerr if (0) std::cerr
#endif

/*

range perfect matching goes crazy

since kuhn's is more efficient when lhs is small, we need the girls to be on the left
we want to find the maximum r for each l, and two pointer it

*/

int n, m, k; // n is lhs (girls), m is rhs (boys)
vt<unordered_set<int>> adj; // l -> r
vt<int> mate; // mate = rhs -> lhs
vt<bool> seen;

bool dfs(int u) {
    if (seen[u]) return false;
    seen[u] = true;
    for (int v : adj[u]) {
        if (mate[v] == -1 || dfs(mate[v])) {
            mate[v] = u;
            return true;
        }
    }
    return false;
}

bool check_perfect_matching() {
    seen.assign(n, 0);
    mate.assign(m, -1);
    F0R (i, n) {
        if (!dfs(i)) return false;
    }
    return true;
}

main() {
    cin.tie(0)->sync_with_stdio(0);
    
    cin >> m >> n >> k;
    adj.resize(n);
    mate.resize(m, -1);

    vt<vt<int>> radj(m);
    F0R (i, k) {
        int u, v; cin >> u >> v; u--, v--;
        // u is boy, v is girl
        radj[u].pb(v);
    }

    ll ans = 0;

    F0R (l, m) {
        FOR (r, l, m) {
            adj.assign(n, {});
            FOR (i, l, r + 1) {
                for (int u : radj[i]) {
                    adj[u].insert(i);
                }
            }
            if (check_perfect_matching()) ans++;
        }
    }
    cout << ans << endl;
}

Compilation message

marriage.cpp:107:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  107 | main() {
      | ^~~~

Subtask #1
22.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Correct 1 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 1 ms 348 KB Output isn't correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Incorrect 1 ms 348 KB Output isn't correct
15 Incorrect 1 ms 348 KB Output isn't correct
16 Incorrect 0 ms 348 KB Output isn't correct
17 Incorrect 0 ms 348 KB Output isn't correct
18 Incorrect 0 ms 348 KB Output isn't correct
19 Incorrect 167 ms 608 KB Output isn't correct
20 Incorrect 29 ms 348 KB Output isn't correct
21 Correct 14 ms 344 KB Output is correct
22 Incorrect 12 ms 348 KB Output isn't correct
23 Incorrect 75 ms 488 KB Output isn't correct
24 Incorrect 72 ms 480 KB Output isn't correct
25 Execution timed out 1562 ms 1108 KB Time limit exceeded
26 Execution timed out 1576 ms 604 KB Time limit exceeded
27 Correct 885 ms 492 KB Output is correct
28 Incorrect 1429 ms 468 KB Output isn't correct
29 Execution timed out 1535 ms 928 KB Time limit exceeded
30 Execution timed out 1576 ms 852 KB Time limit exceeded
31 Execution timed out 1527 ms 2532 KB Time limit exceeded
32 Execution timed out 1553 ms 604 KB Time limit exceeded
33 Execution timed out 1533 ms 344 KB Time limit exceeded
34 Execution timed out 1508 ms 600 KB Time limit exceeded
35 Execution timed out 1574 ms 4948 KB Time limit exceeded
36 Execution timed out 1522 ms 4564 KB Time limit exceeded
37 Execution timed out 1530 ms 2284 KB Time limit exceeded
38 Execution timed out 1514 ms 4064 KB Time limit exceeded
39 Execution timed out 1506 ms 1104 KB Time limit exceeded
40 Execution timed out 1562 ms 1528 KB Time limit exceeded
41 Execution timed out 1547 ms 1616 KB Time limit exceeded
42 Execution timed out 1540 ms 1872 KB Time limit exceeded
43 Execution timed out 1559 ms 1968 KB Time limit exceeded
44 Execution timed out 1526 ms 2640 KB Time limit exceeded
45 Execution timed out 1523 ms 2264 KB Time limit exceeded
46 Execution timed out 1546 ms 2736 KB Time limit exceeded
47 Execution timed out 1533 ms 2896 KB Time limit exceeded
48 Execution timed out 1570 ms 2900 KB Time limit exceeded
49 Execution timed out 1559 ms 2900 KB Time limit exceeded
50 Execution timed out 1574 ms 1620 KB Time limit exceeded