Submission #392569

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
392569	2021-04-21T10:37:47 Z	patrikpavic2	Marriage questions (IZhO14_marriage)	C++17	96 / 100	1500 ms	3364 KB

marriage

#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
 
#define PB push_back
 
using namespace std;
 
typedef long long ll;
 
const int N = (1 << 15);
 
int par[N], n, m, bio[N], k, un[N], cookie = 1;
int poc[N], deg[N];
vector < int > v[N];
  
bool dodaj(int x){
	if(bio[x] == cookie) return 0;
	bio[x] = cookie;
	for(int i = poc[x];i < deg[x] && un[v[x][i]];i++){
		if(par[v[x][i]] == -1 || dodaj(par[v[x][i]])){
			par[x] = v[x][i]; par[v[x][i]] = x;
			return 1;
		}
	}
	return 0;
}
 
int main(){
	scanf("%d%d%d", &n, &m, &k);
	for(int i = 0;i < k;i++){
		int a, b; scanf("%d%d", &a, &b);
		a--; b--;
		v[a].PB(n + b), v[b + n].PB(a);
		deg[a]++; deg[b + n]++;
	}
	memset(par, -1, sizeof(par));
	for(int i = 0;i < m;i++){
		un[i + n] = 1;
		sort(v[i + n].begin(), v[i + n].end());
	}
	int r = 0, sol = 0;
	ll ans = 0;
	for(int l = 0;l < n;l++){
		if(l && sol == m){
			un[l - 1] = 0;
			for(int i = n;i < m + n;i++)
				if(poc[i] < deg[i] && v[i][poc[i]] < l) poc[i]++;
			if(par[l - 1] != -1){
				sol--; par[par[l - 1]] = -1;
				sol += dodaj(par[l - 1]); cookie++;
			}
		}		
		while(r < n && sol < m){
			un[r] = 1; sol += dodaj(r); cookie++;
			r++;
		}
		ans += (n + 1 - r) * (sol == m);
	}
	printf("%lld\n", ans);
	return 0;
}

Compilation message

marriage.cpp: In function 'int main()':
marriage.cpp:31:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   31 |  scanf("%d%d%d", &n, &m, &k);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
marriage.cpp:33:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   33 |   int a, b; scanf("%d%d", &a, &b);
      |             ~~~~~^~~~~~~~~~~~~~~~

Subtask #1

96.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1100 KB	Output is correct
2	Correct	1 ms	1100 KB	Output is correct
3	Correct	1 ms	1100 KB	Output is correct
4	Correct	1 ms	1116 KB	Output is correct
5	Correct	1 ms	1100 KB	Output is correct
6	Correct	1 ms	1100 KB	Output is correct
7	Correct	1 ms	1100 KB	Output is correct
8	Correct	1 ms	1104 KB	Output is correct
9	Correct	1 ms	1100 KB	Output is correct
10	Correct	1 ms	1100 KB	Output is correct
11	Correct	1 ms	1100 KB	Output is correct
12	Correct	1 ms	1100 KB	Output is correct
13	Correct	1 ms	1100 KB	Output is correct
14	Correct	1 ms	1100 KB	Output is correct
15	Correct	1 ms	1100 KB	Output is correct
16	Correct	1 ms	1100 KB	Output is correct
17	Correct	1 ms	1100 KB	Output is correct
18	Correct	1 ms	1100 KB	Output is correct
19	Correct	2 ms	1228 KB	Output is correct
20	Correct	1 ms	1100 KB	Output is correct
21	Correct	1 ms	1100 KB	Output is correct
22	Correct	1 ms	1100 KB	Output is correct
23	Correct	1 ms	1100 KB	Output is correct
24	Correct	1 ms	1100 KB	Output is correct
25	Correct	13 ms	1356 KB	Output is correct
26	Correct	5 ms	1228 KB	Output is correct
27	Correct	1 ms	1100 KB	Output is correct
28	Correct	1 ms	1100 KB	Output is correct
29	Correct	8 ms	1228 KB	Output is correct
30	Correct	7 ms	1228 KB	Output is correct
31	Correct	115 ms	1800 KB	Output is correct
32	Correct	20 ms	1316 KB	Output is correct
33	Correct	1 ms	1228 KB	Output is correct
34	Correct	4 ms	1228 KB	Output is correct
35	Correct	241 ms	2204 KB	Output is correct
36	Correct	194 ms	2252 KB	Output is correct
37	Correct	341 ms	2008 KB	Output is correct
38	Correct	382 ms	2484 KB	Output is correct
39	Correct	62 ms	1580 KB	Output is correct
40	Correct	6 ms	1612 KB	Output is correct
41	Correct	98 ms	1732 KB	Output is correct
42	Correct	240 ms	1848 KB	Output is correct
43	Correct	282 ms	2108 KB	Output is correct
44	Correct	796 ms	2548 KB	Output is correct
45	Correct	90 ms	2372 KB	Output is correct
46	Execution timed out	1575 ms	3364 KB	Time limit exceeded
47	Correct	1206 ms	2980 KB	Output is correct
48	Correct	1185 ms	2988 KB	Output is correct
49	Execution timed out	1593 ms	3140 KB	Time limit exceeded
50	Correct	96 ms	1732 KB	Output is correct