CSES - Datatähti 2025 loppu

CSES - Datatähti 2025 loppu - Results

Submission details
Task:	Permutaatio
Sender:	aatukaj
Submission time:	2025-01-18 15:12:31 +0200
Language:	C++ (C++17)
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	12
#2	ACCEPTED	33
#3	ACCEPTED	55

Test results
test	verdict	time	group
#1	ACCEPTED	0.01 s	1, 2, 3	details
#2	ACCEPTED	0.01 s	1, 2, 3	details
#3	ACCEPTED	0.01 s	1, 2, 3	details
#4	ACCEPTED	0.01 s	1, 2, 3	details
#5	ACCEPTED	0.01 s	1, 2, 3	details
#6	ACCEPTED	0.01 s	1, 2, 3	details
#7	ACCEPTED	0.01 s	1, 2, 3	details
#8	ACCEPTED	0.01 s	1, 2, 3	details
#9	ACCEPTED	0.01 s	1, 2, 3	details
#10	ACCEPTED	0.01 s	1, 2, 3	details
#11	ACCEPTED	0.01 s	2, 3	details
#12	ACCEPTED	0.01 s	2, 3	details
#13	ACCEPTED	0.01 s	2, 3	details
#14	ACCEPTED	0.01 s	2, 3	details
#15	ACCEPTED	0.01 s	2, 3	details
#16	ACCEPTED	0.19 s	3	details
#17	ACCEPTED	0.19 s	3	details
#18	ACCEPTED	0.16 s	3	details
#19	ACCEPTED	0.17 s	3	details
#20	ACCEPTED	0.10 s	3	details
#21	ACCEPTED	0.01 s	1, 2, 3	details
#22	ACCEPTED	0.01 s	2, 3	details
#23	ACCEPTED	0.13 s	3	details

Code

#include <bits/stdc++.h> 
#define all(v) (v).begin(), (v).end()
using namespace std;
const int maxN = 2e5+10;
int a[maxN], b[maxN];
vector<int> adj[maxN];
int prv[maxN];
int first[maxN];

bool ok = true;
int vis[maxN];
vector<int> topo;
int ans[maxN];
void dfs(int v) {
	vis[v] = 2;
	for (auto u: adj[v]) {
		if (u==v) continue;
		if (vis[u]==2) {
			ok = false;
			break;
		}
		if (!vis[u]) dfs(u);
	}
	vis[v] = 1;
	topo.push_back(v);
}
void solve() {
	int n;
	cin >> n;
	for (int i=0; i<n; i++) cin >> a[i];
	for (int i=0; i<n; i++) cin >> b[i];
	// toposor tez
	
	for (int i=1; i<=n; i++) prv[i] = -1; 
	for (int i=0; i<n; i++) {
		if (a[i]!=1) {
			if (prv[a[i]-1]==-1) {
				cout << "IMPOSSIBLE\n";
				return;
			}
			adj[i].push_back(prv[a[i]-1]);
		}
		prv[a[i]] = i;
	}

	for (int i=1; i<=n; i++) prv[i] = -1; 
	for (int i=n-1; i>=0; i--) {
		if (prv[a[i]]!=-1) {
			adj[i].push_back(prv[a[i]]);
		}
		prv[a[i]] = i;
	}

	for (int i=1; i<=n; i++) prv[i] = -1; 
	for (int i=n-1; i>=0; i--) {
		if (b[i]!=1) {
			if (prv[b[i]-1]==-1) {
				cout << "IMPOSSIBLE\n";
				return;
			}
			adj[i].push_back(prv[b[i]-1]);
		}
		prv[b[i]] = i;
	}

	for (int i=1; i<=n; i++) prv[i] = -1; 
	for (int i=0; i<n; i++) {
		if (prv[b[i]]!=-1) {
			adj[i].push_back(prv[b[i]]);
		}
		prv[b[i]] = i;
	}

	for (int i=0; i<n; i++) {
		sort(all(adj[i]));
		adj[i].erase(unique(all(adj[i])), adj[i].end());
	}

	for (int i=0; i<n; i++) {
		if (!vis[i]) dfs(i);
	}
	if (!ok) {
		cout << "IMPOSSIBLE\n";
		return;
	}

	cout << '\n';
	reverse(all(topo));
	for (int i=0; i<n; i++) {
		ans[topo[i]] = n-i;
	}
	for (int i=0; i<n; i++) cout << ans[i] << ' ';
	cout << '\n';
}
int main() {
	solve();
}

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: ACCEPTED

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
`8 113 39 44 293 117 201 107 20...` Truncated

Test 12

Group: 2, 3

Verdict: ACCEPTED

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
`140 182 223 139 126 181 127 22...` Truncated

Test 13

Group: 2, 3

Verdict: ACCEPTED

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
`1 2 3 4 5 6 7 8 9 10 11 12 13 ...` Truncated

Test 14

Group: 2, 3

Verdict: ACCEPTED

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
`500 499 498 497 496 495 494 49...` Truncated

Test 15

Group: 2, 3

Verdict: ACCEPTED

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
`IMPOSSIBLE` view save

Test 16

Group: 3

Verdict: ACCEPTED

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
`6252 81401 74675 81433 22717 2...` Truncated

Test 17

Group: 3

Verdict: ACCEPTED

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
`102726 6495 71905 101144 84163...` Truncated

Test 18

Group: 3

Verdict: ACCEPTED

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
`1 2 3 4 5 6 7 8 9 10 11 12 13 ...` Truncated

Test 19

Group: 3

Verdict: ACCEPTED

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
`200000 199999 199998 199997 19...` Truncated

Test 20

Group: 3

Verdict: ACCEPTED

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
`IMPOSSIBLE` view save

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: ACCEPTED

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
`IMPOSSIBLE` view save

Test 23

Group: 3

Verdict: ACCEPTED

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
`IMPOSSIBLE` view save

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 (aatukaj)