CSES - Datatähti 2025 loppu

CSES - Datatähti 2025 loppu - Results

Submission details
Task:	Piiri
Sender:	maweiyin24562
Submission time:	2025-01-18 16:58:59 +0200
Language:	C++ (C++11)
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	TIME LIMIT EXCEEDED	0
#2	TIME LIMIT EXCEEDED	0
#3	TIME LIMIT EXCEEDED	0
#4	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	TIME LIMIT EXCEEDED	--	1, 2, 4	details
#2	TIME LIMIT EXCEEDED	--	1, 2, 4	details
#3	TIME LIMIT EXCEEDED	--	1, 2, 4	details
#4	TIME LIMIT EXCEEDED	--	1, 2, 4	details
#5	TIME LIMIT EXCEEDED	--	1, 2, 4	details
#6	TIME LIMIT EXCEEDED	--	1, 2, 4	details
#7	TIME LIMIT EXCEEDED	--	1, 2, 4	details
#8	TIME LIMIT EXCEEDED	--	1, 2, 4	details
#9	TIME LIMIT EXCEEDED	--	1, 2, 4	details
#10	TIME LIMIT EXCEEDED	--	2, 4	details
#11	TIME LIMIT EXCEEDED	--	2, 4	details
#12	TIME LIMIT EXCEEDED	--	2, 4	details
#13	TIME LIMIT EXCEEDED	--	2, 4	details
#14	TIME LIMIT EXCEEDED	--	2, 4	details
#15	TIME LIMIT EXCEEDED	--	2, 4	details
#16	TIME LIMIT EXCEEDED	--	2, 4	details
#17	TIME LIMIT EXCEEDED	--	3	details
#18	TIME LIMIT EXCEEDED	--	3	details
#19	TIME LIMIT EXCEEDED	--	3	details
#20	TIME LIMIT EXCEEDED	--	3	details
#21	TIME LIMIT EXCEEDED	--	3	details
#22	TIME LIMIT EXCEEDED	--	4	details
#23	TIME LIMIT EXCEEDED	--	4	details
#24	TIME LIMIT EXCEEDED	--	4	details
#25	TIME LIMIT EXCEEDED	--	4	details
#26	TIME LIMIT EXCEEDED	--	4	details
#27	TIME LIMIT EXCEEDED	--	4	details
#28	TIME LIMIT EXCEEDED	--	4	details

Code

#include <bits/stdc++.h>

#define ll long long

using namespace std;

const int N=200009;

int n;
int a[N],b[N];
int f[N],g[N];

int v[N];
bool flag;

void dfs(int u){
    if(flag)return;
    if(u==n+1){
        memset(f,0,sizeof(f));
        memset(g,0,sizeof(g));
        for(int i=1;i<=n;i++){
            f[i]=1;
            for(int j=1;j<i;j++){
                if(v[i]>v[j])f[i]=max(f[i],f[j]+1);
            }
        }
        for(int i=n;i>=1;i--){
            g[i]=1;
            for(int j=n;j>i;j--){
                if(v[i]>v[j])g[i]=max(g[i],g[j]+1);
            }
        }
        for(int i=1;i<=n;i++){
            if(a[i]!=f[i]||b[i]!=g[i])return;
        }
        flag=true;
        for(int i=1;i<n;i++){
            cout<<v[i]<<" ";
        }
        cout<<v[n]<<endl;
        return;
    }
    for(int i=1;i<=n;i++){
        v[u]=i;
        dfs(u+1);
    }
}

int main(){
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    for(int i=1;i<=n;i++){
        cin>>b[i];
    }
    dfs(1);
    if(!flag)cout<<"IMPOSSIBLE"<<endl;
    return 0;
}

/*
8
1 2 1 3 2 3 4 4
2 2 1 2 1 1 2 1
*/

Test details

Test 1

Group: 1, 2, 4

Verdict: TIME LIMIT EXCEEDED

input
`2 2 NO 1 2` view save

correct output
(empty)

user output
(empty)

Test 2

Group: 1, 2, 4

Verdict: TIME LIMIT EXCEEDED

input
`2 2 YES 1 2 conj 2 1 1` view save

correct output
(empty)

user output
(empty)

Test 3

Group: 1, 2, 4

Verdict: TIME LIMIT EXCEEDED

input
`10 10 NO 6 2 1 8 3 9 4 10 5 7` view save

correct output
(empty)

user output
(empty)

Test 4

Group: 1, 2, 4

Verdict: TIME LIMIT EXCEEDED

input
`10 10 YES 6 10 2 3 9 8 4 5 7 1 disj 2 2 7 3` view save

correct output
(empty)

user output
(empty)

Test 5

Group: 1, 2, 4

Verdict: TIME LIMIT EXCEEDED

input
`10 10 YES 8 4 9 10 6 3 7 2 1 5 disj 1 5 2 9 1 4 3` view save

correct output
(empty)

user output
(empty)

Test 6

Group: 1, 2, 4

Verdict: TIME LIMIT EXCEEDED

input
`10 10 YES 8 6 2 4 10 5 7 9 1 3 disj 9 8 3 6 2 10 8 7 9 5` view save

correct output
(empty)

user output
(empty)

Test 7

Group: 1, 2, 4

Verdict: TIME LIMIT EXCEEDED

input
`10 10 YES 1 2 3 5 8 6 4 9 10 7 conj 4 2 8 10` view save

correct output
(empty)

user output
(empty)

Test 8

Group: 1, 2, 4

Verdict: TIME LIMIT EXCEEDED

input
`10 10 YES 9 8 3 2 10 6 1 4 5 7 conj 2 5 3 1 2 7 4` view save

correct output
(empty)

user output
(empty)

Test 9

Group: 1, 2, 4

Verdict: TIME LIMIT EXCEEDED

input
`10 10 YES 7 1 5 8 9 4 3 6 2 10 conj 4 8 9 6 3 5 1 10 7 4` view save

correct output
(empty)

user output
(empty)

Test 10

Group: 2, 4

Verdict: TIME LIMIT EXCEEDED

input
`30 30 NO 17 30 6 20 28 16 7 4 14 25 18 ...` view save

correct output
(empty)

user output
(empty)

Test 11

Group: 2, 4

Verdict: TIME LIMIT EXCEEDED

input
`30 30 YES 13 22 6 23 16 20 9 30 8 18 2 1...` view save

correct output
(empty)

user output
(empty)

Test 12

Group: 2, 4

Verdict: TIME LIMIT EXCEEDED

input
`30 30 YES 12 30 22 9 3 7 27 21 2 28 10 1...` view save

correct output
(empty)

user output
(empty)

Test 13

Group: 2, 4

Verdict: TIME LIMIT EXCEEDED

input
`30 30 YES 4 7 27 17 26 24 9 20 19 22 10 ...` view save

correct output
(empty)

user output
(empty)

Test 14

Group: 2, 4

Verdict: TIME LIMIT EXCEEDED

input
`30 30 YES 7 2 24 11 4 30 17 6 9 29 5 22 ...` view save

correct output
(empty)

user output
(empty)

Test 15

Group: 2, 4

Verdict: TIME LIMIT EXCEEDED

input
`30 30 YES 8 12 21 26 3 23 17 4 5 6 22 16...` view save

correct output
(empty)

user output
(empty)

Test 16

Group: 2, 4

Verdict: TIME LIMIT EXCEEDED

input
`30 30 YES 8 20 19 21 24 23 25 28 5 10 13...` view save

correct output
(empty)

user output
(empty)

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1000 999 YES 122 260 455 752 587 951 433 81...` view save

correct output
(empty)

user output
(empty)

Test 18

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1000 999 YES 593 999 981 107 187 851 19 574...` view save

correct output
(empty)

user output
(empty)

Test 19

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1000 999 YES 99 213 558 569 343 613 593 85 ...` view save

correct output
(empty)

user output
(empty)

Test 20

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1000 999 YES 60 15 857 450 862 173 675 384 ...` view save

correct output
(empty)

user output
(empty)

Test 21

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`3 2 YES 3 1 disj 1 2 2 1` view save

correct output
(empty)

user output
(empty)

Test 22

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`1000 1000 NO 493 409 829 533 156 443 530 80...` view save

correct output
(empty)

user output
(empty)

Test 23

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`1000 1000 YES 16 450 665 56 968 1 984 545 90...` view save

correct output
(empty)

user output
(empty)

Test 24

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`1000 1000 YES 503 289 147 513 833 468 199 82...` view save

correct output
(empty)

user output
(empty)

Test 25

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`1000 1000 YES 294 617 164 497 46 961 234 12 ...` view save

correct output
(empty)

user output
(empty)

Test 26

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`1000 1000 YES 465 496 15 263 713 784 337 487...` view save

correct output
(empty)

user output
(empty)

Test 27

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`1000 1000 YES 788 567 826 731 874 95 502 20 ...` view save

correct output
(empty)

user output
(empty)

Test 28

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`1000 1000 YES 611 543 496 586 262 765 461 83...` view save

correct output
(empty)

user output
(empty)

Datatähti 2025 loppu

Piiri

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Tasks

Submissions (maweiyin24562)