Submission #1088239

# Submission time Handle Problem Language Result Execution time Memory
1088239 2024-09-14T07:07:11 Z KasymK Marriage questions (IZhO14_marriage) C++17
50 / 100
1500 ms 5752 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;
pii p[N];
int ed[N], st[N], n, m, k, love[N];
bool vis[N];
vector<pii> v;
vector<int> adj[N];
 
bool check(){
    set<int> st;
    for(auto &i : v)
        st.insert(i.ss);
    return ((int)st.size() == m);
}
 
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);
        p[i].ff = a, p[i].ss = b;
    }
    sort(p+1, p+k+1);
    int _ = -1;
    for(int i = 1; i <= k; ++i){
        ed[p[i].ff] = i;
        if(p[i].ff != _)
            st[p[i].ff] = i;
        _ = p[i].ff;
    }
    for (int i = 1; i <= n; i++)
        if (!ed[i])
            ed[i] = ed[i-1];
    st[n+1] = k+1;
    for (int i = n; i >= 1; i--)
        if (!st[i])
            st[i] = st[i+1];
    int answer = 0;
    for(int l = 1; l <= n; ++l)
        for(int r = l; r <= n; ++r){
            v.clear();
            for(int j = st[l]; j <= ed[r]; ++j)
                v.pb(p[j]);
            if(!check())
                continue;
            for(auto &i : v)
                adj[i.ff].pb(i.ss);
            for (int j = 1; j <= m; j++)
                love[j] = -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 and ok; i++)
                ok &= (love[i] != -1);
            answer += ok;
            for(int i = l; i <= r; ++i)
                adj[i].clear();
        }
    printf("%d\n", answer);
    return 0;
}

Compilation message

marriage.cpp: In function 'int main()':
marriage.cpp:43:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     scanf("%d%d%d", &n, &m, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
marriage.cpp:46:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 |         scanf("%d%d", &a, &b);
      |         ~~~~~^~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2796 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2816 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 2 ms 2652 KB Output is correct
15 Correct 2 ms 2652 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 132 ms 2652 KB Output is correct
20 Correct 34 ms 2652 KB Output is correct
21 Correct 7 ms 2652 KB Output is correct
22 Correct 13 ms 2812 KB Output is correct
23 Correct 48 ms 2652 KB Output is correct
24 Correct 37 ms 2648 KB Output is correct
25 Execution timed out 1598 ms 3156 KB Time limit exceeded
26 Execution timed out 1569 ms 2652 KB Time limit exceeded
27 Correct 364 ms 2648 KB Output is correct
28 Execution timed out 1570 ms 2652 KB Time limit exceeded
29 Execution timed out 1527 ms 2904 KB Time limit exceeded
30 Execution timed out 1510 ms 3160 KB Time limit exceeded
31 Execution timed out 1537 ms 4044 KB Time limit exceeded
32 Execution timed out 1538 ms 2904 KB Time limit exceeded
33 Execution timed out 1536 ms 2652 KB Time limit exceeded
34 Execution timed out 1503 ms 2904 KB Time limit exceeded
35 Execution timed out 1520 ms 5580 KB Time limit exceeded
36 Execution timed out 1552 ms 5064 KB Time limit exceeded
37 Execution timed out 1569 ms 3980 KB Time limit exceeded
38 Execution timed out 1554 ms 5752 KB Time limit exceeded
39 Execution timed out 1516 ms 3152 KB Time limit exceeded
40 Execution timed out 1533 ms 3152 KB Time limit exceeded
41 Execution timed out 1590 ms 3416 KB Time limit exceeded
42 Execution timed out 1600 ms 3664 KB Time limit exceeded
43 Execution timed out 1553 ms 4048 KB Time limit exceeded
44 Execution timed out 1570 ms 5064 KB Time limit exceeded
45 Execution timed out 1555 ms 3668 KB Time limit exceeded
46 Execution timed out 1542 ms 4828 KB Time limit exceeded
47 Execution timed out 1556 ms 5072 KB Time limit exceeded
48 Execution timed out 1565 ms 4948 KB Time limit exceeded
49 Execution timed out 1585 ms 4944 KB Time limit exceeded
50 Execution timed out 1526 ms 3180 KB Time limit exceeded