oj.uz

Submission #363288

# Submission time Handle Problem Language Result Execution time Memory
363288 2021-02-05T12:35:39 Z SamAnd Marriage questions (IZhO14_marriage) C++17
16 / 100
 32 ms 1004 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 = upper_bound(all(g[x]), l) - g[x].begin() - 1;
    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
16.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Incorrect 1 ms 364 KB Output isn't correct
4 Incorrect 1 ms 364 KB Output isn't correct
5 Incorrect 1 ms 364 KB Output isn't correct
6 Incorrect 1 ms 364 KB Output isn't correct
7 Incorrect 1 ms 364 KB Output isn't 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 Incorrect 1 ms 364 KB Output isn't correct
12 Correct 1 ms 364 KB Output is correct
13 Incorrect 1 ms 364 KB Output isn't correct
14 Incorrect 1 ms 364 KB Output isn't correct
15 Incorrect 1 ms 364 KB Output isn't correct
16 Incorrect 1 ms 364 KB Output isn't correct
17 Incorrect 1 ms 364 KB Output isn't correct
18 Incorrect 1 ms 364 KB Output isn't correct
19 Incorrect 1 ms 364 KB Output isn't correct
20 Incorrect 1 ms 364 KB Output isn't correct
21 Correct 1 ms 364 KB Output is correct
22 Incorrect 1 ms 364 KB Output isn't correct
23 Incorrect 1 ms 364 KB Output isn't correct
24 Incorrect 1 ms 364 KB Output isn't correct
25 Incorrect 3 ms 492 KB Output isn't correct
26 Incorrect 1 ms 364 KB Output isn't correct
27 Correct 1 ms 364 KB Output is correct
28 Incorrect 1 ms 364 KB Output isn't correct
29 Incorrect 2 ms 364 KB Output isn't correct
30 Incorrect 2 ms 364 KB Output isn't correct
31 Incorrect 12 ms 620 KB Output isn't correct
32 Incorrect 2 ms 364 KB Output isn't correct
33 Correct 1 ms 364 KB Output is correct
34 Incorrect 1 ms 364 KB Output isn't correct
35 Incorrect 20 ms 896 KB Output isn't correct
36 Incorrect 17 ms 876 KB Output isn't correct
37 Incorrect 13 ms 748 KB Output isn't correct
38 Incorrect 21 ms 876 KB Output isn't correct
39 Incorrect 2 ms 492 KB Output isn't correct
40 Correct 4 ms 492 KB Output is correct
41 Incorrect 9 ms 620 KB Output isn't correct
42 Incorrect 8 ms 492 KB Output isn't correct
43 Incorrect 12 ms 620 KB Output isn't correct
44 Incorrect 21 ms 876 KB Output isn't correct
45 Incorrect 11 ms 620 KB Output isn't correct
46 Incorrect 28 ms 1004 KB Output isn't correct
47 Incorrect 24 ms 1004 KB Output isn't correct
48 Incorrect 22 ms 880 KB Output isn't correct
49 Incorrect 32 ms 1004 KB Output isn't correct
50 Incorrect 4 ms 492 KB Output isn't correct