oj.uz

답안 #90031

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
90031 2018-12-19T18:12:49 Z Bodo171 결혼 문제 (IZhO14_marriage) C++14
82 / 100
 1500 ms 3332 KB 
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
const int nmax=30005;
const int mmax=100005;
vector<int> v[nmax];
int l[nmax],r[nmax],L[nmax],R[nmax];
int ls[mmax];
bool viz[nmax];
bool changed;
int n,m,i,j,k,a,b,p,cupl,ans,nr;
bool cup(int x)
{
    if(viz[x])
        return 0;
    viz[x]=1;
    for(int it=L[x];it<=R[x];it++)
        if(!r[ls[it]])
    {
        l[x]=ls[it];
        r[ls[it]]=x;
        return 1;
    }
    for(int it=L[x];it<=R[x];it++)
        if(cup(r[ls[it]]))
    {
        l[x]=ls[it];
        r[ls[it]]=x;
        return 1;
    }
    return 0;
}
void cc()
{
    changed=1;
    while(changed&&cupl<m)
    {
        changed=0;
        for(j=p; j<=i; j++)
            if((!l[j])&&cup(j))
            {
                cupl++;
                changed=1;
            }
        for(j=p; j<=i; j++)
            viz[j]=0;

    }
}
int ch,num;
string s;
int getnum()
{
    num=0;
    while(s[ch]>='0'&&s[ch]<='9')
    {
        num=num*10+s[ch]-'0';
        ch++;
    }
    ch++;
    return num;
}
int main()
{
    //freopen("data.in","r",stdin);
    ios_base::sync_with_stdio(false);
    cin>>n>>m>>k;
    getline(cin,s);
    for(i=1;i<=k;i++)
    {
        getline(cin,s);ch=0;
        a=getnum();b=getnum();
        v[a].push_back(b);
    }
    for(i=1;i<=n;i++)
    {
        L[i]=nr+1;
        for(j=0;j<v[i].size();j++)
        {
            ls[++nr]=v[i][j];
        }
        R[i]=nr;
    }
    p=1;
    for(i=1;i<=n;i++)
    {
        if(i>=m)cc();
        while(cupl==m)
        {
            if(l[p])
                r[l[p]]=0,cupl--;
            p++;
            cc();

        }
        ans+=(p-1);
    }
    cout<<ans;
    return 0;
}

Compilation message

marriage.cpp: In function 'int main()':
marriage.cpp:81:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(j=0;j<v[i].size();j++)
                 ~^~~~~~~~~~~~

Subtask #1
82.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1016 KB Output is correct
2 Correct 2 ms 1140 KB Output is correct
3 Correct 3 ms 1192 KB Output is correct
4 Correct 3 ms 1192 KB Output is correct
5 Correct 3 ms 1192 KB Output is correct
6 Correct 2 ms 1192 KB Output is correct
7 Correct 3 ms 1284 KB Output is correct
8 Correct 3 ms 1284 KB Output is correct
9 Correct 3 ms 1344 KB Output is correct
10 Correct 2 ms 1344 KB Output is correct
11 Correct 2 ms 1344 KB Output is correct
12 Correct 2 ms 1344 KB Output is correct
13 Correct 2 ms 1344 KB Output is correct
14 Correct 2 ms 1344 KB Output is correct
15 Correct 3 ms 1344 KB Output is correct
16 Correct 3 ms 1344 KB Output is correct
17 Correct 3 ms 1344 KB Output is correct
18 Correct 3 ms 1344 KB Output is correct
19 Correct 3 ms 1404 KB Output is correct
20 Correct 3 ms 1408 KB Output is correct
21 Correct 0 ms 1408 KB Output is correct
22 Correct 3 ms 1408 KB Output is correct
23 Correct 3 ms 1408 KB Output is correct
24 Correct 3 ms 1408 KB Output is correct
25 Correct 4 ms 1408 KB Output is correct
26 Correct 5 ms 1408 KB Output is correct
27 Correct 4 ms 1408 KB Output is correct
28 Correct 3 ms 1408 KB Output is correct
29 Correct 19 ms 1484 KB Output is correct
30 Correct 17 ms 1484 KB Output is correct
31 Correct 9 ms 1788 KB Output is correct
32 Correct 22 ms 1788 KB Output is correct
33 Correct 5 ms 1788 KB Output is correct
34 Correct 4 ms 1788 KB Output is correct
35 Correct 12 ms 2300 KB Output is correct
36 Correct 10 ms 2300 KB Output is correct
37 Correct 21 ms 2300 KB Output is correct
38 Correct 773 ms 2560 KB Output is correct
39 Correct 187 ms 2560 KB Output is correct
40 Correct 1016 ms 2560 KB Output is correct
41 Execution timed out 1571 ms 2560 KB Time limit exceeded
42 Execution timed out 1561 ms 2560 KB Time limit exceeded
43 Execution timed out 1566 ms 2560 KB Time limit exceeded
44 Execution timed out 1566 ms 2612 KB Time limit exceeded
45 Execution timed out 1560 ms 2612 KB Time limit exceeded
46 Execution timed out 1558 ms 3332 KB Time limit exceeded
47 Execution timed out 1555 ms 3332 KB Time limit exceeded
48 Execution timed out 1569 ms 3332 KB Time limit exceeded
49 Execution timed out 1561 ms 3332 KB Time limit exceeded
50 Correct 1346 ms 3332 KB Output is correct