답안 #338785

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
338785 2020-12-23T22:24:55 Z Tosic 결혼 문제 (IZhO14_marriage) C++14
100 / 100
869 ms 1132 KB
#include <bits/stdc++.h>
#define maxn 100010
using namespace std;

long long ans;
int n,m, k, fMatch[maxn], iterNum[maxn], itV;

vector<vector<int> > gr;

bool dfs(int x, int& l, int& r){
	if(iterNum[x] == itV){
		return 0;
	}
	iterNum[x] = itV;
	for(auto i : gr[x]){
		if(i>=l and i <= r and (!fMatch[i] or dfs(fMatch[i], l, r)) ){
			fMatch[i] = x;
			return 1;
		}
	}
	return 0;
}

int main(){
	ios_base::sync_with_stdio(0);
	cout.tie(0);
	cin.tie(0);
	cin >> n >> m >> k;
	gr.resize(m+1, vector<int>());
	for(int i = 0; i < k; ++i){
		int a, b;
		cin >> a >> b;
		gr[b].push_back(a);
		//gr[b].push_back(a);
	}
	int j = 1;
	vector<int> notF;
	for(int i = 1; i <= m; ++i){
		notF.push_back(i);
	}
	for(int i = 1; i <= n; ++i){
		while(j <= n){

			if(!notF.size()){
				break;
			}
			for(int j0 = notF.size()-1; j0 >= 0; --j0){
				++itV;if(dfs(notF[j0], i, j)){
					notF.pop_back();
				} else {
					break;
				}
			}
			if(!notF.size()){
				break;
			}
			++j;
			//cerr << j << '\n';
		}
		if(notF.size()){
			break;
		}
		//cerr << j << '\n';
		ans += n+1-j;
		if(fMatch[i]){
			notF.push_back(fMatch[i]);
			fMatch[i] = 0;
		}
	}
	cout<<ans;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 0 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 0 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 2 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 39 ms 620 KB Output is correct
26 Correct 4 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 3 ms 364 KB Output is correct
30 Correct 3 ms 364 KB Output is correct
31 Correct 314 ms 764 KB Output is correct
32 Correct 2 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 2 ms 364 KB Output is correct
35 Correct 183 ms 1004 KB Output is correct
36 Correct 131 ms 1004 KB Output is correct
37 Correct 869 ms 1004 KB Output is correct
38 Correct 20 ms 876 KB Output is correct
39 Correct 64 ms 620 KB Output is correct
40 Correct 3 ms 492 KB Output is correct
41 Correct 5 ms 620 KB Output is correct
42 Correct 7 ms 620 KB Output is correct
43 Correct 11 ms 876 KB Output is correct
44 Correct 18 ms 1004 KB Output is correct
45 Correct 8 ms 748 KB Output is correct
46 Correct 28 ms 1132 KB Output is correct
47 Correct 22 ms 1004 KB Output is correct
48 Correct 20 ms 1004 KB Output is correct
49 Correct 27 ms 1132 KB Output is correct
50 Correct 222 ms 620 KB Output is correct