oj.uz

답안 #821616

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
821616 2023-08-11T12:07:09 Z PVM_pvm Watermelon (INOI20_watermelon) C++17
7 / 100
 2000 ms 772 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 printthem()
{
        for (int q=1;q<=n;q++)
        {
            cout<<ansk[q]<<" ";
        }
        cout<<"\n";
}
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;
    }
    if (b[n-1]==-1)
    {
        int ch=ansk[n];
        int hpos=0;
        for (int q=1;q<=n;q++)
        {
            if (ansk[q]==ch-1)
            {
                hpos=q;
            }
        }
        swap(ansk[hpos],ansk[n]);
        printthem();
        return;
    }
    int f1=0;
    for (int q=n;q>=1;q--)
    {
        if (b[q]==1)
        {
            f1=q;
            break;
        }
    }
    bool minahminus=false;
    int him4=0;
    for (int q=f1;q>=1;q--)
    {
        if (b[q]==-1) minahminus=true;
        if (b[q]==1 && minahminus)
        {
            him4=q;
            while (bfMe[him4]!=0)
            {
                him4=bfMe[him4];
            }
        }
    }
    if (him4!=0)
    {
        swap(ansk[him4],ansk[f1]);
        printthem();
        return;
    }
    int him=0;
    for (int q=n;q>=1;q--)
    {
        if (b[q]==1)
        {
            int w=q;
            while (bfMe[w]!=0)
            {
                w=bfMe[w];
            }
            if (w!=q)
            {
                him=q;
                break;
            }
        }
    }
    if (him==0)
    {
        if (him==0)
        {
            cout<<"-1\n";
        }
        return;
    }
    int him2=0;
    for (int q=him-1;q>=1;q--)
    {
        if (b[q]==1)
        {
            him2=q;
            while (bfMe[him2]!=0)
            {
                him2=bfMe[him2];
            }
            break;
        }
    }
    if (him2==0)
    {
        cout<<"-1\n";
        return;
    }
    swap(ansk[him],ansk[him2]);
    printthem();
}
int main()
{
    cin>>n>>k;
    if (k!=1 && k!=2 || true)
    {
        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:260:14: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  260 |     if (k!=1 && k!=2 || true)
      |         ~~~~~^~~~~~~
Main.cpp:267:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<perm>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  267 |         if (k<ans.size()) ans[k-1].show();
      |             ~^~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 212 KB Output is correct
2 Correct 37 ms 348 KB Output is correct
3 Correct 379 ms 772 KB Output is correct
4 Correct 373 ms 296 KB Output is correct
5 Correct 375 ms 300 KB Output is correct
6 Correct 35 ms 212 KB Output is correct
7 Correct 376 ms 292 KB Output is correct
8 Correct 387 ms 292 KB Output is correct
9 Correct 33 ms 212 KB Output is correct
10 Correct 33 ms 300 KB Output is correct
11 Correct 4 ms 212 KB Output is correct
12 Correct 376 ms 480 KB Output is correct
13 Correct 383 ms 608 KB Output is correct
14 Correct 378 ms 296 KB Output is correct
15 Correct 380 ms 624 KB Output is correct
16 Correct 377 ms 468 KB Output is correct
17 Correct 394 ms 400 KB Output is correct
18 Correct 33 ms 368 KB Output is correct
19 Correct 386 ms 296 KB Output is correct
20 Correct 377 ms 296 KB Output is correct
21 Correct 381 ms 212 KB Output is correct
22 Correct 382 ms 296 KB Output is correct
23 Correct 381 ms 300 KB Output is correct
24 Correct 391 ms 332 KB Output is correct
25 Correct 377 ms 212 KB Output is correct
26 Correct 385 ms 296 KB Output is correct
27 Correct 392 ms 292 KB Output is correct
28 Correct 386 ms 300 KB Output is correct
29 Correct 405 ms 304 KB Output is correct
30 Correct 4 ms 212 KB Output is correct
31 Correct 3 ms 212 KB Output is correct
32 Correct 3 ms 212 KB Output is correct
33 Correct 5 ms 212 KB Output is correct

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 212 KB Output is correct
2 Correct 37 ms 348 KB Output is correct
3 Correct 379 ms 772 KB Output is correct
4 Correct 373 ms 296 KB Output is correct
5 Correct 375 ms 300 KB Output is correct
6 Correct 35 ms 212 KB Output is correct
7 Correct 376 ms 292 KB Output is correct
8 Correct 387 ms 292 KB Output is correct
9 Correct 33 ms 212 KB Output is correct
10 Correct 33 ms 300 KB Output is correct
11 Correct 4 ms 212 KB Output is correct
12 Correct 376 ms 480 KB Output is correct
13 Correct 383 ms 608 KB Output is correct
14 Correct 378 ms 296 KB Output is correct
15 Correct 380 ms 624 KB Output is correct
16 Correct 377 ms 468 KB Output is correct
17 Correct 394 ms 400 KB Output is correct
18 Correct 33 ms 368 KB Output is correct
19 Correct 386 ms 296 KB Output is correct
20 Correct 377 ms 296 KB Output is correct
21 Correct 381 ms 212 KB Output is correct
22 Correct 382 ms 296 KB Output is correct
23 Correct 381 ms 300 KB Output is correct
24 Correct 391 ms 332 KB Output is correct
25 Correct 377 ms 212 KB Output is correct
26 Correct 385 ms 296 KB Output is correct
27 Correct 392 ms 292 KB Output is correct
28 Correct 386 ms 300 KB Output is correct
29 Correct 405 ms 304 KB Output is correct
30 Correct 4 ms 212 KB Output is correct
31 Correct 3 ms 212 KB Output is correct
32 Correct 3 ms 212 KB Output is correct
33 Correct 5 ms 212 KB Output is correct
34 Execution timed out 2083 ms 212 KB Time limit exceeded
35 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2049 ms 596 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2049 ms 596 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 212 KB Output is correct
2 Correct 37 ms 348 KB Output is correct
3 Correct 379 ms 772 KB Output is correct
4 Correct 373 ms 296 KB Output is correct
5 Correct 375 ms 300 KB Output is correct
6 Correct 35 ms 212 KB Output is correct
7 Correct 376 ms 292 KB Output is correct
8 Correct 387 ms 292 KB Output is correct
9 Correct 33 ms 212 KB Output is correct
10 Correct 33 ms 300 KB Output is correct
11 Correct 4 ms 212 KB Output is correct
12 Correct 376 ms 480 KB Output is correct
13 Correct 383 ms 608 KB Output is correct
14 Correct 378 ms 296 KB Output is correct
15 Correct 380 ms 624 KB Output is correct
16 Correct 377 ms 468 KB Output is correct
17 Correct 394 ms 400 KB Output is correct
18 Correct 33 ms 368 KB Output is correct
19 Correct 386 ms 296 KB Output is correct
20 Correct 377 ms 296 KB Output is correct
21 Correct 381 ms 212 KB Output is correct
22 Correct 382 ms 296 KB Output is correct
23 Correct 381 ms 300 KB Output is correct
24 Correct 391 ms 332 KB Output is correct
25 Correct 377 ms 212 KB Output is correct
26 Correct 385 ms 296 KB Output is correct
27 Correct 392 ms 292 KB Output is correct
28 Correct 386 ms 300 KB Output is correct
29 Correct 405 ms 304 KB Output is correct
30 Correct 4 ms 212 KB Output is correct
31 Correct 3 ms 212 KB Output is correct
32 Correct 3 ms 212 KB Output is correct
33 Correct 5 ms 212 KB Output is correct
34 Execution timed out 2083 ms 212 KB Time limit exceeded
35 Halted 0 ms 0 KB -