oj.uz

답안 #363296

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
363296 2021-02-05T12:48:19 Z SamAnd 결혼 문제 (IZhO14_marriage) C++17
100 / 100
 317 ms 1132 KB 
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 30004, M = 2003;

int n, m, k;
vector<int> g[M];

int u[N];
int uu[M];
bool c[M];
int s[N];
bool dfs(int x, int l, int r)
{
    if (c[x])
        return false;
    c[x] = true;
    while (s[x] < sz(g[x]) && g[x][s[x]] < l)
        ++s[x];
    for (int i = s[x]; i < g[x].size(); ++i)
    {
        int h = g[x][i];
        if (h > r)
            break;
        if (u[h] == 0)
        {
            u[h] = x;
            uu[x] = h;
            return true;
        }
        else
        {
            if (dfs(u[h], l, r))
            {
                u[h] = x;
                uu[x] = h;
                return true;
            }
        }
    }
    return false;
}

void solv()
{
    scanf("%d%d%d", &n, &m, &k);
    for (int i = 0; i < k; ++i)
    {
        int x, y;
        scanf("%d%d", &x, &y);
        g[y].push_back(x);
    }
    for (int i = 1; i <= m; ++i)
        sort(all(g[i]));

    int ans = 0;
    int r = 0;
    queue<int> q;
    for (int i = 1; i <= m; ++i)
        q.push(i);
    for (int l = 1; l <= n; ++l)
    {
        while (1)
        {
            while (1)
            {
                if (q.empty())
                    break;
                memset(c, false, sizeof c);
                if (dfs(q.front(), l, r))
                {
                    q.pop();
                    continue;
                }
                break;
            }
            if (q.empty())
                break;
            ++r;
            if (r == n + 1)
                break;
        }
        if (r == n + 1)
            break;
        ans += (n - r + 1);
        if (u[l])
        {
            q.push(u[l]);
            uu[u[l]] = 0;
            u[l] = 0;
        }
    }
    printf("%d\n", ans);
}

int main()
{
    #ifdef SOMETHING
    freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    #endif // SOMETHING
    //ios_base::sync_with_stdio(false), cin.tie(0);
    solv();
    return 0;
}

Compilation message

marriage.cpp: In function 'bool dfs(int, int, int)':
marriage.cpp:27:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     for (int i = s[x]; i < g[x].size(); ++i)
      |                        ~~^~~~~~~~~~~~~
marriage.cpp: In function 'void solv()':
marriage.cpp:53:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   53 |     scanf("%d%d%d", &n, &m, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
marriage.cpp:57:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   57 |         scanf("%d%d", &x, &y);
      |         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 2 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 11 ms 492 KB Output is correct
26 Correct 3 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 4 ms 492 KB Output is correct
30 Correct 2 ms 492 KB Output is correct
31 Correct 112 ms 748 KB Output is correct
32 Correct 3 ms 492 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 5 ms 492 KB Output is correct
35 Correct 108 ms 988 KB Output is correct
36 Correct 78 ms 1004 KB Output is correct
37 Correct 317 ms 876 KB Output is correct
38 Correct 21 ms 876 KB Output is correct
39 Correct 110 ms 620 KB Output is correct
40 Correct 4 ms 492 KB Output is correct
41 Correct 10 ms 620 KB Output is correct
42 Correct 8 ms 620 KB Output is correct
43 Correct 12 ms 748 KB Output is correct
44 Correct 21 ms 1004 KB Output is correct
45 Correct 13 ms 748 KB Output is correct
46 Correct 126 ms 1132 KB Output is correct
47 Correct 24 ms 1004 KB Output is correct
48 Correct 22 ms 1004 KB Output is correct
49 Correct 157 ms 1132 KB Output is correct
50 Correct 240 ms 620 KB Output is correct