oj.uz

Submission #345336

# Submission time Handle Problem Language Result Execution time Memory
345336 2021-01-07T07:41:53 Z maskoff Marriage questions (IZhO14_marriage) C++14
72 / 100
 1500 ms 25408 KB 
#include <bits/stdc++.h>

#define file ""

#define all(x) x.begin(), x.end()

#define sc second
#define fr first

#define pb push_back
#define mp make_pair

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const ll inf = 1e18 + 5;
const ll mod = 1e9 + 7;

const int N = 5e5 + 5;

int dx[] = {+1, 0, -1, 0};
int dy[] = {0, +1, 0, -1};


int n, m, k, timer;
int used[N], mt[N], pr[N], s[N];
vector<int> g[N], all[N];

bool go(int v) {
	if (used[v] == timer) return false;
	used[v] = timer;

 	for (int i = s[v]; i < g[v].size(); i++) {
  	int to = g[v][i];
 		if (mt[to] == false) {
 		 	mt[to] = v;
 		 	pr[v] = to;
 		 	return true;
 		}
 	}
 	  
 	for (int i = s[v]; i < g[v].size(); i++) {
 		int to = g[v][i];
		if (go(mt[to])) {
		 	mt[to] = v;
		 	pr[v] = to;
		 	return true;
		}
	}

	return false;
}

bool check(int y, int p) {
	fill (pr + 1, pr + 1 + m, false);

	for (int j : all[p])
		g[j].pb(p);
	
	for (int i = 1; i <= m; i++) {
		timer++;
		go(i);
	}
	
	int ok = true;
	for (int i = 1; i <= m; i++) 
		if (pr[i] == 0) ok = false;
		else mt[pr[i]] = false;
	
	return ok;
}

void clear(int x) {
 	for (int j : all[x])	
 		s[j]++;
}                   

int main() { 
	ios_base :: sync_with_stdio(false);               
	cin.tie(nullptr);
	srand(time(nullptr));
	cin >> n >> m >> k;
	for (int x, y, i = 1; i <= k; i++) {
		cin >> x >> y;
	 	all[x].pb(y);
	}
	ll res = 0;
	int last = m;
	int j = 1;
	for (int i = 1; i <= n; i++) {
		int p = check(i, j);
		while (j <= n && !p) {
			j++;
			if (j == n + 1) break;
			p = check(i, j);
	 	}
	 	//cerr << i << " " << j << endl;
	 	if (j == n + 1) break;
	 	if (p) res += n - j + 1;
	 	else break;
	 	clear(i);
	}
	cout << res;
  return 0;              
}

Compilation message

marriage.cpp: In function 'bool go(int)':
marriage.cpp:35:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |   for (int i = s[v]; i < g[v].size(); i++) {
      |                      ~~^~~~~~~~~~~~~
marriage.cpp:44:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |   for (int i = s[v]; i < g[v].size(); i++) {
      |                      ~~^~~~~~~~~~~~~
marriage.cpp: In function 'int main()':
marriage.cpp:90:6: warning: unused variable 'last' [-Wunused-variable]
   90 |  int last = m;
      |      ^~~~

Subtask #1
72.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 23788 KB Output isn't correct
2 Correct 15 ms 23788 KB Output is correct
3 Correct 20 ms 23788 KB Output is correct
4 Correct 15 ms 23860 KB Output is correct
5 Correct 16 ms 23788 KB Output is correct
6 Correct 14 ms 23808 KB Output is correct
7 Incorrect 15 ms 23908 KB Output isn't correct
8 Correct 16 ms 23788 KB Output is correct
9 Correct 17 ms 23788 KB Output is correct
10 Correct 18 ms 23788 KB Output is correct
11 Correct 17 ms 23788 KB Output is correct
12 Correct 17 ms 23788 KB Output is correct
13 Incorrect 18 ms 23788 KB Output isn't correct
14 Correct 17 ms 23788 KB Output is correct
15 Incorrect 17 ms 23916 KB Output isn't correct
16 Correct 18 ms 23788 KB Output is correct
17 Correct 17 ms 23788 KB Output is correct
18 Correct 17 ms 23788 KB Output is correct
19 Incorrect 21 ms 23916 KB Output isn't correct
20 Incorrect 17 ms 23916 KB Output isn't correct
21 Correct 16 ms 23788 KB Output is correct
22 Correct 20 ms 23788 KB Output is correct
23 Correct 16 ms 23924 KB Output is correct
24 Correct 19 ms 23916 KB Output is correct
25 Incorrect 63 ms 24060 KB Output isn't correct
26 Incorrect 25 ms 23916 KB Output isn't correct
27 Correct 15 ms 23916 KB Output is correct
28 Correct 16 ms 23916 KB Output is correct
29 Correct 17 ms 23916 KB Output is correct
30 Correct 17 ms 23916 KB Output is correct
31 Execution timed out 1572 ms 24284 KB Time limit exceeded
32 Correct 400 ms 23972 KB Output is correct
33 Correct 29 ms 23916 KB Output is correct
34 Correct 35 ms 23916 KB Output is correct
35 Correct 231 ms 25068 KB Output is correct
36 Correct 173 ms 25072 KB Output is correct
37 Execution timed out 1594 ms 24304 KB Time limit exceeded
38 Correct 83 ms 25200 KB Output is correct
39 Correct 579 ms 24172 KB Output is correct
40 Correct 469 ms 24172 KB Output is correct
41 Correct 712 ms 24440 KB Output is correct
42 Correct 184 ms 24512 KB Output is correct
43 Correct 218 ms 24640 KB Output is correct
44 Correct 347 ms 25068 KB Output is correct
45 Execution timed out 1567 ms 25092 KB Time limit exceeded
46 Execution timed out 1584 ms 25104 KB Time limit exceeded
47 Correct 712 ms 25408 KB Output is correct
48 Correct 720 ms 25336 KB Output is correct
49 Execution timed out 1585 ms 24940 KB Time limit exceeded
50 Execution timed out 1582 ms 24300 KB Time limit exceeded