Submission #38996

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
38996	2018-01-09T03:53:45 Z	RockyB	Marriage questions (IZhO14_marriage)	C++14	62 / 100	1500 ms	3584 KB

marriage

/// In The Name Of God
 
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
 
#include <bits/stdc++.h>
 
#define f first
#define s second
 
#define pb push_back
#define pp pop_back
#define mp make_pair
 
#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()
 
#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
 
#define nl '\n'
#define ioi exit(0);
 
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
 
const int N = (int)3e4 + 7, inf = (int)1e9 + 7, mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1}, dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
 
using namespace std;
 
int n, m, k;
vector <int> g[N];
 
int tmr;
int p[N];

bool was[N];
 
int dfs(int v, int L, int R) {
	if (was[v]) return 0;
	was[v] = 1;
	for (auto to : g[v]) {
		if (!(L <= to && to <= R)) continue; 
		if (p[to] == -1 || dfs(p[to], L, R)) {
			p[to] = v;
			return 1;
		}
	}
	return 0;
}
bool good[N];
int ok(int L, int R) {
	L += m, R += m;
	memset(p, -1, sizeof(p));
	memset(was, 0, sizeof(was));
	memset(good, 0, sizeof(good));
	for (int i = 1; i <= m; i++) {
		for (auto to : g[i]) {
			if (p[to] == -1 && L <= to && to <= R) {
				p[to] = i;
				good[i] = 1;
				break;
			}
		}
	}
	for (int i = 1; i <= m; i++) {
		if (good[i]) continue;
		memset(was, 0, sizeof(was));
		dfs(i, L, R);
	}
	int cnt = 0;
	for (int j = m + 1; j <= n + m; j++) {
		cnt += p[j] != -1;
		//cerr << p[j] << nl;
	}
	if (cnt == m) return 1;
	return 0;
}
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	Kazakhstan
	cin >> n >> m >> k;
	for (int i = 1; i <= k; i++) {
		int a, b;
		cin >> b >> a;
		g[a].pb(b + m);
	}
	for (int i =1 ; i <= m; i++) {
		sort(all(g[i]));
	}
	int ans = 0;
	for (int i = 1; i <= n; i++) {
		int l = i, r = n, res = n + 1;
		while (l <= r) {
			int mid = l + r >> 1;
			if (ok(i, mid)) res = mid, r = mid - 1;
			else l = mid + 1;
		}
		ans += n - res + 1;
	}
	cout << ans;
	ioi
}

Compilation message

marriage.cpp: In function 'int main()':
marriage.cpp:100:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
    int mid = l + r >> 1;
                ^

Subtask #1

62.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	3056 KB	Output is correct
2	Correct	0 ms	3056 KB	Output is correct
3	Correct	0 ms	3056 KB	Output is correct
4	Correct	0 ms	3056 KB	Output is correct
5	Correct	0 ms	3056 KB	Output is correct
6	Correct	0 ms	3056 KB	Output is correct
7	Correct	0 ms	3056 KB	Output is correct
8	Correct	0 ms	3056 KB	Output is correct
9	Correct	0 ms	3056 KB	Output is correct
10	Correct	0 ms	3056 KB	Output is correct
11	Correct	0 ms	3056 KB	Output is correct
12	Correct	0 ms	3056 KB	Output is correct
13	Correct	0 ms	3056 KB	Output is correct
14	Correct	0 ms	3056 KB	Output is correct
15	Correct	0 ms	3056 KB	Output is correct
16	Correct	0 ms	3056 KB	Output is correct
17	Correct	0 ms	3056 KB	Output is correct
18	Correct	0 ms	3056 KB	Output is correct
19	Correct	46 ms	3056 KB	Output is correct
20	Correct	19 ms	3056 KB	Output is correct
21	Correct	13 ms	3056 KB	Output is correct
22	Correct	13 ms	3056 KB	Output is correct
23	Correct	16 ms	3056 KB	Output is correct
24	Correct	16 ms	3056 KB	Output is correct
25	Correct	946 ms	3056 KB	Output is correct
26	Correct	319 ms	3056 KB	Output is correct
27	Correct	89 ms	3056 KB	Output is correct
28	Correct	146 ms	3056 KB	Output is correct
29	Correct	159 ms	3056 KB	Output is correct
30	Correct	149 ms	3056 KB	Output is correct
31	Execution timed out	1500 ms	3320 KB	Execution timed out
32	Execution timed out	1500 ms	3056 KB	Execution timed out
33	Execution timed out	1500 ms	3056 KB	Execution timed out
34	Correct	1333 ms	3056 KB	Output is correct
35	Execution timed out	1500 ms	3584 KB	Execution timed out
36	Execution timed out	1500 ms	3584 KB	Execution timed out
37	Execution timed out	1500 ms	3320 KB	Execution timed out
38	Execution timed out	1500 ms	3584 KB	Execution timed out
39	Execution timed out	1500 ms	3056 KB	Execution timed out
40	Execution timed out	1500 ms	3056 KB	Execution timed out
41	Execution timed out	1500 ms	3188 KB	Execution timed out
42	Execution timed out	1500 ms	3188 KB	Execution timed out
43	Execution timed out	1500 ms	3320 KB	Execution timed out
44	Execution timed out	1500 ms	3584 KB	Execution timed out
45	Execution timed out	1500 ms	3188 KB	Execution timed out
46	Execution timed out	1500 ms	3584 KB	Execution timed out
47	Execution timed out	1500 ms	3584 KB	Execution timed out
48	Execution timed out	1500 ms	3584 KB	Execution timed out
49	Execution timed out	1500 ms	3584 KB	Execution timed out
50	Execution timed out	1500 ms	3056 KB	Execution timed out