oj.uz

Submission #91402

# Submission time Handle Problem Language Result Execution time Memory
91402 2018-12-27T11:15:13 Z mirbek01 Marriage questions (IZhO14_marriage) C++11
90 / 100
 1500 ms 20188 KB 
# include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 2;

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

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

bool check(){
      if(mr.empty())
            return true;
      while(!mr.empty()){
            int v = mr.back();
            if(mt[v] == -1){
                  for(int i = 0; i < vr.size(); i ++){
                        used[vr[i]] = 0;
                  }
                  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 = 1; i <= n + m; i ++){
            sort(g[i].begin(), g[i].end());
      }

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

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

      int pt = 1;

      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 'bool check()':
marriage.cpp:33:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                   for(int i = 0; i < vr.size(); i ++){
                                  ~~^~~~~~~~~~~
marriage.cpp: In function 'int main()':
marriage.cpp:45: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:49: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
90.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3064 KB Output is correct
2 Correct 3 ms 3064 KB Output is correct
3 Correct 4 ms 3096 KB Output is correct
4 Correct 4 ms 3144 KB Output is correct
5 Correct 3 ms 3320 KB Output is correct
6 Correct 4 ms 3376 KB Output is correct
7 Correct 4 ms 3376 KB Output is correct
8 Correct 4 ms 3376 KB Output is correct
9 Correct 4 ms 3376 KB Output is correct
10 Correct 4 ms 3376 KB Output is correct
11 Correct 4 ms 3376 KB Output is correct
12 Correct 3 ms 3384 KB Output is correct
13 Correct 4 ms 3384 KB Output is correct
14 Correct 3 ms 3384 KB Output is correct
15 Correct 4 ms 3384 KB Output is correct
16 Correct 4 ms 3384 KB Output is correct
17 Correct 4 ms 3384 KB Output is correct
18 Correct 4 ms 3384 KB Output is correct
19 Correct 6 ms 3396 KB Output is correct
20 Correct 5 ms 3396 KB Output is correct
21 Correct 4 ms 3396 KB Output is correct
22 Correct 4 ms 3396 KB Output is correct
23 Correct 4 ms 3396 KB Output is correct
24 Correct 4 ms 3396 KB Output is correct
25 Correct 47 ms 4044 KB Output is correct
26 Correct 16 ms 4044 KB Output is correct
27 Correct 4 ms 4044 KB Output is correct
28 Correct 5 ms 4044 KB Output is correct
29 Correct 7 ms 4044 KB Output is correct
30 Correct 6 ms 4044 KB Output is correct
31 Correct 530 ms 8220 KB Output is correct
32 Correct 16 ms 8220 KB Output is correct
33 Correct 4 ms 8220 KB Output is correct
34 Correct 11 ms 8220 KB Output is correct
35 Correct 193 ms 8220 KB Output is correct
36 Correct 141 ms 8220 KB Output is correct
37 Execution timed out 1557 ms 12500 KB Time limit exceeded
38 Correct 34 ms 12500 KB Output is correct
39 Execution timed out 1576 ms 20180 KB Time limit exceeded
40 Correct 35 ms 20180 KB Output is correct
41 Correct 223 ms 20180 KB Output is correct
42 Correct 89 ms 20180 KB Output is correct
43 Correct 84 ms 20180 KB Output is correct
44 Correct 102 ms 20180 KB Output is correct
45 Correct 567 ms 20180 KB Output is correct
46 Execution timed out 1558 ms 20180 KB Time limit exceeded
47 Correct 298 ms 20180 KB Output is correct
48 Correct 292 ms 20180 KB Output is correct
49 Execution timed out 1583 ms 20180 KB Time limit exceeded
50 Execution timed out 1584 ms 20188 KB Time limit exceeded