Submission #1088660

#TimeUsernameProblemLanguageResultExecution timeMemory
1088660KerimMarriage questions (IZhO14_marriage)C++17
66 / 100
1572 ms4888 KiB
#include "bits/stdc++.h" using namespace std; #define ff first #define ss second #define all(v) v.begin(), v.end() #define ll long long #define pb push_back #define pii pair<int, int> #define pli pair<ll, int> #define pll pair<ll, ll> #define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i) #define wr puts("----------------") template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;} template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;} const int N = 1e5+5; int n, m, k, love[N]; bool vis[N]; int l, r; vector<int> g[N]; bool kuhn(int x){ if(vis[x]) return 0; vis[x] = 1; for(auto i : g[x]) if(love[i] == -1 or kuhn(love[i])){ love[i] = x; return 1; } return 0; } int main(){ // freopen("file.in", "r", stdin); scanf("%d%d%d", &n, &m, &k); for(int i = 1; i <= k; ++i){ int a, b; scanf("%d%d", &a, &b); g[a].push_back(b); } ll answer = 0; for(l = 1; l <= n; ++l){ if (r < l) r = l; vector<int> v; while (r <= n){ for (int i = 1; i <= m; i++) love[i] = -1; for (int i = l; i <= r; i++){ for (int j = l; j <= r; j++) vis[j] = 0; kuhn(i); } bool ok = 1; for (int i = 1; i <= m; i++) ok &= (love[i] != -1); if (ok){ answer += n-r+1; break; } r += 1; } } printf("%lld\n", answer); return 0; }

Compilation message (stderr)

marriage.cpp: In function 'int main()':
marriage.cpp:35:10: 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:38:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |         scanf("%d%d", &a, &b);
      |         ~~~~~^~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...