# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
574077 | vovamr | Marriage questions (IZhO14_marriage) | C++17 | 1240 ms | 3512 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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[M], mt[N + M];
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;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |