Submission #39067

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
39067	2018-01-09T06:52:27 Z	RockyB	Marriage questions (IZhO14_marriage)	C++14	68 / 100	1500 ms	3832 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)32000 + 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, tmr1;
int p[N];

int was[N], good[N];
int dfs(int v, int L, int R) {
	if (was[v] == tmr) return 0;
	was[v] = tmr;
	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;
}
int ok(int L, int R) {
	L += m, R += m;
	memset(p, -1, sizeof(p));
	++tmr;
	++tmr1;
	int cnt = 0;
	for (int i = m; i >= 1; i--) {
		for (auto to : g[i]) {
			if (p[to] == -1 && L <= to && to <= R) {
				p[to] = i;
				good[i] = tmr1;
				++cnt;
				break;
			}
		}
	}
	if (cnt == m) return 1;
	for (int i = 1; i <= m; i++) {
		if (good[i] == tmr1) continue;
		++tmr;
		cnt += dfs(i, L, R);
		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]), greater <int> ());
	}
	int ans = 0;
	for (int i = 1; i <= min(100, 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:96:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
    int mid = l + r >> 1;
                ^

Subtask #1

68.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	3304 KB	Output is correct
2	Correct	0 ms	3304 KB	Output is correct
3	Correct	0 ms	3304 KB	Output is correct
4	Correct	0 ms	3304 KB	Output is correct
5	Correct	0 ms	3304 KB	Output is correct
6	Correct	0 ms	3304 KB	Output is correct
7	Correct	0 ms	3304 KB	Output is correct
8	Correct	0 ms	3304 KB	Output is correct
9	Correct	0 ms	3304 KB	Output is correct
10	Correct	0 ms	3304 KB	Output is correct
11	Correct	0 ms	3304 KB	Output is correct
12	Correct	0 ms	3304 KB	Output is correct
13	Correct	0 ms	3304 KB	Output is correct
14	Correct	0 ms	3304 KB	Output is correct
15	Correct	0 ms	3304 KB	Output is correct
16	Correct	0 ms	3304 KB	Output is correct
17	Correct	0 ms	3304 KB	Output is correct
18	Correct	0 ms	3304 KB	Output is correct
19	Correct	36 ms	3304 KB	Output is correct
20	Correct	9 ms	3304 KB	Output is correct
21	Correct	6 ms	3304 KB	Output is correct
22	Correct	3 ms	3304 KB	Output is correct
23	Correct	6 ms	3304 KB	Output is correct
24	Correct	6 ms	3304 KB	Output is correct
25	Incorrect	229 ms	3304 KB	Output isn't correct
26	Incorrect	79 ms	3304 KB	Output isn't correct
27	Correct	6 ms	3304 KB	Output is correct
28	Incorrect	6 ms	3304 KB	Output isn't correct
29	Incorrect	9 ms	3304 KB	Output isn't correct
30	Correct	9 ms	3304 KB	Output is correct
31	Incorrect	1333 ms	3568 KB	Output isn't correct
32	Incorrect	183 ms	3304 KB	Output isn't correct
33	Correct	13 ms	3304 KB	Output is correct
34	Incorrect	9 ms	3304 KB	Output isn't correct
35	Incorrect	1326 ms	3832 KB	Output isn't correct
36	Incorrect	1079 ms	3832 KB	Output isn't correct
37	Execution timed out	1500 ms	3568 KB	Execution timed out
38	Correct	53 ms	3832 KB	Output is correct
39	Incorrect	39 ms	3304 KB	Output isn't correct
40	Correct	53 ms	3304 KB	Output is correct
41	Incorrect	76 ms	3436 KB	Output isn't correct
42	Correct	33 ms	3436 KB	Output is correct
43	Correct	49 ms	3568 KB	Output is correct
44	Correct	83 ms	3832 KB	Output is correct
45	Incorrect	143 ms	3436 KB	Output isn't correct
46	Incorrect	416 ms	3832 KB	Output isn't correct
47	Correct	73 ms	3832 KB	Output is correct
48	Correct	69 ms	3832 KB	Output is correct
49	Incorrect	349 ms	3832 KB	Output isn't correct
50	Incorrect	33 ms	3304 KB	Output isn't correct