oj.uz

Submission #1088655

# Submission time Handle Problem Language Result Execution time Memory
1088655 2024-09-14T18:09:10 Z Kerim Marriage questions (IZhO14_marriage) C++17
72 / 100
 1500 ms 7832 KB 
#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], 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

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

Subtask #1
72.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4952 KB Output is correct
5 Correct 2 ms 4956 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 3 ms 4956 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 2 ms 5144 KB Output is correct
10 Correct 2 ms 5208 KB Output is correct
11 Correct 2 ms 4956 KB Output is correct
12 Correct 2 ms 4956 KB Output is correct
13 Correct 3 ms 4956 KB Output is correct
14 Correct 2 ms 4956 KB Output is correct
15 Correct 2 ms 5052 KB Output is correct
16 Correct 2 ms 4956 KB Output is correct
17 Correct 2 ms 4956 KB Output is correct
18 Correct 3 ms 5136 KB Output is correct
19 Correct 4 ms 5152 KB Output is correct
20 Correct 4 ms 4956 KB Output is correct
21 Correct 2 ms 4956 KB Output is correct
22 Correct 2 ms 5160 KB Output is correct
23 Correct 4 ms 5128 KB Output is correct
24 Correct 3 ms 5072 KB Output is correct
25 Correct 18 ms 5416 KB Output is correct
26 Correct 30 ms 4956 KB Output is correct
27 Correct 3 ms 4956 KB Output is correct
28 Correct 4 ms 4956 KB Output is correct
29 Correct 52 ms 5320 KB Output is correct
30 Correct 52 ms 5288 KB Output is correct
31 Correct 434 ms 5980 KB Output is correct
32 Execution timed out 1586 ms 5212 KB Time limit exceeded
33 Correct 4 ms 4952 KB Output is correct
34 Correct 11 ms 5216 KB Output is correct
35 Correct 387 ms 6956 KB Output is correct
36 Correct 250 ms 6740 KB Output is correct
37 Execution timed out 1572 ms 6084 KB Time limit exceeded
38 Execution timed out 1534 ms 7444 KB Time limit exceeded
39 Execution timed out 1567 ms 5212 KB Time limit exceeded
40 Correct 384 ms 5468 KB Output is correct
41 Execution timed out 1539 ms 5720 KB Time limit exceeded
42 Execution timed out 1565 ms 6236 KB Time limit exceeded
43 Execution timed out 1572 ms 6492 KB Time limit exceeded
44 Execution timed out 1574 ms 7004 KB Time limit exceeded
45 Execution timed out 1551 ms 6236 KB Time limit exceeded
46 Execution timed out 1535 ms 7004 KB Time limit exceeded
47 Execution timed out 1573 ms 7832 KB Time limit exceeded
48 Execution timed out 1512 ms 7768 KB Time limit exceeded
49 Execution timed out 1578 ms 7260 KB Time limit exceeded
50 Execution timed out 1590 ms 5464 KB Time limit exceeded