답안 #108683

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
108683	2019-05-01T03:18:05 Z	qkxwsm	결혼 문제 (IZhO14_marriage)	C++14	100 / 100	1092 ms	3832 KB

marriage

//clever
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

random_device(rd);
mt19937 rng(rd());
const long long FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();

struct custom_hash
{
	template<class T>
	unsigned long long operator()(T v) const
	{
		unsigned long long x = v;
		x += FIXED_RANDOM;
		// x += 11400714819323198485ull;
		// x = (x ^ (x >> 30)) * 13787848793156543929ull;
		x = (x ^ (x >> 27)) * 10723151780598845931ull;
		return x ^ (x >> 31);
	}
};

template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T, class U> using hash_table = gp_hash_table<T, U, custom_hash>;

template<class T>
T randomize(T mod)
{
	return (uniform_int_distribution<T>(0, mod - 1))(rng);
}
template<class T>
void readi(T &x)
{
	x = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
	{
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		x = x * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		x = -x;
	}
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int buf[20], n = 0;
	while(output)
	{
		buf[n] = ((output % 10));
		output /= 10;
		n++;
	}
	for (n--; n >= 0; n--)
	{
		putchar(buf[n] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
long long expo(long long a, long long e, long long mod)
{
	return ((e == 0) ? 1 : ((expo(a * a % mod, e >> 1, mod)) * ((e & 1) ? a : 1) % mod));
}
template<class T, class U>
void nmod(T &x, U mod)
{
	if (x >= mod) x -= mod;
}
template<class T>
T gcd(T a, T b)
{
	return (b ? gcd(b, a % b) : a);
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define DBG(x) cerr << #x << " = " << (x) << endl
#define SZ(x) ((int) ((x).size()))
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)
#define ALL(x) (x).begin(), (x).end()

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-9;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 32013

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
typedef vector<pdd> vpd;

int N, M, E;
int L, R;
vi edge[MAXN];
int match[MAXN];
bitset<MAXN> seen;
int ans;
vi todo;

int color(int u)
{
	return (u < M ? 0 : 1);
}
bool dfs(int u)
{
	if (seen[u]) return false;
	seen[u] = true;
	for (int v : edge[u])
	{
		if (color(v) == 1 && (v < L || v > R)) continue;
		if (match[v] == -1 || dfs(match[v]))
		{
			// cerr << "match " << u << ' ' << v << endl;
			match[u] = v;
			match[v] = u;
			return true;
		}
	}
	return false;
}

int32_t main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	// cout << fixed << setprecision(10);
	// cerr << fixed << setprecision(10);
	// if (fopen("file.in", "r"))
	// {
	// 	freopen ("file.in", "r", stdin);
	// 	freopen ("file.out", "w", stdout);
	// }
	cin >> N >> M >> E;
	FOR(i, 0, E)
	{
		int u, v;
		cin >> u >> v;
		u--; v--;
		edge[v].PB(u + M);
		edge[u + M].PB(v);
		// cerr << "edge " << u + M << " -- " << v << endl;
	}
	FOR(i, 0, M + N) match[i] = -1;
	FOR(i, 0, M) todo.PB(i);
	for (L = M; L < M + N; L++)
	{
		while(R < M + N)
		{
			//try adding R
			while(true)
			{
				if (todo.empty()) break;
				seen.reset();
				int u = todo.back();
				if (!dfs(u)) break;
				todo.pop_back();
			}
			if (todo.empty()) break;
			R++;
		}
		ans += (M + N - R);
		if (match[L] != -1)
		{
			todo.PB(match[L]);
			match[match[L]] = -1;
			match[L] = -1;
		}
		// cerr << L << ' ' << R << endl;
	}
	cout << ans << '\n';
	// cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}
/* READ READ READ
* int overflow, maxn too small, special cases (n=1?, two distinct?), cin.tie() interactive
* reread the problem, try small cases
* note down possible sources of error as you go
* do smth instead of nothing
*/

Subtask #1

100.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	1280 KB	Output is correct
2	Correct	2 ms	1152 KB	Output is correct
3	Correct	2 ms	1152 KB	Output is correct
4	Correct	3 ms	1152 KB	Output is correct
5	Correct	3 ms	1152 KB	Output is correct
6	Correct	3 ms	1152 KB	Output is correct
7	Correct	3 ms	1152 KB	Output is correct
8	Correct	3 ms	1156 KB	Output is correct
9	Correct	3 ms	1152 KB	Output is correct
10	Correct	2 ms	1152 KB	Output is correct
11	Correct	3 ms	1152 KB	Output is correct
12	Correct	3 ms	1140 KB	Output is correct
13	Correct	3 ms	1152 KB	Output is correct
14	Correct	4 ms	1024 KB	Output is correct
15	Correct	3 ms	1152 KB	Output is correct
16	Correct	3 ms	1152 KB	Output is correct
17	Correct	3 ms	1152 KB	Output is correct
18	Correct	3 ms	1152 KB	Output is correct
19	Correct	9 ms	1152 KB	Output is correct
20	Correct	5 ms	1152 KB	Output is correct
21	Correct	4 ms	1152 KB	Output is correct
22	Correct	3 ms	1152 KB	Output is correct
23	Correct	4 ms	1152 KB	Output is correct
24	Correct	4 ms	1152 KB	Output is correct
25	Correct	54 ms	1528 KB	Output is correct
26	Correct	9 ms	1152 KB	Output is correct
27	Correct	4 ms	1152 KB	Output is correct
28	Correct	10 ms	1152 KB	Output is correct
29	Correct	7 ms	1280 KB	Output is correct
30	Correct	7 ms	1280 KB	Output is correct
31	Correct	364 ms	2168 KB	Output is correct
32	Correct	4 ms	1280 KB	Output is correct
33	Correct	3 ms	1152 KB	Output is correct
34	Correct	5 ms	1152 KB	Output is correct
35	Correct	156 ms	2936 KB	Output is correct
36	Correct	132 ms	2816 KB	Output is correct
37	Correct	1092 ms	2400 KB	Output is correct
38	Correct	28 ms	3172 KB	Output is correct
39	Correct	81 ms	1552 KB	Output is correct
40	Correct	10 ms	1536 KB	Output is correct
41	Correct	11 ms	1792 KB	Output is correct
42	Correct	20 ms	2048 KB	Output is correct
43	Correct	27 ms	2432 KB	Output is correct
44	Correct	40 ms	3164 KB	Output is correct
45	Correct	24 ms	2432 KB	Output is correct
46	Correct	63 ms	3676 KB	Output is correct
47	Correct	52 ms	3704 KB	Output is correct
48	Correct	30 ms	3576 KB	Output is correct
49	Correct	65 ms	3832 KB	Output is correct
50	Correct	253 ms	1500 KB	Output is correct