Submission #1088805

#	Time	Username	Problem	Language	Result	Execution time	Memory
1088805		KasymK	Marriage questions (IZhO14_marriage)	C++17	72 / 100	1566 ms	7936 KiB

marriage

#include "bits/stdc++.h"
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#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], vis1[N], mark[N];
vector<int> adj[N], g[N];
 
bool kuhn(int x){
    if(vis[x]) 
        return 0;
    vis[x] = 1;
    for(auto i : adj[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(int l = 1; l <= n; ++l){
        vector<int> v;
        int cnt = 0;
        for(int r = l; r <= n; ++r){
            for(auto &i : g[r]){
                cnt += !mark[i];
                mark[i] = 1;
                adj[r].pb(i);
            }
            if (cnt < m)
                continue;
            for (int i = 1; i <= m; i++)
                love[i] = -1;
            // Improved Kuhn starts here
            for (int j = l; j <= r; j++)
                vis1[j] = 0;
            for (int j = l; j <= r; j++)
                for (int to : adj[j])
                    if (love[to] == -1) {
                        love[to] = j;
                        vis1[j] = true;
                        break;
                    }
            for (int i = l; i <= r; i++){
                if (vis1[i])
                    continue;
                // Improved Kuhn ends here
                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;
            }
        }
        for (int i = 1; i <= n; i++)
            adj[i].clear();
        for(int i = 1; i <= m; ++i)
            mark[i] = 0;
    }
    printf("%lld\n", answer);
    return 0;
}

Compilation message (stderr)

marriage.cpp: In function 'int main()':
marriage.cpp:36:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |     scanf("%d%d%d", &n, &m, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
marriage.cpp:39:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |         scanf("%d%d", &a, &b);
      |         ~~~~~^~~~~~~~~~~~~~~~

• Subtask 1: 72 / 100