oj.uz

답안 #392548

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
392548 2021-04-21T10:14:38 Z patrikpavic2 결혼 문제 (IZhO14_marriage) C++17
96 / 100
 1500 ms 3032 KB 
#include <cstdio>
#include <cstring>
#include <vector>
 
#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;
vector < int > v[N];
 
bool dodaj(int x){
	if(bio[x] == cookie) return 0;
	bio[x] = cookie;
	for(int y : v[x]){
		if(un[y] && par[y] == -1){
			par[x] = y; par[y] = x;
			return 1;
		}
	}
	for(int y : v[x]){
		if(un[y] && dodaj(par[y])){
			par[x] = y; par[y] = 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);
	}
	memset(par, -1, sizeof(par));
	for(int i = 0;i < m;i++) un[i + n] = 1;
	int r = 0, sol = 0;
	ll ans = 0;
	for(int l = 0;l < n;l++){
		if(l && sol == m){
			un[l - 1] = 0;
			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:35:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   35 |  scanf("%d%d%d", &n, &m, &k);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
marriage.cpp:37:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   37 |   int a, b; scanf("%d%d", &a, &b);
      |             ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
96.0 / 100.0

# 결과 실행 시간 메모리 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 1100 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 1100 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 1104 KB Output is correct
17 Correct 1 ms 1100 KB Output is correct
18 Correct 1 ms 1100 KB Output is correct
19 Correct 3 ms 1228 KB Output is correct
20 Correct 2 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 53 ms 1348 KB Output is correct
26 Correct 8 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 7 ms 1304 KB Output is correct
30 Correct 6 ms 1228 KB Output is correct
31 Correct 399 ms 1792 KB Output is correct
32 Correct 17 ms 1228 KB Output is correct
33 Correct 2 ms 1100 KB Output is correct
34 Correct 1 ms 1228 KB Output is correct
35 Correct 161 ms 2252 KB Output is correct
36 Correct 113 ms 2252 KB Output is correct
37 Correct 1205 ms 1980 KB Output is correct
38 Correct 192 ms 2472 KB Output is correct
39 Correct 2 ms 1484 KB Output is correct
40 Correct 6 ms 1484 KB Output is correct
41 Correct 96 ms 1644 KB Output is correct
42 Correct 164 ms 1812 KB Output is correct
43 Correct 240 ms 2188 KB Output is correct
44 Correct 662 ms 2376 KB Output is correct
45 Correct 17 ms 2252 KB Output is correct
46 Execution timed out 1596 ms 3024 KB Time limit exceeded
47 Correct 972 ms 2884 KB Output is correct
48 Correct 986 ms 2908 KB Output is correct
49 Execution timed out 1578 ms 3032 KB Time limit exceeded
50 Correct 3 ms 1612 KB Output is correct