oj.uz

답안 #91513

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
91513 2018-12-28T02:35:56 Z mirbek01 결혼 문제 (IZhO14_marriage) C++11
100 / 100
 325 ms 9132 KB 
# include <bits/stdc++.h>

using namespace std;

const int N = 33002;

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

bool dfs(int v){
      if(used[v] == cnt)
            return 0;
      used[v] = cnt;
      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){
                  cnt ++;
                  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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1272 KB Output is correct
2 Correct 2 ms 1408 KB Output is correct
3 Correct 3 ms 1408 KB Output is correct
4 Correct 2 ms 1408 KB Output is correct
5 Correct 2 ms 1416 KB Output is correct
6 Correct 2 ms 1548 KB Output is correct
7 Correct 2 ms 1548 KB Output is correct
8 Correct 3 ms 1548 KB Output is correct
9 Correct 3 ms 1548 KB Output is correct
10 Correct 2 ms 1548 KB Output is correct
11 Correct 2 ms 1548 KB Output is correct
12 Correct 2 ms 1572 KB Output is correct
13 Correct 2 ms 1584 KB Output is correct
14 Correct 2 ms 1584 KB Output is correct
15 Correct 2 ms 1584 KB Output is correct
16 Correct 2 ms 1584 KB Output is correct
17 Correct 2 ms 1620 KB Output is correct
18 Correct 2 ms 1632 KB Output is correct
19 Correct 4 ms 1632 KB Output is correct
20 Correct 3 ms 1632 KB Output is correct
21 Correct 2 ms 1668 KB Output is correct
22 Correct 2 ms 1668 KB Output is correct
23 Correct 3 ms 1668 KB Output is correct
24 Correct 2 ms 1668 KB Output is correct
25 Correct 14 ms 1784 KB Output is correct
26 Correct 4 ms 1784 KB Output is correct
27 Correct 3 ms 1784 KB Output is correct
28 Correct 2 ms 1784 KB Output is correct
29 Correct 4 ms 1860 KB Output is correct
30 Correct 4 ms 1928 KB Output is correct
31 Correct 120 ms 2880 KB Output is correct
32 Correct 4 ms 2880 KB Output is correct
33 Correct 2 ms 2880 KB Output is correct
34 Correct 4 ms 2880 KB Output is correct
35 Correct 173 ms 4068 KB Output is correct
36 Correct 141 ms 4632 KB Output is correct
37 Correct 325 ms 4764 KB Output is correct
38 Correct 26 ms 6032 KB Output is correct
39 Correct 87 ms 6032 KB Output is correct
40 Correct 6 ms 6032 KB Output is correct
41 Correct 11 ms 6032 KB Output is correct
42 Correct 11 ms 6032 KB Output is correct
43 Correct 15 ms 6532 KB Output is correct
44 Correct 24 ms 7876 KB Output is correct
45 Correct 14 ms 7876 KB Output is correct
46 Correct 42 ms 9024 KB Output is correct
47 Correct 30 ms 9024 KB Output is correct
48 Correct 27 ms 9024 KB Output is correct
49 Correct 43 ms 9132 KB Output is correct
50 Correct 252 ms 9132 KB Output is correct