제출 #477933

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
477933		stefantaga	Restore Array (RMI19_restore)	C++14	0 / 100	76 ms	94136 KiB

restore

#include <bits/stdc++.h>

using namespace std;
int min1(int a,int b)
{
    if (a<b)
    {
        return a;
    }
    return b;
}
int max1(int a,int b)
{
    if (a>b)
    {
        return a;
    }
    return b;
}
int n,m,i,j,st,dr,k,val2,val[5005],maxi[5005][5005],mini[5005][5005];
int main()
{
    ios_base :: sync_with_stdio(false);
    cin.tie(0);
    #ifdef HOME
    ifstream cin("date.in");
    ofstream cout("date.out");
    #endif // HOME
    cin>>n>>m;
    for (i=1;i<=n;i++)
    {
        for (j=i+1;j<=n;j++)
        {
            maxi[i][j]=j-i+1;
        }
    }
    for (i=1;i<=m;i++)
    {
        cin>>st>>dr>>k>>val2;
        st++;
        dr++;
        if (val2==1)
        {
            maxi[st][dr]=min1(maxi[st][dr],k-1);
        }
        else
        {
            mini[st][dr]=max1(mini[st][dr],k);
        }
    }
    for (i=1;i<=n;i++)
    {
        for (j=i+1;j<=n;j++)
        {
            if (mini[i][j]>maxi[i][j])
            {
                cout<<"-1";
                return 0;
            }
        }
    }
    for (i=1;i<=n;i++)
    {
        val[i]=-1;
    }
    for (i=1;i<=n;i++)
    {
        for (j=i+1;j<=n;j++)
        {
            if (mini[i][j]==maxi[i][j]&&mini[i][j]==0)
            {
                for (k=i;k<=j;k++)
                {
                    if (val[k]==1)
                    {
                        cout<<"-1";
                        return 0;
                    }
                    val[k]=0;
                }
            }
            else
            if (mini[i][j]==maxi[i][j]&&mini[i][j]==j-i+1)
            {
                for (k=i;k<=j;k++)
                {
                    if (val[k]==0)
                    {
                        cout<<"-1";
                        return 0;
                    }
                    val[k]=1;
                }
            }
        }
    }
    for (i=1;i<=n;i++)
    {
        if (val[k]==-1)
        {
            cout<<"1";
        }
        else
        {
            cout<<1-val[k];
        }
    }
    return 0;
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 13
• Subtask 3: 0 / 25
• Subtask 4: 0 / 55