oj.uz

Submission #363289

# Submission time Handle Problem Language Result Execution time Memory
363289 2021-02-05T12:36:40 Z SamAnd Marriage questions (IZhO14_marriage) C++17
80 / 100
 1500 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];
bool dfs(int x, int l, int r)
{
    if (c[x])
        return false;
    c[x] = true;
    int s = lower_bound(all(g[x]), l) - g[x].begin();
    for (int i = s; 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;
    for (int l = 1; l <= n; ++l)
    {
        int i = 1;
        while (1)
        {
            while (1)
            {
                if (i == m + 1)
                    break;
                memset(c, false, sizeof c);
                if (dfs(i, l, r))
                {
                    ++i;
                    continue;
                }
                break;
            }
            if (i == m + 1)
                break;
            ++r;
            if (r == n + 1)
                break;
        }
        if (r == n + 1)
            break;
        ans += (n - r + 1);
        for (int i = 1; i <= n; ++i)
        {
            u[uu[i]] = 0;
            uu[i] = 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:25:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |     for (int i = s; i < g[x].size(); ++i)
      |                     ~~^~~~~~~~~~~~~
marriage.cpp: In function 'void solv()':
marriage.cpp:51:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   51 |     scanf("%d%d%d", &n, &m, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
marriage.cpp:55:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   55 |         scanf("%d%d", &x, &y);
      |         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
80.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 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 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 0 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 6 ms 364 KB Output is correct
20 Correct 2 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 3 ms 364 KB Output is correct
24 Correct 2 ms 364 KB Output is correct
25 Correct 146 ms 492 KB Output is correct
26 Correct 30 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 21 ms 364 KB Output is correct
29 Correct 5 ms 492 KB Output is correct
30 Correct 4 ms 492 KB Output is correct
31 Execution timed out 1504 ms 748 KB Time limit exceeded
32 Correct 121 ms 492 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 563 ms 492 KB Output is correct
35 Execution timed out 1599 ms 1024 KB Time limit exceeded
36 Execution timed out 1566 ms 876 KB Time limit exceeded
37 Execution timed out 1551 ms 824 KB Time limit exceeded
38 Correct 121 ms 968 KB Output is correct
39 Execution timed out 1567 ms 620 KB Time limit exceeded
40 Correct 5 ms 492 KB Output is correct
41 Execution timed out 1577 ms 620 KB Time limit exceeded
42 Correct 14 ms 620 KB Output is correct
43 Correct 22 ms 748 KB Output is correct
44 Correct 33 ms 1004 KB Output is correct
45 Execution timed out 1570 ms 748 KB Time limit exceeded
46 Execution timed out 1562 ms 1132 KB Time limit exceeded
47 Correct 43 ms 1004 KB Output is correct
48 Correct 40 ms 1132 KB Output is correct
49 Execution timed out 1585 ms 1120 KB Time limit exceeded
50 Execution timed out 1580 ms 748 KB Time limit exceeded