oj.uz

Submission #39040

# Submission time Handle Problem Language Result Execution time Memory
39040 2018-01-09T06:14:10 Z RockyB Marriage questions (IZhO14_marriage) C++14
12 / 100
 1500 ms 3828 KB 
/// 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 (to > R) break;
		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;
	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] = tmr1;
				break;
			}
		}
	}
	int cnt = 0;
	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);
	}
	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:92:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
    int mid = l + r >> 1;
                ^

Subtask #1
12.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 3300 KB Output isn't correct
2 Incorrect 0 ms 3300 KB Output isn't correct
3 Incorrect 0 ms 3300 KB Output isn't correct
4 Incorrect 0 ms 3300 KB Output isn't correct
5 Incorrect 0 ms 3300 KB Output isn't correct
6 Incorrect 0 ms 3300 KB Output isn't correct
7 Incorrect 0 ms 3300 KB Output isn't correct
8 Incorrect 0 ms 3300 KB Output isn't correct
9 Correct 0 ms 3300 KB Output is correct
10 Correct 0 ms 3300 KB Output is correct
11 Incorrect 0 ms 3300 KB Output isn't correct
12 Correct 0 ms 3300 KB Output is correct
13 Incorrect 0 ms 3300 KB Output isn't correct
14 Incorrect 0 ms 3300 KB Output isn't correct
15 Incorrect 0 ms 3300 KB Output isn't correct
16 Incorrect 0 ms 3300 KB Output isn't correct
17 Incorrect 0 ms 3300 KB Output isn't correct
18 Incorrect 0 ms 3300 KB Output isn't correct
19 Incorrect 56 ms 3300 KB Output isn't correct
20 Incorrect 9 ms 3300 KB Output isn't correct
21 Correct 3 ms 3300 KB Output is correct
22 Incorrect 3 ms 3300 KB Output isn't correct
23 Incorrect 6 ms 3300 KB Output isn't correct
24 Incorrect 6 ms 3300 KB Output isn't correct
25 Incorrect 833 ms 3300 KB Output isn't correct
26 Incorrect 166 ms 3300 KB Output isn't correct
27 Correct 33 ms 3300 KB Output is correct
28 Incorrect 36 ms 3300 KB Output isn't correct
29 Incorrect 73 ms 3300 KB Output isn't correct
30 Incorrect 66 ms 3300 KB Output isn't correct
31 Execution timed out 1500 ms 3564 KB Execution timed out
32 Execution timed out 1500 ms 3300 KB Execution timed out
33 Correct 103 ms 3300 KB Output is correct
34 Incorrect 103 ms 3300 KB Output isn't correct
35 Execution timed out 1500 ms 3828 KB Execution timed out
36 Execution timed out 1500 ms 3828 KB Execution timed out
37 Execution timed out 1500 ms 3564 KB Execution timed out
38 Execution timed out 1500 ms 3828 KB Execution timed out
39 Execution timed out 1500 ms 3300 KB Execution timed out
40 Execution timed out 1500 ms 3300 KB Execution timed out
41 Execution timed out 1500 ms 3432 KB Execution timed out
42 Execution timed out 1500 ms 3432 KB Execution timed out
43 Execution timed out 1500 ms 3564 KB Execution timed out
44 Execution timed out 1500 ms 3828 KB Execution timed out
45 Execution timed out 1500 ms 3432 KB Execution timed out
46 Execution timed out 1500 ms 3828 KB Execution timed out
47 Execution timed out 1500 ms 3828 KB Execution timed out
48 Execution timed out 1500 ms 3828 KB Execution timed out
49 Execution timed out 1500 ms 3828 KB Execution timed out
50 Execution timed out 1500 ms 3300 KB Execution timed out