Submission #341605

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
341605	2020-12-30T08:00:51 Z	amunduzbaev	Marriage questions (IZhO14_marriage)	C++14	100 / 100	509 ms	24592 KB

marriage

/** made by amunduzbaev **/
 
#include <bits/stdc++.h>
using namespace std;
 
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
#define vpii vector<pii>
#define vpll vector<pll>
#define cnt(a)__builtin_popcount(a)
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}
 
const int N = 1e6+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);

int n, m, k, ans, match[N], used[N], ver, l, r;

vector<vii> edges(N);

bool kun(int cur){
	if(used[cur] == ver) return 0;
	used[cur] = ver;
	for(auto x:edges[cur]){
		if(x <= r && x >= l && (match[x] == -1 || kun(match[x]))) { match[x] = cur; return 1; }
	}return 0;
}

void solve(){
	cin>>n>>m>>k;
	for(int i=0;i<k;i++){
		int a, b;
		cin>>a>>b;
		edges[--b].pb(--a);
	}
	
	for(int i=0;i<m;i++) sort(all(edges[i]));
	for(int i=0;i<n;i++) match[i] = -1;
	
	vii need;
	for(int i=0;i<m;i++){
		int cur = i;
		ver++;
		while(r < n && !kun(cur)) r++, ver++;
		if(r == n) {
			cout<<0<<endl;
			return;
		}
		//for(int i=0;i<n;i++) cout<<match[i]<<" ";
		//cout<<"\n";
	}
	
	bool ok = 1;
	for(l=0;l<n && ok;l++){
		while(!need.empty()){
			int cur = need.back();
			ver++;
			while(r < n && !kun(cur)) r++, ver++;
			if(r == n) { ok = 0; break; }
			need.pop_back();
		}
		if(!ok) break;
		//cout<<l<<" "<<r<<"\n";
		ans += (n-r);
		if(match[l] != -1){
			need.pb(match[l]);
			match[l] = -1;
		}
	}
	cout<<ans<<"\n";
	return;
}


main(){
	fastios
	int t = 0;
	if(!t) solve();
	else {
		cin>>t;
		while (t--) solve();
	}
}

Compilation message

marriage.cpp:91:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   91 | main(){
      |      ^

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	16 ms	23788 KB	Output is correct
2	Correct	19 ms	23788 KB	Output is correct
3	Correct	17 ms	23788 KB	Output is correct
4	Correct	16 ms	23788 KB	Output is correct
5	Correct	16 ms	23788 KB	Output is correct
6	Correct	16 ms	23788 KB	Output is correct
7	Correct	16 ms	23788 KB	Output is correct
8	Correct	17 ms	23788 KB	Output is correct
9	Correct	18 ms	23788 KB	Output is correct
10	Correct	18 ms	23788 KB	Output is correct
11	Correct	20 ms	23788 KB	Output is correct
12	Correct	16 ms	23788 KB	Output is correct
13	Correct	16 ms	23788 KB	Output is correct
14	Correct	16 ms	23788 KB	Output is correct
15	Correct	17 ms	23788 KB	Output is correct
16	Correct	17 ms	23788 KB	Output is correct
17	Correct	17 ms	23788 KB	Output is correct
18	Correct	16 ms	23788 KB	Output is correct
19	Correct	17 ms	23788 KB	Output is correct
20	Correct	18 ms	23808 KB	Output is correct
21	Correct	16 ms	23788 KB	Output is correct
22	Correct	16 ms	23788 KB	Output is correct
23	Correct	18 ms	23788 KB	Output is correct
24	Correct	16 ms	23788 KB	Output is correct
25	Correct	35 ms	23916 KB	Output is correct
26	Correct	19 ms	23916 KB	Output is correct
27	Correct	17 ms	23788 KB	Output is correct
28	Correct	16 ms	23788 KB	Output is correct
29	Correct	19 ms	23916 KB	Output is correct
30	Correct	18 ms	23916 KB	Output is correct
31	Correct	172 ms	24172 KB	Output is correct
32	Correct	20 ms	23916 KB	Output is correct
33	Correct	16 ms	23788 KB	Output is correct
34	Correct	21 ms	23916 KB	Output is correct
35	Correct	141 ms	24300 KB	Output is correct
36	Correct	108 ms	24300 KB	Output is correct
37	Correct	509 ms	24464 KB	Output is correct
38	Correct	34 ms	24428 KB	Output is correct
39	Correct	127 ms	24044 KB	Output is correct
40	Correct	18 ms	23916 KB	Output is correct
41	Correct	28 ms	24044 KB	Output is correct
42	Correct	23 ms	24192 KB	Output is correct
43	Correct	27 ms	24300 KB	Output is correct
44	Correct	34 ms	24428 KB	Output is correct
45	Correct	27 ms	24172 KB	Output is correct
46	Correct	221 ms	24556 KB	Output is correct
47	Correct	37 ms	24428 KB	Output is correct
48	Correct	35 ms	24428 KB	Output is correct
49	Correct	295 ms	24592 KB	Output is correct
50	Correct	250 ms	24044 KB	Output is correct