답안 #345312

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
345312	2021-01-07T07:16:16 Z	maskoff	결혼 문제 (IZhO14_marriage)	C++14	74 / 100	1500 ms	25184 KB

marriage

#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];
vector<int> g[N], all[N];

bool go(int v) {
	if (used[v] == timer) return false;
	used[v] = timer;
 	for (int to : g[v]) 
 		if (mt[to] == false) {
 		 	mt[to] = v;
 		 	pr[v] = to;
 		 	return true;
 		}    
	for (int to : g[v])
		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 i = 1; i <= m; i++)
		g[i].clear();
	for (int i = y; i <= p; i++) {
	 	for (int j : all[i])
	 		g[j].pb(i);
	}
	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;
}

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 j = 1;
	for (int i = 1; i <= n; i++) {
		int p = check(i, j);
		while (j <= n && !p) {
		 	j++;
		 	p = check(i, j);
		}
		if (p) res += n - j + 1;
		else break;
	}
	cout << res;
  return 0;              
}

Subtask #1

74.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	16 ms	23808 KB	Output is correct
2	Correct	18 ms	23900 KB	Output is correct
3	Correct	18 ms	23788 KB	Output is correct
4	Correct	15 ms	23788 KB	Output is correct
5	Correct	15 ms	23788 KB	Output is correct
6	Correct	18 ms	23832 KB	Output is correct
7	Correct	18 ms	23788 KB	Output is correct
8	Correct	18 ms	23788 KB	Output is correct
9	Correct	18 ms	23788 KB	Output is correct
10	Correct	20 ms	23788 KB	Output is correct
11	Correct	19 ms	23788 KB	Output is correct
12	Correct	16 ms	23788 KB	Output is correct
13	Correct	17 ms	23788 KB	Output is correct
14	Correct	17 ms	23788 KB	Output is correct
15	Correct	20 ms	23788 KB	Output is correct
16	Correct	16 ms	23788 KB	Output is correct
17	Correct	16 ms	23788 KB	Output is correct
18	Correct	17 ms	23788 KB	Output is correct
19	Correct	21 ms	23916 KB	Output is correct
20	Correct	21 ms	23788 KB	Output is correct
21	Correct	20 ms	23788 KB	Output is correct
22	Correct	17 ms	23788 KB	Output is correct
23	Correct	19 ms	23916 KB	Output is correct
24	Correct	18 ms	23900 KB	Output is correct
25	Correct	63 ms	23916 KB	Output is correct
26	Correct	28 ms	23940 KB	Output is correct
27	Correct	20 ms	23916 KB	Output is correct
28	Correct	20 ms	23896 KB	Output is correct
29	Correct	34 ms	23916 KB	Output is correct
30	Correct	35 ms	23916 KB	Output is correct
31	Execution timed out	1563 ms	24300 KB	Time limit exceeded
32	Correct	385 ms	24064 KB	Output is correct
33	Correct	32 ms	23916 KB	Output is correct
34	Correct	42 ms	23916 KB	Output is correct
35	Correct	643 ms	25068 KB	Output is correct
36	Correct	571 ms	24968 KB	Output is correct
37	Execution timed out	1561 ms	24312 KB	Time limit exceeded
38	Correct	1200 ms	25132 KB	Output is correct
39	Correct	1130 ms	24204 KB	Output is correct
40	Execution timed out	1555 ms	24300 KB	Time limit exceeded
41	Execution timed out	1574 ms	24704 KB	Time limit exceeded
42	Execution timed out	1543 ms	24572 KB	Time limit exceeded
43	Execution timed out	1564 ms	24524 KB	Time limit exceeded
44	Execution timed out	1579 ms	24844 KB	Time limit exceeded
45	Execution timed out	1576 ms	24556 KB	Time limit exceeded
46	Execution timed out	1582 ms	24940 KB	Time limit exceeded
47	Execution timed out	1554 ms	25184 KB	Time limit exceeded
48	Execution timed out	1570 ms	25104 KB	Time limit exceeded
49	Execution timed out	1582 ms	24940 KB	Time limit exceeded
50	Execution timed out	1568 ms	24160 KB	Time limit exceeded