| Task: | Permutaatio |
| Sender: | Pikaksi |
| Submission time: | 2025-01-18 15:33:25 +0200 |
| Language: | C++ (C++20) |
| Status: | READY |
| Result: | 12 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 12 |
| #2 | WRONG ANSWER | 0 |
| #3 | WRONG ANSWER | 0 |
| 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.00 s | 1, 2, 3 | details |
| #8 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
| #9 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
| #10 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #11 | WRONG ANSWER | 0.00 s | 2, 3 | details |
| #12 | WRONG ANSWER | 0.00 s | 2, 3 | details |
| #13 | ACCEPTED | 0.00 s | 2, 3 | details |
| #14 | ACCEPTED | 0.00 s | 2, 3 | details |
| #15 | ACCEPTED | 0.00 s | 2, 3 | details |
| #16 | WRONG ANSWER | 0.10 s | 3 | details |
| #17 | WRONG ANSWER | 0.24 s | 3 | details |
| #18 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #19 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #20 | ACCEPTED | 0.05 s | 3 | details |
| #21 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
| #22 | ACCEPTED | 0.00 s | 2, 3 | details |
| #23 | ACCEPTED | 0.12 s | 3 | details |
Compiler report
input/code.cpp: In function 'bool ok()':
input/code.cpp:22:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
22 | for (int i = 0; i < nums.size(); i++) {
| ~~^~~~~~~~~~~~~
input/code.cpp: In function 'void solve()':
input/code.cpp:60:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
60 | for (int i = 0; i < sumt.size(); i++) {
| ~~^~~~~~~~~~~~~Code
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
// chmod u+x b.sh
void solve(); int main() {
ios_base::sync_with_stdio(0); cout.tie(0);
solve();
}
vector<int> nums;
vector<int> t1;
vector<int> t2;
vector<pair<int, int>> sumt;
int n;
bool ok()
{
vector<int> dp1(n, 1);
vector<int> dp2(n, 1);
for (int i = 0; i < nums.size(); i++) {
for (int k = i - 1; k >= 0; k--) {
if (nums[k] < nums[i]) dp1[i] = max(dp1[i], dp1[k] + 1);
}
if (dp1[i] != t1[i]) return false;
}
for (int i = n - 1; i >= 0; i--) {
for (int k = i + 1; k < n; k++) {
if (nums[k] < nums[i]) dp2[i] = max(dp2[i], dp2[k] + 1);
}
if (dp2[i] != t2[i]) return false;
}
//for (int a : dp2) cout << a << " ";
return true;
}
void solve()
{
cin >> n;
//for (int i = 1; i <= n; i++) nums.push_back(i);
for (int i = 1; i <= n; i++) {
int a;
cin >> a;
t1.push_back(a);
}
for (int i = 1; i <= n; i++) {
int a;
cin >> a;
t2.push_back(a);
}
for (int i = 0; i < n; i++) {
sumt.push_back({t1[i] + t2[i], i});
}
sort(sumt.begin(), sumt.end());
vector<int> anst(n);
int counter = 1;
for (int i = 0; i < sumt.size(); i++) {
anst[sumt[i].second] = counter++;
}
for (int i = 0; i < n; i++) {
nums.push_back(anst[i]);
}
if (!ok()) {
cout << "IMPOSSIBLE";
return;
}
for (int a : anst) cout << a << " ";
}
Test details
Test 1
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 1 1 |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 2
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 2 1 1 1 1 |
| correct output |
|---|
| IMPOSSIBLE |
| user output |
|---|
| IMPOSSIBLE |
Test 3
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 3 1 1 3 3 2 1 |
| correct output |
|---|
| IMPOSSIBLE |
| user output |
|---|
| IMPOSSIBLE |
Test 4
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 3 1 3 2 2 1 3 |
| correct output |
|---|
| IMPOSSIBLE |
| user output |
|---|
| IMPOSSIBLE |
Test 5
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 5 1 2 3 4 5 2 1 1 1 1 |
| correct output |
|---|
| IMPOSSIBLE |
| user output |
|---|
| IMPOSSIBLE |
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 |
| correct output |
|---|
| 1 8 5 7 2 3 4 6 |
| user output |
|---|
| 1 5 3 6 2 4 7 8 |
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 |
| correct output |
|---|
| 3 8 6 5 2 7 4 1 |
| user output |
|---|
| 3 8 6 5 2 7 4 1 |
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 |
| correct output |
|---|
| 1 2 3 4 5 6 7 8 |
| user output |
|---|
| 1 2 3 4 5 6 7 8 |
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 |
| correct output |
|---|
| 8 7 6 5 4 3 2 1 |
| user output |
|---|
| 8 7 6 5 4 3 2 1 |
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 |
| correct output |
|---|
| IMPOSSIBLE |
| user output |
|---|
| IMPOSSIBLE |
Test 11
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 500 1 2 2 3 4 4 5 4 6 4 7 8 5 7 9 ... |
| correct output |
|---|
| 25 205 54 76 500 218 316 181 3... |
| user output |
|---|
| IMPOSSIBLE |
Test 12
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 500 1 2 3 1 1 2 2 4 1 3 5 3 3 3 4 ... |
| correct output |
|---|
| 336 388 404 309 233 377 240 42... |
| user output |
|---|
| IMPOSSIBLE |
Test 13
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 500 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| correct output |
|---|
| 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| 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 ... |
| correct output |
|---|
| 500 499 498 497 496 495 494 49... |
| 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 ... |
| correct output |
|---|
| IMPOSSIBLE |
| user output |
|---|
| IMPOSSIBLE |
Test 16
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 200000 1 2 2 3 2 1 3 3 2 4 2 3 5 4 5 ... |
| correct output |
|---|
| 12162 165274 130162 168624 391... |
| user output |
|---|
| IMPOSSIBLE |
Test 17
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 200000 1 1 2 3 3 2 4 3 4 5 2 5 6 7 3 ... |
| correct output |
|---|
| 191389 13806 133836 173924 159... |
| user output |
|---|
| IMPOSSIBLE |
Test 18
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200000 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| correct output |
|---|
| 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| user output |
|---|
| (empty) |
Test 19
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 200000 199999 199998 199997 19... |
| user output |
|---|
| (empty) |
Test 20
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| IMPOSSIBLE |
| user output |
|---|
| IMPOSSIBLE |
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 |
| correct output |
|---|
| IMPOSSIBLE |
| user output |
|---|
| IMPOSSIBLE |
Test 22
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 500 1 2 3 2 1 2 1 2 3 3 3 3 4 1 5 ... |
| correct output |
|---|
| IMPOSSIBLE |
| user output |
|---|
| IMPOSSIBLE |
Test 23
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 200000 1 1 1 2 2 3 1 3 4 1 5 4 2 5 6 ... |
| correct output |
|---|
| IMPOSSIBLE |
| user output |
|---|
| IMPOSSIBLE |
