CSES - Datatähti 2025 loppu

Submission details
Task:	Permutaatio
Sender:	MikaelM
Submission time:	2025-01-18 15:16:07 +0200
Language:	C++ (C++17)
Status:	READY
Result:	12

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

Test results
test	verdict	time	group
#1	ACCEPTED	0.00 s	1, 2, 3	details
#2	ACCEPTED	0.00 s	1, 2, 3	details
#3	ACCEPTED	0.00 s	1, 2, 3	details
#4	ACCEPTED	0.00 s	1, 2, 3	details
#5	ACCEPTED	0.00 s	1, 2, 3	details
#6	ACCEPTED	0.00 s	1, 2, 3	details
#7	ACCEPTED	0.01 s	1, 2, 3	details
#8	ACCEPTED	0.00 s	1, 2, 3	details
#9	ACCEPTED	0.01 s	1, 2, 3	details
#10	ACCEPTED	0.01 s	1, 2, 3	details
#11	TIME LIMIT EXCEEDED	--	2, 3	details
#12	TIME LIMIT EXCEEDED	--	2, 3	details
#13	TIME LIMIT EXCEEDED	--	2, 3	details
#14	TIME LIMIT EXCEEDED	--	2, 3	details
#15	TIME LIMIT EXCEEDED	--	2, 3	details
#16	RUNTIME ERROR	0.01 s	3	details
#17	RUNTIME ERROR	0.01 s	3	details
#18	RUNTIME ERROR	0.01 s	3	details
#19	RUNTIME ERROR	0.01 s	3	details
#20	RUNTIME ERROR	0.01 s	3	details
#21	ACCEPTED	0.01 s	1, 2, 3	details
#22	TIME LIMIT EXCEEDED	--	2, 3	details
#23	RUNTIME ERROR	0.01 s	3	details

Code

#include<bits/stdc++.h>
using namespace std;
#define all(x) x.begin(),x.end()
using ll = long long;

int a[100], b[100];
int pna[100], pla[100];

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);

    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);

    int n;
    cin >> n;

    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < n; i++) cin >> b[i];

    vector<int> v;
    for (int i = 1; i <= n; i++) v.push_back(i);

    do {

    
        bool ok = true;

        // pna
        for (int i = 0; i < n; i++) {
            pna[i] = 1;
            for (int j = 0; j < i; j++) {
                if (v[j] < v[i]) pna[i] = max(pna[i], pna[j]+1);
            }
            if (pna[i] != a[i]) ok = false;
        }

        // pla
        for (int i = n-1; i >= 0; i--) {
            pla[i] = 1;
            for (int j = i+1; j < n; j++) {
                if (v[j] < v[i]) pla[i] = max(pla[i], pla[j]+1);
            }
            if (pla[i] != b[i]) ok = false;
        }


        if (ok) {
            for (int x : v) cout << x << " ";
            return 0;
        }

        
    } while (next_permutation(all(v)));

    cout << "IMPOSSIBLE";

}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
`1 1 1` view save

correct output
`1` view save

user output
`1` view save

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
`2 1 1 1 1` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
`3 1 1 3 3 2 1` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
`3 1 3 2 2 1 3` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
`5 1 2 3 4 5 2 1 1 1 1` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

input
`8 1 2 2 3 2 3 4 5 1 3 2 2 1 1 1 1` view save

correct output
`1 8 5 7 2 3 4 6` view save

user output
`1 4 3 6 2 5 7 8` view save

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

input
`8 1 2 2 2 1 3 2 1 3 5 4 3 2 3 2 1` view save

correct output
`3 8 6 5 2 7 4 1` view save

user output
`3 7 6 5 2 8 4 1` view save

Test 8

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
`1 2 3 4 5 6 7 8` view save

user output
`1 2 3 4 5 6 7 8` view save

Test 9

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
`8 7 6 5 4 3 2 1` view save

user output
`8 7 6 5 4 3 2 1` view save

Test 10

Group: 1, 2, 3

Verdict: ACCEPTED

input
`8 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 11

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

input
`500 1 2 2 3 4 4 5 4 6 4 7 8 5 7 9 ...` view save

correct output
`25 205 54 76 500 218 316 181 3...` view save

user output
(empty)

Test 12

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

input
`500 1 2 3 1 1 2 2 4 1 3 5 3 3 3 4 ...` view save

correct output
`336 388 404 309 233 377 240 42...` view save

user output
(empty)

Test 13

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

input
`500 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

correct output
`1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

user output
(empty)

Test 14

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

input
`500 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`500 499 498 497 496 495 494 49...` view save

user output
(empty)

Test 15

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

input
`500 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`IMPOSSIBLE` view save

user output
(empty)

Test 16

Group: 3

Verdict: RUNTIME ERROR

input
`200000 1 2 2 3 2 1 3 3 2 4 2 3 5 4 5 ...` view save

correct output
`12162 165274 130162 168624 391...` view save

user output
(empty)

Error:

malloc(): unaligned tcache chunk detected

Test 17

Group: 3

Verdict: RUNTIME ERROR

input
`200000 1 1 2 3 3 2 4 3 4 5 2 5 6 7 3 ...` view save

correct output
`191389 13806 133836 173924 159...` view save

user output
(empty)

Error:

malloc(): unaligned tcache chunk detected

Test 18

Group: 3

Verdict: RUNTIME ERROR

input
`200000 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

correct output
`1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

user output
(empty)

Error:

malloc(): unaligned tcache chunk detected

Test 19

Group: 3

Verdict: RUNTIME ERROR

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`200000 199999 199998 199997 19...` view save

user output
(empty)

Error:

malloc(): unaligned tcache chunk detected

Test 20

Group: 3

Verdict: RUNTIME ERROR

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`IMPOSSIBLE` view save

user output
(empty)

Error:

malloc(): unaligned tcache chunk detected

Test 21

Group: 1, 2, 3

Verdict: ACCEPTED

input
`8 1 1 2 1 2 3 1 3 4 3 3 2 2 3 1 1` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 22

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

input
`500 1 2 3 2 1 2 1 2 3 3 3 3 4 1 5 ...` view save

correct output
`IMPOSSIBLE` view save

user output
(empty)

Test 23

Group: 3

Verdict: RUNTIME ERROR

input
`200000 1 1 1 2 2 3 1 3 4 1 5 4 2 5 6 ...` view save

correct output
`IMPOSSIBLE` view save

user output
(empty)

Error:

malloc(): unaligned tcache chunk detected

Datatähti 2025 loppu

Permutaatio

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

Tasks

Submissions (MikaelM)