oj.uz

Submission #91417

# Submission time Handle Problem Language Result Execution time Memory
91417 2018-12-27T11:56:49 Z mirbek01 Marriage questions (IZhO14_marriage) C++11
100 / 100
 445 ms 3444 KB 
# include <bits/stdc++.h>

using namespace std;

const int N = 33002;

int n, m, k, mt[N], used[N], ans, L, R, pt = 1;
vector <int> g[N], mr;

bool dfs(int v){
      if(used[v])
            return 0;
      used[v] = 1;
      for(int to : g[v]){
            if(to < L) break;
            if(to <= n && to > R)
                  continue;
            if(mt[to] == -1 || dfs(mt[to])){
                  mt[to] = v;
                  mt[v] = to;
                  return true;
            }
      }
      return false;
}

bool check(){
      while(!mr.empty()){
            int v = mr.back();
            if(mt[v] == -1){
                  memset(used, 0, sizeof(used));
                  if(!dfs(v))
                        return false;
            }
            mr.pop_back();
      }
      return mr.empty();
}

int main(){
      scanf("%d %d %d", &n, &m, &k);

      for(int i = 1; i <= k; i ++){
            int a, b;
            scanf("%d %d", &a, &b);
            g[a].push_back(b + n);
            g[b + n].push_back(a);
      }

      for(int i = n + 1; i <= n + m; i ++)
            sort(g[i].rbegin(), g[i].rend());

      memset(mt, -1, sizeof(mt));

      for(int i = n + 1; i <= n + m; i ++)
            mr.push_back(i);

      for(int i = 1; i <= n; i ++){
            L = i, R = pt;
            while(pt <= n && !check())
                  pt ++, R = pt;
            ans += n - pt + 1;
            if(mt[L] != -1){
                  mt[mt[L]] = -1;
                  mr.push_back(mt[L]);
            }
      }

      printf("%d", ans);
}

Compilation message

marriage.cpp: In function 'int main()':
marriage.cpp:41:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       scanf("%d %d %d", &n, &m, &k);
       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
marriage.cpp:45:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d %d", &a, &b);
             ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1272 KB Output is correct
2 Correct 3 ms 1396 KB Output is correct
3 Correct 2 ms 1472 KB Output is correct
4 Correct 3 ms 1488 KB Output is correct
5 Correct 2 ms 1488 KB Output is correct
6 Correct 2 ms 1488 KB Output is correct
7 Correct 2 ms 1508 KB Output is correct
8 Correct 2 ms 1508 KB Output is correct
9 Correct 3 ms 1564 KB Output is correct
10 Correct 2 ms 1564 KB Output is correct
11 Correct 2 ms 1564 KB Output is correct
12 Correct 2 ms 1564 KB Output is correct
13 Correct 2 ms 1564 KB Output is correct
14 Correct 3 ms 1564 KB Output is correct
15 Correct 3 ms 1564 KB Output is correct
16 Correct 2 ms 1564 KB Output is correct
17 Correct 2 ms 1564 KB Output is correct
18 Correct 2 ms 1564 KB Output is correct
19 Correct 4 ms 1584 KB Output is correct
20 Correct 4 ms 1584 KB Output is correct
21 Correct 3 ms 1628 KB Output is correct
22 Correct 3 ms 1632 KB Output is correct
23 Correct 3 ms 1632 KB Output is correct
24 Correct 3 ms 1632 KB Output is correct
25 Correct 18 ms 1760 KB Output is correct
26 Correct 10 ms 1760 KB Output is correct
27 Correct 5 ms 1760 KB Output is correct
28 Correct 6 ms 1760 KB Output is correct
29 Correct 8 ms 1760 KB Output is correct
30 Correct 8 ms 1760 KB Output is correct
31 Correct 116 ms 2156 KB Output is correct
32 Correct 14 ms 2156 KB Output is correct
33 Correct 8 ms 2156 KB Output is correct
34 Correct 13 ms 2156 KB Output is correct
35 Correct 158 ms 2684 KB Output is correct
36 Correct 131 ms 2684 KB Output is correct
37 Correct 327 ms 2684 KB Output is correct
38 Correct 46 ms 2940 KB Output is correct
39 Correct 183 ms 2940 KB Output is correct
40 Correct 65 ms 2940 KB Output is correct
41 Correct 85 ms 2940 KB Output is correct
42 Correct 106 ms 2940 KB Output is correct
43 Correct 110 ms 2940 KB Output is correct
44 Correct 127 ms 2940 KB Output is correct
45 Correct 213 ms 2940 KB Output is correct
46 Correct 294 ms 3196 KB Output is correct
47 Correct 216 ms 3196 KB Output is correct
48 Correct 221 ms 3196 KB Output is correct
49 Correct 313 ms 3444 KB Output is correct
50 Correct 445 ms 3444 KB Output is correct