oj.uz

답안 #38525

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
38525 2018-01-04T11:00:54 Z alenam0161 결혼 문제 (IZhO14_marriage) C++14
66 / 100
 1500 ms 3124 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 1e3+7;
vector<int> g[N],g1[N],gag,kox;
int n,m,k;
bool used[N];
int ma[N];
bool try_khun(int v){
    if(used[v]==true)return false;
    used[v]=true;
    gag.push_back(v);
    for(auto to:g[v]){
        if(ma[to]==-1||try_khun(ma[to])){
                if(ma[to]==-1)kox.push_back(to);
            ma[to]=v;
            return true;
        }
    }
    return false;
}
int main(){
    memset(ma,-1,sizeof(ma));
    scanf("%d%d%d",&n,&m,&k);
    for(int i=1;i<=k;++i){
        int u,v;
        scanf("%d%d",&v,&u);
        g[v].push_back(u);
        g1[u].push_back(v);
    }
    int how=0;
    long long ans=0;
    int l=1;
    bool ok=false;
    for(int i=1;i<=n;++i){
        if(try_khun(i))how++;
        bool ok=false;
        while(how==m||ok==false){
            l++;
            ok=true;
            how=0;
            for(int to:kox){
                ma[to]=-1;
            }
            kox.clear();
            for(int j=l;j<=i;++j){
                for(int to:gag)used[to]=false;
                gag.clear();
                how+=try_khun(j);
            }
        }
        l--;
        for(int to:gag)used[to]=false;
            gag.clear();
        how+=try_khun(l);
    //    cout<<l<<" "<<i<<" "<<how<<endl;
        if(how==m)
        ans+=l;
    }
    cout<<ans<<endl;
    return 0;
}

Compilation message

marriage.cpp: In function 'int main()':
marriage.cpp:35:10: warning: unused variable 'ok' [-Wunused-variable]
     bool ok=false;
          ^
marriage.cpp:25:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d",&n,&m,&k);
                             ^
marriage.cpp:28:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&v,&u);
                            ^

Subtask #1
66.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2068 KB Output is correct
2 Correct 0 ms 2068 KB Output is correct
3 Correct 0 ms 2068 KB Output is correct
4 Correct 0 ms 2068 KB Output is correct
5 Correct 0 ms 2068 KB Output is correct
6 Correct 0 ms 2068 KB Output is correct
7 Correct 0 ms 2068 KB Output is correct
8 Correct 0 ms 2068 KB Output is correct
9 Correct 0 ms 2068 KB Output is correct
10 Correct 0 ms 2068 KB Output is correct
11 Correct 0 ms 2068 KB Output is correct
12 Correct 0 ms 2068 KB Output is correct
13 Correct 0 ms 2068 KB Output is correct
14 Correct 0 ms 2068 KB Output is correct
15 Correct 0 ms 2068 KB Output is correct
16 Correct 0 ms 2068 KB Output is correct
17 Correct 0 ms 2068 KB Output is correct
18 Correct 0 ms 2068 KB Output is correct
19 Correct 0 ms 2068 KB Output is correct
20 Correct 0 ms 2068 KB Output is correct
21 Correct 0 ms 2068 KB Output is correct
22 Correct 0 ms 2068 KB Output is correct
23 Correct 3 ms 2068 KB Output is correct
24 Correct 0 ms 2068 KB Output is correct
25 Correct 29 ms 2200 KB Output is correct
26 Correct 63 ms 2068 KB Output is correct
27 Correct 3 ms 2068 KB Output is correct
28 Correct 23 ms 2068 KB Output is correct
29 Correct 823 ms 2200 KB Output is correct
30 Correct 666 ms 2200 KB Output is correct
31 Correct 606 ms 2596 KB Output is correct
32 Execution timed out 1500 ms 2200 KB Execution timed out
33 Correct 6 ms 2068 KB Output is correct
34 Correct 876 ms 2068 KB Output is correct
35 Execution timed out 1500 ms 3124 KB Execution timed out
36 Execution timed out 1500 ms 3124 KB Execution timed out
37 Runtime error 0 ms 2068 KB Execution killed with signal 11 (could be triggered by violating memory limits)
38 Runtime error 16 ms 2860 KB Execution killed with signal 11 (could be triggered by violating memory limits)
39 Runtime error 0 ms 2068 KB Execution killed with signal 11 (could be triggered by violating memory limits)
40 Runtime error 0 ms 2068 KB Execution killed with signal 11 (could be triggered by violating memory limits)
41 Runtime error 0 ms 2068 KB Execution killed with signal 11 (could be triggered by violating memory limits)
42 Runtime error 0 ms 2068 KB Execution killed with signal 11 (could be triggered by violating memory limits)
43 Runtime error 0 ms 2068 KB Execution killed with signal 11 (could be triggered by violating memory limits)
44 Runtime error 0 ms 2200 KB Execution killed with signal 11 (could be triggered by violating memory limits)
45 Runtime error 0 ms 2068 KB Execution killed with signal 11 (could be triggered by violating memory limits)
46 Runtime error 0 ms 2068 KB Execution killed with signal 11 (could be triggered by violating memory limits)
47 Runtime error 0 ms 2068 KB Execution killed with signal 11 (could be triggered by violating memory limits)
48 Runtime error 0 ms 2068 KB Execution killed with signal 11 (could be triggered by violating memory limits)
49 Runtime error 0 ms 2068 KB Execution killed with signal 11 (could be triggered by violating memory limits)
50 Runtime error 0 ms 2068 KB Execution killed with signal 11 (could be triggered by violating memory limits)