oj.uz

Submission #711315

# Submission time Handle Problem Language Result Execution time Memory
711315 2023-03-16T14:55:45 Z Sam_a17 Marriage questions (IZhO14_marriage) C++17
86 / 100
 392 ms 3276 KB 
///////////////////////////////    _LeMur_
#define _CRT_SECURE_NO_WARNINGS
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cassert>
#include <chrono>
#include <random>
#include <bitset>
#include <cstdio>
#include <vector>
#include <string>
#include <stack>
#include <tuple>
#include <queue>
#include <ctime>
#include <cmath>
#include <list>
#include <map>
#include <set>
 
using namespace std;
 
const int N = 50005;
const int inf = 1000 * 1000 * 1000;
const int mod = 998244353;
// mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
mt19937 myrand(1337);
 
int n, m, k;
vector <int> g[N];
 
bool used[N];
int mt[N];
 
bool kuhn(int v, int L, int R) {
  if (used[v]) return false;
  used[v] = true;
  for (int i = 0; i < (int)g[v].size(); i++) {
    int to = g[v][i];
    if (to < L) continue;
    if (to > R) break;
    if (mt[to] == -1 || kuhn(mt[to], L, R)) {
      mt[to] = v;
      return true;
    }
  }
  return false;
}
 
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
 
  cin >> n >> m >> k;
 
  for (int i = 1; i <= k; i++) {
    int a, b;
    cin >> a >> b;
    a += m;
    g[a].push_back(b);
    g[b].push_back(a);
  }
 
  for (int i = 1; i <= m; i++) {
    sort(g[i].begin(), g[i].end());
  }
 
  int ina = m, inb = n, ind = -1;
  while (ina <= inb) {
    int mid = (ina + inb) / 2;
 
    for (int i = 1; i <= mid; i++) {
      mt[i + m] = -1;
    }
 
    int cnt = 0;
    for (int i = 1; i <= m; i++) {
      for (int j = 1; j <= m; j++) {
        used[j] = false;
      }
      bool flag = kuhn(i, 1, mid + m);
      if (flag) ++cnt;
    }
 
    if (cnt == m) {
      ind = mid;
      inb = mid - 1;
    } else {
      ina = mid + 1;
    }
  }
 
  if (ind == -1) {
    cout << 0 << endl;
    return 0;
  }
 
  for (int i = 1; i <= n; i++) {
    mt[i + m] = -1;
  }
 
  for (int i = 1; i <= m; i++) {
    for (int j = 1; j <= m; j++) {
      used[j] = false;
    }
    kuhn(i, 1, ind + m);
  }
 
  long long answ = n - ind + 1;
 
  for (int i = 1; i <= n; i++) {
    if (mt[i + m] == -1) {
      answ += n - ind + 1;
      continue;
    }
 
    int girl = mt[i + m];
    while (ind <= n) {
      for (int j = 1; j <= m; j++) {
        used[j] = false;
      }
      bool flag = kuhn(girl, i + 1, ind + m);
      if (flag) break;
      ++ind;
    }
    
    if (ind == n + 1) break;
    answ += n - ind + 1;
  }
  
  cout << answ << endl;
  return 0;
}

Subtask #1
86.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1492 KB Output is correct
4 Correct 1 ms 1492 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 1 ms 1492 KB Output is correct
7 Correct 1 ms 1492 KB Output is correct
8 Correct 1 ms 1492 KB Output is correct
9 Correct 1 ms 1492 KB Output is correct
10 Correct 1 ms 1492 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 1 ms 1492 KB Output is correct
13 Correct 1 ms 1492 KB Output is correct
14 Correct 1 ms 1492 KB Output is correct
15 Correct 1 ms 1492 KB Output is correct
16 Correct 1 ms 1492 KB Output is correct
17 Correct 1 ms 1492 KB Output is correct
18 Correct 1 ms 1492 KB Output is correct
19 Correct 2 ms 1492 KB Output is correct
20 Correct 1 ms 1492 KB Output is correct
21 Correct 1 ms 1492 KB Output is correct
22 Correct 1 ms 1492 KB Output is correct
23 Correct 1 ms 1492 KB Output is correct
24 Correct 1 ms 1492 KB Output is correct
25 Incorrect 13 ms 1620 KB Output isn't correct
26 Incorrect 3 ms 1492 KB Output isn't correct
27 Correct 1 ms 1492 KB Output is correct
28 Correct 1 ms 1492 KB Output is correct
29 Correct 3 ms 1620 KB Output is correct
30 Correct 3 ms 1620 KB Output is correct
31 Correct 154 ms 2004 KB Output is correct
32 Incorrect 6 ms 1600 KB Output isn't correct
33 Correct 2 ms 1492 KB Output is correct
34 Correct 14 ms 1576 KB Output is correct
35 Correct 74 ms 2596 KB Output is correct
36 Correct 50 ms 2516 KB Output is correct
37 Correct 332 ms 2248 KB Output is correct
38 Correct 16 ms 2768 KB Output is correct
39 Correct 284 ms 1796 KB Output is correct
40 Correct 6 ms 1832 KB Output is correct
41 Incorrect 20 ms 2012 KB Output isn't correct
42 Correct 7 ms 2132 KB Output is correct
43 Correct 11 ms 2260 KB Output is correct
44 Correct 19 ms 2616 KB Output is correct
45 Incorrect 14 ms 2412 KB Output isn't correct
46 Incorrect 143 ms 3212 KB Output isn't correct
47 Correct 22 ms 3004 KB Output is correct
48 Correct 20 ms 2908 KB Output is correct
49 Incorrect 180 ms 3276 KB Output isn't correct
50 Correct 392 ms 1996 KB Output is correct