oj.uz

Submission #91387

# Submission time Handle Problem Language Result Execution time Memory
91387 2018-12-27T09:59:54 Z mirbek01 Marriage questions (IZhO14_marriage) C++11
78 / 100
 1500 ms 12356 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(mt[L] == -1)
            return true;
      while(!mr.empty()){
            int v = mr.back();
            for(int i = 0; i < vr.size(); i ++){
                  used[vr[i]] = 0;
            }
            if(!dfs(v)){
                  break;
            }
            mr.pop_back();
      }
      return mr.empty();
}

bool ok(){
      for(int i = n + 1; i <= n + m; i ++){
            if(mt[i] != -1){
                  mt[ mt[i] ] = -1;
                  mt[i] = -1;
            }
      }
      for(int i = n + 1; i <= n + m; i ++){
            for(int j = 0; j < (int)vr.size(); j ++){
                  used[ vr[j] ] = 0;
            }
            vr.clear();
            dfs(i);
      }
      for(int i = n + 1; i <= n + m; i ++){
            if(mt[i] == -1)
                  return false;
      }
      return true;
}

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));

      int lo = 1, hi = n + 1;

      L = 1;

      while(lo < hi){
            int md = (lo + hi) >> 1;
            R = md;
            if(ok())
                  hi = md;
            else
                  lo = md + 1;
      }
      R = lo;
      if(lo > n){
            cout << 0 << endl;
            return 0;
      }

      ans += n - lo + 1;

      R = lo;
      ok();

      if(mt[L] != -1){
            mt[mt[L]] = -1;
            mr.push_back(mt[L]);
      }

      int pt = lo;

      for(int i = 2; i <= n - m + 1; 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:32:30: 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:65: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:69: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
78.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3064 KB Output is correct
2 Incorrect 4 ms 3244 KB Output isn't correct
3 Incorrect 4 ms 3244 KB Output isn't correct
4 Correct 4 ms 3244 KB Output is correct
5 Correct 4 ms 3244 KB Output is correct
6 Correct 4 ms 3244 KB Output is correct
7 Correct 4 ms 3244 KB Output is correct
8 Correct 4 ms 3244 KB Output is correct
9 Correct 4 ms 3244 KB Output is correct
10 Correct 4 ms 3244 KB Output is correct
11 Correct 4 ms 3244 KB Output is correct
12 Correct 4 ms 3244 KB Output is correct
13 Incorrect 3 ms 3244 KB Output isn't correct
14 Correct 3 ms 3268 KB Output is correct
15 Correct 4 ms 3268 KB Output is correct
16 Correct 3 ms 3268 KB Output is correct
17 Correct 3 ms 3268 KB Output is correct
18 Correct 3 ms 3280 KB Output is correct
19 Correct 6 ms 3284 KB Output is correct
20 Correct 4 ms 3284 KB Output is correct
21 Correct 3 ms 3284 KB Output is correct
22 Correct 4 ms 3296 KB Output is correct
23 Correct 4 ms 3296 KB Output is correct
24 Correct 4 ms 3296 KB Output is correct
25 Correct 46 ms 4128 KB Output is correct
26 Incorrect 15 ms 4128 KB Output isn't correct
27 Correct 4 ms 4128 KB Output is correct
28 Correct 6 ms 4128 KB Output is correct
29 Correct 6 ms 4128 KB Output is correct
30 Correct 6 ms 4128 KB Output is correct
31 Correct 425 ms 6120 KB Output is correct
32 Correct 14 ms 6120 KB Output is correct
33 Correct 4 ms 6120 KB Output is correct
34 Correct 27 ms 6120 KB Output is correct
35 Correct 183 ms 6120 KB Output is correct
36 Correct 137 ms 6120 KB Output is correct
37 Execution timed out 1566 ms 12356 KB Time limit exceeded
38 Correct 32 ms 12356 KB Output is correct
39 Execution timed out 1560 ms 12356 KB Time limit exceeded
40 Correct 9 ms 12356 KB Output is correct
41 Incorrect 149 ms 12356 KB Output isn't correct
42 Correct 12 ms 12356 KB Output is correct
43 Correct 17 ms 12356 KB Output is correct
44 Correct 27 ms 12356 KB Output is correct
45 Incorrect 218 ms 12356 KB Output isn't correct
46 Execution timed out 1571 ms 12356 KB Time limit exceeded
47 Correct 32 ms 12356 KB Output is correct
48 Correct 30 ms 12356 KB Output is correct
49 Execution timed out 1551 ms 12356 KB Time limit exceeded
50 Execution timed out 1580 ms 12356 KB Time limit exceeded