oj.uz

답안 #574076

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
574076 2022-06-07T17:27:58 Z vovamr 결혼 문제 (IZhO14_marriage) C++17
86 / 100
 1274 ms 4672 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fi first
#define se second
#define ll long long
#define ld long double
#define sz(x) ((int)(x).size())
#define all(x) 	(x).begin(), (x).end()
#define pb push_back
#define mpp make_pair
#define ve vector
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
const ll inf = 1e18; const int iinf = 1e9;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> inline bool chmin(T& a, T b) { return (a > b ? a = b, 1 : 0); }
template <typename T> inline bool chmax(T& a, T b) { return (a < b ? a = b, 1 : 0); }

int timer = 1;
const int N = 3e4 + 10;
const int M = 2e3 + 10;

ve<int> gr[N + M];
bool can[N]; int used[N], mt[N];

inline bool kuhn(int v) {
	if (used[v] == timer) return 0;
	used[v] = timer;
	for (int &to : gr[v]) if (can[to] && mt[to] == -1) { mt[to] = v, mt[v] = to; return 1; }
	for (int &to : gr[v]) if (can[to] && kuhn(mt[to])) { mt[to] = v, mt[v] = to; return 1; }
	return 0;
}

int un[N];
int ptr = 0;

int sz = 0;
inline void run() {
	while (ptr) {
		++timer;
		bool ok = kuhn(un[ptr - 1]);
		if (!ok) break;
		else --ptr, ++sz;
	}
}

inline void solve() {
	int n, m, k;
	cin >> n >> m >> k;
	for (int i = 0; i < k; ++i) {
		int v, u;
		cin >> v >> u, --v, --u;
		gr[u].pb(v + m);
	}

	for (int i = 0; i < n + m; ++i) mt[i] = -1;
	for (int i = 0; i < m; ++i) un[ptr++] = i;

	int ans = 0;
	for (int l = 0, r = 0; l < n; ++l) {
		while (r < n) {
			can[r + m] = 1; run();
			if (sz == m) break;
			++r;
		}

		ans += n - r;

		can[l + m] = 0;
		if (mt[l + m] != -1) {
			--sz;
			mt[mt[l + m]] = -1;
			un[ptr++] = mt[l + m];
			mt[l + m] = -1;
		}
	}
	cout << ans;
}

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int q = 1; // cin >> q;
	while (q--) solve();
	cerr << fixed << setprecision(3) << "Time execution: " << (double)clock() / CLOCKS_PER_SEC << endl;
}

Subtask #1
86.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1084 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 1080 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Incorrect 1 ms 1084 KB Output isn't correct
14 Correct 1 ms 980 KB Output is correct
15 Correct 1 ms 980 KB Output is correct
16 Correct 1 ms 1080 KB Output is correct
17 Correct 1 ms 980 KB Output is correct
18 Correct 1 ms 980 KB Output is correct
19 Correct 4 ms 1108 KB Output is correct
20 Correct 2 ms 1108 KB Output is correct
21 Correct 1 ms 980 KB Output is correct
22 Correct 1 ms 980 KB Output is correct
23 Correct 2 ms 1088 KB Output is correct
24 Correct 1 ms 1108 KB Output is correct
25 Correct 44 ms 1180 KB Output is correct
26 Correct 5 ms 1108 KB Output is correct
27 Correct 1 ms 1108 KB Output is correct
28 Correct 1 ms 1108 KB Output is correct
29 Correct 2 ms 1108 KB Output is correct
30 Correct 2 ms 1172 KB Output is correct
31 Correct 510 ms 1772 KB Output is correct
32 Correct 2 ms 1108 KB Output is correct
33 Correct 1 ms 1108 KB Output is correct
34 Correct 2 ms 1108 KB Output is correct
35 Correct 107 ms 2368 KB Output is correct
36 Correct 78 ms 2248 KB Output is correct
37 Correct 1274 ms 1976 KB Output is correct
38 Correct 17 ms 2412 KB Output is correct
39 Correct 56 ms 1276 KB Output is correct
40 Correct 3 ms 1348 KB Output is correct
41 Correct 5 ms 1492 KB Output is correct
42 Correct 7 ms 1540 KB Output is correct
43 Correct 11 ms 1876 KB Output is correct
44 Correct 16 ms 2500 KB Output is correct
45 Runtime error 9 ms 3028 KB Execution killed with signal 11
46 Runtime error 21 ms 4448 KB Execution killed with signal 11
47 Runtime error 22 ms 4300 KB Execution killed with signal 11
48 Runtime error 23 ms 4200 KB Execution killed with signal 11
49 Runtime error 22 ms 4672 KB Execution killed with signal 11
50 Runtime error 145 ms 2508 KB Execution killed with signal 11