oj.uz

답안 #821550

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
821550 2023-08-11T11:30:04 Z PVM_pvm Watermelon (INOI20_watermelon) C++17
31 / 100
 36 ms 3128 KB 
#include<bits/stdc++.h>
using namespace std;
#define MAXX 100007
#define MAXN 13
int b[MAXX],b2[MAXX],n,k;
struct perm
{
    int ch[MAXN];
    perm(int a[])
    {
        for (int q=1;q<=n;q++) ch[q]=a[q];
    }
    void show()
    {
        //cout<<"P:";
        for (int q=1;q<=n;q++) cout<<ch[q]<<" ";
        cout<<"\n";
    }
};
vector<perm> ans;
int cur[MAXN],sb[MAXN];
bool dt[MAXN];
void check()
{
    for (int q=1;q<=n;q++) sb[q]=-1;
    for (int q=1;q<=n;q++) dt[q]=false;
    for (int tm=1;true;tm++)
    {
        bool smyrt=false;
        for (int q=1;q<=n;q++)
        {
            if (dt[q]) continue;
            int next=q+1;
            for (next=q+1;next<=n;next++)
            {
                if (!dt[next]) break;
            }
            if (next>n) break;
            if (cur[next]>cur[q])
            {
                dt[q]=true;
                smyrt=true;
                sb[q]=tm;
            }
        }
        if (!smyrt) break;
    }
    bool pr=true;
    for (int q=1;q<=n;q++)
    {
        if (sb[q]!=b[q]) pr=false;
    }
    if (pr)
    {
        perm spr(cur);
        ans.push_back(spr);
    }
}
int ind[MAXN];
int ind2[MAXN];
bool cmp(perm &a, perm &b){
    for (int q=1;q<=n;q++)
    {
        ind[a.ch[q]] = q;
        ind2[b.ch[q]] = q;
    }
    for (int q=1;q<=n;q++)
    {
        if (ind[q] < ind2[q]) return 1;
        if (ind[q] > ind2[q]) return 0;
    }
    return 0;
}
int ansk[MAXX];
int pr1[MAXX];
int chb[MAXX];
int posOfLST[MAXX];
int bfMe[MAXX];
bool finalcheck()
{
    stack<pair<int,int>> st;
    chb[n]=-1;
    //if (chb[n]!=b[n]) return false;
    st.push({ansk[n],n});
    for (int q=n-1;q>=1;q--)
    {
        chb[q]=-2;
        while (true)
        {
            if (st.empty())
            {
                chb[q]=-1;
                st.push({ansk[q],q});
                break;
            }
            int chislo = st.top().first;
            int pos = st.top().second;
            if (ansk[q]>chislo)
            {
                chb[q]=max(chb[q],chb[pos]);
                st.pop();
                continue;
            }
            if (chb[q]==-2) chb[q]=1;
            else chb[q]++;
            st.push({ansk[q],q});
            break;
        }
        //cout<<q<<":"<<chb[q]<<" "<<b[q]<<"\n";
        //if (chb[q]!=b[q]2) return false;
    }
    for (int q=1;q<=n;q++)
    {
        if (chb[q]!=b2[q]) return false;
    }
    return true;
}
int lf[MAXN],rf[MAXN];
void getSecond()
{
    int lst=0;
    for (int q=1;q<=n;q++)
    {
        if (b[q]==-1)
        {
            lf[q]=lst;
        }
        if (b[q]==1)
        {
            lst=q;
        }
    }
    lst=0;
    for (int q=n;q>=1;q--)
    {
        if (b[q]==-1)
        {
            rf[q]=lst;
        }
        if (b[q]==1)
        {
            lst=q;
        }
    }
    int pos=0;
    for (int q=1;q<=n;q++)
    {
        if (lf[q]!=0)
        {
            pos=q;
            break;
        }
    }
    if (pos==0)
    {
        cout<<"-1\n";
        return;
    }
    int pos1=lf[pos];
    while (bfMe[pos1]!=0)
    {
        pos1=bfMe[pos1];
    }
    if (rf[pos]!=0)
    {
        int pos2=rf[pos];
        for (int q=pos2;q<=n;q++)
        {
            if (b[q]==-1) break;
            if (b[q]==1) pos2=q;
        }
        swap(ansk[pos1],ansk[pos2]);
        for (int q=1;q<=n;q++)
        {
            cout<<ansk[q]<<" ";
        }
        cout<<"\n";
        return;
    }
    if (b[n-1]!=-1)
    {
        cout<<"-1\n";
        return;
    }
    swap(ansk[pos1],ansk[n]);
    for (int q=1;q<=n;q++)
    {
        cout<<ansk[q]<<" ";
    }
    cout<<"\n";
}
int main()
{
    cin>>n>>k;
    if (k!=1 && k!=2)
    {
        for (int q=1;q<=n;q++) cin>>b[q];
        for (int q=1;q<=n;q++) cur[q]=q;
        check();
        while (next_permutation(cur+1,cur+n+1)) check();
        sort(ans.begin(),ans.end(),cmp);
        if (k<ans.size()) ans[k-1].show();
        else cout<<"-1\n";
        return 0;
    }
    if (k==1)
    {
        for (int q=1;q<=n;q++) cin>>b[q];
        for (int q=1;q<=n;q++) b2[q]=b[q];
        int br2=0;
        for (int q=1;q<=n;q++)
        {
            if (b[q]!=-1) br2++;
        }
        if (b[n]==-1) posOfLST[n+2]=n;
        else posOfLST[b[n]]=n;
        for (int q=n-1;q>=1;q--)
        {
            if (b[q]==-1) continue;
            if (b[q]==1) {posOfLST[b[q]]=q;continue;}
            int pos=posOfLST[b[q]-1];
            if (pos==0)
            {
                cout<<"-1\n";
                return 0;
            }
            if (bfMe[pos]!=0)
            {
                cout<<"-1\n";
                return 0;
            }
            bfMe[pos]=q;
            posOfLST[b[q]]=q;
        }
        int dok=1;
        for (int q=1;q<=n;q++)
        {
            if (b[q]==1)
            {
                ansk[q]=dok;
                //cout<<q<<" "<<dok<<"\n";
                dok++;
                int w=bfMe[q];
                while (w!=0)
                {
                    ansk[w]=dok;
                    //cout<<w<<" "<<dok<<"\n";
                    dok++;
                    w=bfMe[w];
                }
            }
        }
        int tm=n;
        for (int q=1;q<=n;q++)
        {
            if (ansk[q]==0)
            {
                ansk[q]=tm;
                tm--;
            }
        }
        if (finalcheck())
        {
            for (int q=1;q<=n;q++)
            {
                cout<<ansk[q]<<" ";
            }
            cout<<"\n";
        }
        else
        {
            cout<<"-1\n";
        }
    }
    else
    {
        for (int q=1;q<=n;q++) cin>>b[q];
        for (int q=1;q<=n;q++) b2[q]=b[q];
        int br2=0;
        for (int q=1;q<=n;q++)
        {
            if (b[q]!=-1) br2++;
        }
        if (b[n]==-1) posOfLST[n+2]=n;
        else posOfLST[b[n]]=n;
        for (int q=n-1;q>=1;q--)
        {
            if (b[q]==-1) continue;
            if (b[q]==1) {posOfLST[b[q]]=q;continue;}
            int pos=posOfLST[b[q]-1];
            if (pos==0)
            {
                cout<<"-1\n";
                return 0;
            }
            if (bfMe[pos]!=0)
            {
                cout<<"-1\n";
                return 0;
            }
            bfMe[pos]=q;
            posOfLST[b[q]]=q;
        }
        int dok=1;
        for (int q=1;q<=n;q++)
        {
            if (b[q]==1)
            {
                ansk[q]=dok;
                //cout<<q<<" "<<dok<<"\n";
                dok++;
                int w=bfMe[q];
                while (w!=0)
                {
                    ansk[w]=dok;
                    //cout<<w<<" "<<dok<<"\n";
                    dok++;
                    w=bfMe[w];
                }
            }
        }
        int tm=n;
        for (int q=1;q<=n;q++)
        {
            if (ansk[q]==0)
            {
                ansk[q]=tm;
                tm--;
            }
        }
        if (finalcheck())
        {
            getSecond();
        }
        else
        {
            cout<<"-1\n";
        }
    }
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:202:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<perm>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  202 |         if (k<ans.size()) ans[k-1].show();
      |             ~^~~~~~~~~~~

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Incorrect 0 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Incorrect 0 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 1492 KB Output is correct
2 Correct 11 ms 708 KB Output is correct
3 Correct 11 ms 1492 KB Output is correct
4 Correct 10 ms 596 KB Output is correct
5 Correct 11 ms 1576 KB Output is correct
6 Correct 10 ms 1580 KB Output is correct
7 Correct 13 ms 1616 KB Output is correct
8 Correct 10 ms 1532 KB Output is correct
9 Correct 12 ms 1516 KB Output is correct
10 Correct 11 ms 1576 KB Output is correct
11 Correct 21 ms 2752 KB Output is correct
12 Correct 21 ms 2764 KB Output is correct
13 Correct 21 ms 2756 KB Output is correct
14 Correct 21 ms 2736 KB Output is correct
15 Correct 21 ms 1004 KB Output is correct
16 Correct 26 ms 1108 KB Output is correct
17 Correct 22 ms 1048 KB Output is correct
18 Correct 23 ms 992 KB Output is correct
19 Correct 22 ms 1056 KB Output is correct
20 Correct 27 ms 1060 KB Output is correct
21 Correct 22 ms 1100 KB Output is correct
22 Correct 22 ms 1004 KB Output is correct
23 Correct 21 ms 1072 KB Output is correct
24 Correct 30 ms 2928 KB Output is correct
25 Correct 29 ms 2900 KB Output is correct
26 Correct 36 ms 2856 KB Output is correct
27 Correct 35 ms 2856 KB Output is correct
28 Correct 30 ms 2872 KB Output is correct
29 Correct 29 ms 2888 KB Output is correct
30 Correct 8 ms 980 KB Output is correct
31 Correct 12 ms 1492 KB Output is correct
32 Correct 25 ms 2576 KB Output is correct
33 Correct 24 ms 2772 KB Output is correct
34 Correct 3 ms 468 KB Output is correct
35 Correct 5 ms 784 KB Output is correct
36 Correct 13 ms 1492 KB Output is correct
37 Correct 24 ms 2776 KB Output is correct
38 Correct 22 ms 2824 KB Output is correct
39 Correct 26 ms 2772 KB Output is correct
40 Correct 21 ms 2440 KB Output is correct
41 Correct 31 ms 3128 KB Output is correct

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 1492 KB Output is correct
2 Correct 11 ms 708 KB Output is correct
3 Correct 11 ms 1492 KB Output is correct
4 Correct 10 ms 596 KB Output is correct
5 Correct 11 ms 1576 KB Output is correct
6 Correct 10 ms 1580 KB Output is correct
7 Correct 13 ms 1616 KB Output is correct
8 Correct 10 ms 1532 KB Output is correct
9 Correct 12 ms 1516 KB Output is correct
10 Correct 11 ms 1576 KB Output is correct
11 Correct 21 ms 2752 KB Output is correct
12 Correct 21 ms 2764 KB Output is correct
13 Correct 21 ms 2756 KB Output is correct
14 Correct 21 ms 2736 KB Output is correct
15 Correct 21 ms 1004 KB Output is correct
16 Correct 26 ms 1108 KB Output is correct
17 Correct 22 ms 1048 KB Output is correct
18 Correct 23 ms 992 KB Output is correct
19 Correct 22 ms 1056 KB Output is correct
20 Correct 27 ms 1060 KB Output is correct
21 Correct 22 ms 1100 KB Output is correct
22 Correct 22 ms 1004 KB Output is correct
23 Correct 21 ms 1072 KB Output is correct
24 Correct 30 ms 2928 KB Output is correct
25 Correct 29 ms 2900 KB Output is correct
26 Correct 36 ms 2856 KB Output is correct
27 Correct 35 ms 2856 KB Output is correct
28 Correct 30 ms 2872 KB Output is correct
29 Correct 29 ms 2888 KB Output is correct
30 Correct 8 ms 980 KB Output is correct
31 Correct 12 ms 1492 KB Output is correct
32 Correct 25 ms 2576 KB Output is correct
33 Correct 24 ms 2772 KB Output is correct
34 Correct 3 ms 468 KB Output is correct
35 Correct 5 ms 784 KB Output is correct
36 Correct 13 ms 1492 KB Output is correct
37 Correct 24 ms 2776 KB Output is correct
38 Correct 22 ms 2824 KB Output is correct
39 Correct 26 ms 2772 KB Output is correct
40 Correct 21 ms 2440 KB Output is correct
41 Correct 31 ms 3128 KB Output is correct
42 Incorrect 8 ms 1236 KB Output isn't correct
43 Halted 0 ms 0 KB -

Subtask #5
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Incorrect 0 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -