Task: | Polygonal Chain |
Sender: | tutis |
Submission time: | 2021-01-30 21:46:33 +0200 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | RUNTIME ERROR | 0 |
#2 | RUNTIME ERROR | 0 |
#3 | RUNTIME ERROR | 0 |
#4 | RUNTIME ERROR | 0 |
#5 | RUNTIME ERROR | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.01 s | 1, 2, 4, 5 | details |
#2 | ACCEPTED | 0.01 s | 1, 2, 4, 5 | details |
#3 | ACCEPTED | 0.01 s | 1, 2, 4, 5 | details |
#4 | RUNTIME ERROR | 0.01 s | 1, 2, 4, 5 | details |
#5 | ACCEPTED | 0.01 s | 1, 2, 4, 5 | details |
#6 | RUNTIME ERROR | 0.01 s | 2, 4, 5 | details |
#7 | RUNTIME ERROR | 0.01 s | 2, 4, 5 | details |
#8 | RUNTIME ERROR | 0.01 s | 2, 4, 5 | details |
#9 | RUNTIME ERROR | 0.01 s | 2, 4, 5 | details |
#10 | RUNTIME ERROR | 0.01 s | 2, 4, 5 | details |
#11 | RUNTIME ERROR | 0.01 s | 4, 5 | details |
#12 | RUNTIME ERROR | 0.02 s | 5 | details |
#13 | RUNTIME ERROR | 0.01 s | 3, 4, 5 | details |
#14 | RUNTIME ERROR | 0.01 s | 3, 4, 5 | details |
#15 | ACCEPTED | 0.01 s | 1, 2, 4, 5 | details |
#16 | RUNTIME ERROR | 0.01 s | 4, 5 | details |
#17 | RUNTIME ERROR | 0.01 s | 4, 5 | details |
#18 | RUNTIME ERROR | 0.02 s | 5 | details |
#19 | RUNTIME ERROR | 0.01 s | 1, 2, 4, 5 | details |
#20 | RUNTIME ERROR | 0.01 s | 2, 4, 5 | details |
#21 | RUNTIME ERROR | 0.01 s | 2, 4, 5 | details |
#22 | RUNTIME ERROR | 0.01 s | 2, 4, 5 | details |
#23 | RUNTIME ERROR | 0.01 s | 4, 5 | details |
#24 | RUNTIME ERROR | 0.01 s | 4, 5 | details |
#25 | RUNTIME ERROR | 0.01 s | 4, 5 | details |
#26 | RUNTIME ERROR | 0.02 s | 5 | details |
#27 | RUNTIME ERROR | 0.02 s | 5 | details |
#28 | RUNTIME ERROR | 0.02 s | 5 | details |
#29 | RUNTIME ERROR | 0.02 s | 5 | details |
#30 | ACCEPTED | 0.01 s | 1, 2, 4, 5 | details |
Compiler report
input/code.cpp: In function 'int main()': input/code.cpp:26:10: warning: unused variable 'c' [-Wunused-variable] clock_t c = clock(); ^
Code
/*input44 3 2 3UDD*/#pragma GCC optimize ("O3")#pragma GCC target ("avx2")#include <bits/stdc++.h>#include <ext/pb_ds/assoc_container.hpp>using namespace std;using namespace __gnu_pbds;template<typename T>using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;template<typename T, typename X>using ordered_map = tree<T, X, less<T>, rb_tree_tag, tree_order_statistics_node_update>;template<typename T, typename X>using fast_map = cc_hash_table<T, X>;//using ull = __uint128_t;using ull = unsigned long long;using ll = long long;using ld = long double;mt19937_64 rng(123);const ll mod = 1000000007;int main(){clock_t c = clock();ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);int n;cin >> n;int P[n];for (int i = 0; i < n; i++)cin >> P[i];string s;cin >> s;int x1[n];int x2[n];for (int i = 0; i < n; i++){if (i == 0)x1[i] = 0;elsex1[i] = x2[i - 1];if (i % 2 == 0)x2[i] = x1[i] + P[i];elsex2[i] = x1[i] - P[i];}int p[n];iota(p, p + n, 0);auto check = [&](){bool ok = true;int ans[n];for (int i = 0; i < n - 1; i++){ans[i] = p[i + 1] - p[i];assert(p[i + 1] != p[i]);if (s[i] == 'U' && ans[i] < 0)ok = false;if (s[i] == 'D' && ans[i] > 0)ok = false;ans[i] = abs(ans[i]);int x = x2[i];int y0 = min(p[i], p[i + 1]);int y1 = max(p[i], p[i + 1]);for (int j = 0; j < n && ok; j++){if (j == i || j == i + 1)continue;int x_1 = min(x1[j], x2[j]);int x_2 = max(x1[j], x2[j]);if (x_1 <= x && x <= x_2 && y0 <= p[j] && p[j] <= y1){ok = false;}}}if (ok){cout << "YES\n";for (int i = 0; i < n - 1; i++)cout << ans[i] << " ";cout << "\n";exit(0);}};if (n <= 8)do{check();} while (next_permutation(p, p + n));// vector<int>A[n];// vector<int>B[n];// for (int i = 0; i < n - 1; i++)// {// if (s[i] == 'U')// A[i].push_back(i + 1);// else// A[i + 1].push_back(i);// }// for (int j = 0; j < n; j++)// {// int x_1 = min(x1[j], x2[j]);// int x_2 = max(x1[j], x2[j]);// for (int i = 0; i < n - 1; i++)// {// if (j == i || j == i + 1)// continue;// if (x_1 <= x2[i] && x2[i] <= x_2)// {// if (s[i] == 'U')// {// A[j].push_back(i);// A[i + 1].push_back(j);// }// else// {// A[j].push_back(i + 1);// A[i].push_back(j);// }// }// }// }// for (int i = 0; i < n; i++)// for (int j : A[i])// B[j].push_back(i);// bool ok = true;// while (ok)// {// ok = false;// for (int i = 0; i < n; i++)// {// for (int j = 0; j < i; j++)// {// int bal = 0;// for (int k : {i, j})// {// for (int l : A[k])// if (p[l] > p[k])// bal--;// for (int l : B[k])// if (p[l] < p[k])// bal--;// }// swap(i, j);// for (int k : {i, j})// {// for (int l : A[k])// if (p[l] > p[k])// bal++;// for (int l : B[k])// if (p[l] < p[k])// bal++;// }// if (bal <= 0)// {// swap(i, j);// }// else// {// ok = true;// }// }// }// }p[0] = 0;for (char r : {0, 'U'^'D'}) {for (int i = 0; i < n - 1; i++){if ((s[i]^r) == 'U')p[i + 1] = p[i] + r * (n + 1);elsep[i + 1] = p[i] - r;}check();}cout << "NO\n";}
Test details
Test 1
Group: 1, 2, 4, 5
Verdict: ACCEPTED
input |
---|
2 2 10 D |
correct output |
---|
YES 1 |
user output |
---|
YES 1 |
Test 2
Group: 1, 2, 4, 5
Verdict: ACCEPTED
input |
---|
8 5 8 7 5 6 5 3 4 DUUUDDD |
correct output |
---|
YES 1 5 1 1 3 1 1 |
user output |
---|
YES 1 5 1 1 3 1 1 |
Test 3
Group: 1, 2, 4, 5
Verdict: ACCEPTED
input |
---|
8 9 8 8 10 10 8 9 10 DDDUUUD |
correct output |
---|
YES 1 1 1 4 1 1 7 |
user output |
---|
YES 1 1 1 5 1 1 3 |
Test 4
Group: 1, 2, 4, 5
Verdict: RUNTIME ERROR
input |
---|
8 9 10 8 8 9 9 7 8 DDDDUUU |
correct output |
---|
NO |
user output |
---|
(empty) |
Error:
code: input/code.cpp:59: main()::<lambda()>: Assertion `p[i + 1] != p[i]' failed.
Test 5
Group: 1, 2, 4, 5
Verdict: ACCEPTED
input |
---|
8 10 2 8 3 10 2 10 10 DDUUUUD |
correct output |
---|
YES 1 1 3 1 1 1 7 |
user output |
---|
YES 1 1 3 2 1 1 3 |
Test 6
Group: 2, 4, 5
Verdict: RUNTIME ERROR
input |
---|
15 73 74 97 82 19 50 26 51 56 93 ... |
correct output |
---|
YES 1 2 3 1 1 3 1 1 1 10 1 3 1 1 |
user output |
---|
(empty) |
Error:
code: input/code.cpp:59: main()::<lambda()>: Assertion `p[i + 1] != p[i]' failed.
Test 7
Group: 2, 4, 5
Verdict: RUNTIME ERROR
input |
---|
15 95 71 97 77 98 76 100 62 96 69... |
correct output |
---|
YES 1 1 3 1 1 1 1 1 9 1 11 1 13 1 |
user output |
---|
(empty) |
Error:
code: input/code.cpp:59: main()::<lambda()>: Assertion `p[i + 1] != p[i]' failed.
Test 8
Group: 2, 4, 5
Verdict: RUNTIME ERROR
input |
---|
15 79 81 84 86 88 90 92 92 91 89 ... |
correct output |
---|
YES 1 2 3 4 5 6 14 1 6 5 4 3 2 1 |
user output |
---|
(empty) |
Error:
code: input/code.cpp:59: main()::<lambda()>: Assertion `p[i + 1] != p[i]' failed.
Test 9
Group: 2, 4, 5
Verdict: RUNTIME ERROR
input |
---|
15 97 90 87 83 79 76 74 23 24 76 ... |
correct output |
---|
YES 13 11 9 7 5 3 1 1 3 5 7 9 11 1... |
user output |
---|
(empty) |
Error:
code: input/code.cpp:59: main()::<lambda()>: Assertion `p[i + 1] != p[i]' failed.
Test 10
Group: 2, 4, 5
Verdict: RUNTIME ERROR
input |
---|
15 100 2 99 1 78 4 93 2 100 1 15 ... |
correct output |
---|
NO |
user output |
---|
(empty) |
Error:
code: input/code.cpp:59: main()::<lambda()>: Assertion `p[i + 1] != p[i]' failed.
Test 11
Group: 4, 5
Verdict: RUNTIME ERROR
input |
---|
1000 999997 999995 999993 999991 99... |
correct output |
---|
YES 997 995 993 991 989 987 985 98... |
user output |
---|
(empty) |
Error:
code: input/code.cpp:59: main()::<lambda()>: Assertion `p[i + 1] != p[i]' failed.
Test 12
Group: 5
Verdict: RUNTIME ERROR
input |
---|
100000 999999998 999999996 999999994 ... |
correct output |
---|
YES 99997 99995 99993 99991 99989 ... |
user output |
---|
(empty) |
Error:
code: input/code.cpp:59: main()::<lambda()>: Assertion `p[i + 1] != p[i]' failed.
Test 13
Group: 3, 4, 5
Verdict: RUNTIME ERROR
input |
---|
1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
YES 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
user output |
---|
(empty) |
Error:
code: input/code.cpp:59: main()::<lambda()>: Assertion `p[i + 1] != p[i]' failed.
Test 14
Group: 3, 4, 5
Verdict: RUNTIME ERROR
input |
---|
1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
NO |
user output |
---|
(empty) |
Error:
code: input/code.cpp:59: main()::<lambda()>: Assertion `p[i + 1] != p[i]' failed.
Test 15
Group: 1, 2, 4, 5
Verdict: ACCEPTED
input |
---|
5 6 7 7 6 6 UDUU |
correct output |
---|
YES 1 4 1 1 |
user output |
---|
YES 1 4 1 1 |
Test 16
Group: 4, 5
Verdict: RUNTIME ERROR
input |
---|
30 15 12 9 88 10 26 78 23 67 14 9... |
correct output |
---|
YES 1 1 1 4 1 3 1 1 7 1 19 1 1 3 1... |
user output |
---|
(empty) |
Error:
code: input/code.cpp:59: main()::<lambda()>: Assertion `p[i + 1] != p[i]' failed.
Test 17
Group: 4, 5
Verdict: RUNTIME ERROR
input |
---|
1000 1000000 1 146324 146324 289287... |
correct output |
---|
YES 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
user output |
---|
(empty) |
Error:
code: input/code.cpp:59: main()::<lambda()>: Assertion `p[i + 1] != p[i]' failed.
Test 18
Group: 5
Verdict: RUNTIME ERROR
input |
---|
100000 1000000000 1 421262579 4212625... |
correct output |
---|
YES 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
user output |
---|
(empty) |
Error:
code: input/code.cpp:59: main()::<lambda()>: Assertion `p[i + 1] != p[i]' failed.
Test 19
Group: 1, 2, 4, 5
Verdict: RUNTIME ERROR
input |
---|
8 1 3 1 2 5 1 1 2 DUUUDUU |
correct output |
---|
NO |
user output |
---|
(empty) |
Error:
code: input/code.cpp:59: main()::<lambda()>: Assertion `p[i + 1] != p[i]' failed.
Test 20
Group: 2, 4, 5
Verdict: RUNTIME ERROR
input |
---|
15 3 1 33 13 1 11 32 8 1 19 15 25... |
correct output |
---|
YES 1 1 5 1 1 3 5 1 1 1 1 5 2 1 |
user output |
---|
(empty) |
Error:
code: input/code.cpp:59: main()::<lambda()>: Assertion `p[i + 1] != p[i]' failed.
Test 21
Group: 2, 4, 5
Verdict: RUNTIME ERROR
input |
---|
15 10 2 39 41 42 34 31 28 26 24 2... |
correct output |
---|
YES 1 1 1 1 10 9 8 7 6 1 4 1 1 1 |
user output |
---|
(empty) |
Error:
code: input/code.cpp:59: main()::<lambda()>: Assertion `p[i + 1] != p[i]' failed.
Test 22
Group: 2, 4, 5
Verdict: RUNTIME ERROR
input |
---|
15 27 4 6 23 26 37 40 38 44 27 3 ... |
correct output |
---|
YES 1 1 1 1 5 1 7 1 3 1 1 3 1 1 |
user output |
---|
(empty) |
Error:
code: input/code.cpp:59: main()::<lambda()>: Assertion `p[i + 1] != p[i]' failed.
Test 23
Group: 4, 5
Verdict: RUNTIME ERROR
input |
---|
1000 3246 3562 197273 197429 197755... |
correct output |
---|
YES 1 1 1 4 5 10 3 1 1 3 7 12 1 1 ... |
user output |
---|
(empty) |
Error:
code: input/code.cpp:59: main()::<lambda()>: Assertion `p[i + 1] != p[i]' failed.
Test 24
Group: 4, 5
Verdict: RUNTIME ERROR
input |
---|
1000 503981 503487 503350 502673 50... |
correct output |
---|
YES 999 1 997 1 1 994 989 1 1 1 1 ... |
user output |
---|
(empty) |
Error:
code: input/code.cpp:59: main()::<lambda()>: Assertion `p[i + 1] != p[i]' failed.
Test 25
Group: 4, 5
Verdict: RUNTIME ERROR
input |
---|
1000 1445 1363 1749 1084 262408 263... |
correct output |
---|
NO |
user output |
---|
(empty) |
Error:
code: input/code.cpp:59: main()::<lambda()>: Assertion `p[i + 1] != p[i]' failed.
Test 26
Group: 5
Verdict: RUNTIME ERROR
input |
---|
100000 209655 9167 9389 191291 198294... |
correct output |
---|
NO |
user output |
---|
(empty) |
Error:
code: input/code.cpp:59: main()::<lambda()>: Assertion `p[i + 1] != p[i]' failed.
Test 27
Group: 5
Verdict: RUNTIME ERROR
input |
---|
100000 16295 14904 5103 13337 26939 3... |
correct output |
---|
YES 1 1 1 1 5 6 1 1 1 10 11 1 13 1... |
user output |
---|
(empty) |
Error:
code: input/code.cpp:59: main()::<lambda()>: Assertion `p[i + 1] != p[i]' failed.
Test 28
Group: 5
Verdict: RUNTIME ERROR
input |
---|
100000 1859 174288 15040 4631 4993844... |
correct output |
---|
YES 1 3 1 1 99997 99992 1 1 5 1 1 ... |
user output |
---|
(empty) |
Error:
code: input/code.cpp:59: main()::<lambda()>: Assertion `p[i + 1] != p[i]' failed.
Test 29
Group: 5
Verdict: RUNTIME ERROR
input |
---|
100000 959817 958289 966165 922369 92... |
correct output |
---|
YES 1 1 1 1 1 1 1 1 1 1 11 14 1 1 ... |
user output |
---|
(empty) |
Error:
code: input/code.cpp:59: main()::<lambda()>: Assertion `p[i + 1] != p[i]' failed.
Test 30
Group: 1, 2, 4, 5
Verdict: ACCEPTED
input |
---|
8 2 3 2 3 5 6 7 8 UDDDUDU |
correct output |
---|
YES 1 2 1 1 5 6 7 |
user output |
---|
YES 3 1 1 2 5 6 7 |