oj.uz

답안 #1027754

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1027754 2024-07-19T09:39:18 Z caterpillow 결혼 문제 (IZhO14_marriage) C++17
32 / 100
 1500 ms 2700 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<vt<int>> adj; // l -> r
vt<int> mate; // mate = rhs -> lhs
vt<bool> seen;

bool dfs(int u, int l, int r) {
    assert(u != -1);
    if (seen[u]) return false;
    seen[u] = true;
    for (int v : adj[u]) {
        assert(l <= v && v <= r);
        if (mate[v] == -1 || dfs(mate[v], l, r)) {
            mate[v] = u;
            return true;
        }
    }
    return false;
}

bool check_perfect_matching(int l, int r) {
    seen.assign(n, 0);
    mate.assign(m, -1);
    F0R (i, n) {
        if (!dfs(i, l, r)) 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].pb(i);
                }
            }
            if (check_perfect_matching(l, r)) ans++;
        }
    }
    cout << ans << endl;
}

Compilation message

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

Subtask #1
32.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Incorrect 0 ms 344 KB Output isn't 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 0 ms 348 KB Output isn't correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Incorrect 0 ms 344 KB Output isn't correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Incorrect 0 ms 348 KB Output isn't correct
15 Incorrect 0 ms 348 KB Output isn't correct
16 Incorrect 1 ms 348 KB Output isn't correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Incorrect 16 ms 496 KB Output isn't correct
20 Incorrect 4 ms 348 KB Output isn't correct
21 Correct 3 ms 348 KB Output is correct
22 Incorrect 3 ms 460 KB Output isn't correct
23 Correct 11 ms 348 KB Output is correct
24 Correct 9 ms 468 KB Output is correct
25 Execution timed out 1529 ms 624 KB Time limit exceeded
26 Incorrect 360 ms 600 KB Output isn't correct
27 Correct 155 ms 600 KB Output is correct
28 Incorrect 162 ms 348 KB Output isn't correct
29 Correct 1310 ms 344 KB Output is correct
30 Correct 1095 ms 344 KB Output is correct
31 Execution timed out 1536 ms 860 KB Time limit exceeded
32 Execution timed out 1556 ms 348 KB Time limit exceeded
33 Correct 1382 ms 344 KB Output is correct
34 Execution timed out 1575 ms 348 KB Time limit exceeded
35 Execution timed out 1538 ms 1428 KB Time limit exceeded
36 Execution timed out 1564 ms 1364 KB Time limit exceeded
37 Execution timed out 1556 ms 1200 KB Time limit exceeded
38 Execution timed out 1559 ms 1780 KB Time limit exceeded
39 Execution timed out 1553 ms 852 KB Time limit exceeded
40 Execution timed out 1544 ms 1056 KB Time limit exceeded
41 Execution timed out 1548 ms 1112 KB Time limit exceeded
42 Execution timed out 1555 ms 1620 KB Time limit exceeded
43 Execution timed out 1530 ms 1368 KB Time limit exceeded
44 Execution timed out 1585 ms 1856 KB Time limit exceeded
45 Execution timed out 1537 ms 2128 KB Time limit exceeded
46 Execution timed out 1517 ms 2612 KB Time limit exceeded
47 Execution timed out 1543 ms 2204 KB Time limit exceeded
48 Execution timed out 1567 ms 2388 KB Time limit exceeded
49 Execution timed out 1515 ms 2700 KB Time limit exceeded
50 Execution timed out 1536 ms 1368 KB Time limit exceeded