Submission #711580

#TimeUsernameProblemLanguageResultExecution timeMemory
711580FilyaMarriage questions (IZhO14_marriage)C++14
50 / 100
445 ms2928 KiB
/////////////////////include///////////////////// //#include <bits/stdc++.h> #define _CRT_SECURE_NO_WARNINGS #include <iostream> #include <string> #include <algorithm> #include <cmath> #include <cstring> #include <cassert> #include <set> #include <map> #include <unordered_map> #include <vector> #include <stack> #include <queue> #include <iomanip> #include <bitset> #include <stdio.h> #include <climits> #include <numeric> using namespace std; //#include <ext/pb_ds/assoc_container.hpp> //#include <ext/pb_ds/tree_policy.hpp> //using namespace __gnu_pbds; //template <typename T> //using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; /////////////////////define///////////////////// #define ci(x) if(x) cout << "YES" << '\n'; else cout << "NO" << '\n'; #define cii(x) if(check(x)) #define MOD 1000000007 #define MOD2 998244353 #define oo 1e9 #define ool 1e18L #define pii pair<int, int> #define pll pair<long long, long long> #define mii map<int, int> #define vi vector<int> #define vpi vector<pair<int, int>> #define vll vector <ll> #define ff first #define ss second #define mp make_pair #define ll long long #define ld long double #define pb push_back #define eb emplace_back #define pob pop_back #define lb lower_bound #define ub upper_bound #define bs binary_search #define sz(x) (int((x).size())) #define all(x) (x).begin(), (x).end() #define alll(x) (x), (x) + n #define clr(x) (x).clear(); #define fri(x) for(int i = 0; i < x; ++i) #define frj(x) for(int j = 0; j < x; ++j) #define frp(x) for(int p = 0; p < x; ++p) #define frr(a, b) for(int i = a; i < b; ++i) #define frrj(a, b) for(int j = a; j < b; ++j) #define fra(x) for(int i = 0; i < x; ++i) cin >> a[i]; #define frb(x) for(int i = 0; i < x; ++i) cin >> b[i]; #define frs(x) for(auto it = x.begin(); it != x.end(); ++it) #define fr(x) for(auto it : x) //el #define fastio ios_base::sync_with_stdio(false); cin.tie(0); #define dbg(x) cerr << #x << ": " << x << endl; #define ce(x) cout << x << endl; #define uniq(x) x.resize(unique(all(x)) - x.begin()); //make all one after sorting #define blt __builtin_popcount /////////////////////print array, vector, deque, set, multiset, pair, map ///////////////////// void print(long long t) {cerr << t;} void print(int t) {cerr << t;} void print(string t) {cerr << t;} void print(char t) {cerr << t;} void print(double t) {cerr << t;} void print(long double t) {cerr << t;} void print(unsigned long long t) {cerr << t;} template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";} template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]"; cout << endl;} template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;} template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;} template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;} template <class T> void print(stack <T> v) {cerr << "[ "; stack<T> s = v; while(s.size()) {T i = s.top(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;} template <class T> void print(queue <T> v) {cerr << "[ "; queue<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;} template <class T> void print(deque <T> v) {cerr << "[ "; deque<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop_front(); cerr << " ";} cerr << "]"; cout << endl;} template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;} template <class T, class V> void print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;} /////////////////////code///////////////////// vi g[40005]; int mt[40005]; bool used[2005]; //axjikneri vra enq nayum misht bool kuhn(int v, int l, int r) { if(used[v]) return 0; used[v] = 1; for(int u : g[v]) { if(u < l || u > r) continue; if(mt[u] == -1 || kuhn(mt[u], l, r)) { mt[u] = v; mt[v] = u; return 1; } } return 0; } int main() { fastio; int n, m, k, x, y; cin >> n >> m >> k; fri(k) { cin >> x >> y; x += m; g[x].pb(y); g[y].pb(x); } n += m; int l = 2 * m, r = n, ans = -1, mid; //l=2m qani vor gone m hat arqa piti lini while(l <= r) { mid = (l + r) / 2; frr(1, 1 + n) { mt[i] = -1; used[i] = 0; } bool f = 1; frr(1, 1 + m) if(!kuhn(i, m+1, mid)) { f = 0; break; } if(f) { ans = mid; r = mid - 1; } else l = mid + 1; } if(ans == -1) { cout << 0; return 0; } int answ = n - ans + 1; //1ov sksvoxneri tivy frr(1, 1 + n) { mt[i] = -1; used[i] = 0; } frr(1, 1 + m) kuhn(i, m+1, ans); // print(mt, n + 1); for(int i = m + 1; i <= n; i++) { //i-rdy hanum enq mer kandidatneric if(mt[i] == -1) { answ += n - ans + 1; //ans ic sksac minchev n+m bolory bavarar en continue; } int girl = mt[i]; mt[girl] = -1; mt[i] = -1; while(ans <= n) { frr(1, 1 + m) used[i] = 0; if(kuhn(girl, i + 1, ans)) { answ += n - ans + 1; break; } // dbg(ans) ans++; } if(ans == n + 1) break; } cout << answ; return 0; } // ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ // ♥ ♥ ♥ ♥ ♥ ♥ ♥ // ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ // ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ // ♥ ♥ ♥ ♥ ♥ ♥ ♥ ♥ // // God loves Fil, Fil accepts God's will
#Verdict Execution timeMemoryGrader output
Fetching results...