Task: | Poistot |
Sender: | PMak |
Submission time: | 2025-01-18 13:46:43 +0200 |
Language: | C++ (C++17) |
Status: | READY |
Result: | 11 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 11 |
#2 | TIME LIMIT EXCEEDED | 0 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.00 s | 1, 3 | details |
#2 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#3 | ACCEPTED | 0.00 s | 1, 3 | details |
#4 | ACCEPTED | 0.01 s | 1, 3 | details |
#5 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
#6 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
#7 | ACCEPTED | 0.20 s | 3 | details |
#8 | ACCEPTED | 0.08 s | 3 | details |
#9 | TIME LIMIT EXCEEDED | -- | 3 | details |
#10 | TIME LIMIT EXCEEDED | -- | 3 | details |
Compiler report
input/code.cpp: In function 'int main()': input/code.cpp:7:15: warning: unused variable 'j' [-Wunused-variable] 7 | int n, i, j, k; | ^ input/code.cpp:7:18: warning: unused variable 'k' [-Wunused-variable] 7 | int n, i, j, k; | ^
Code
#include<bits/stdc++.h> #define F0R(i, n) for (i = 0; i < n; ++i) #define FOR(i, l, r) for (i = l; i < r; ++i) using namespace std; int main() { int n, i, j, k; cin >> n; vector<int> x(n, 0); vector<string> rounds; F0R (i, n) { cin >> x[i]; } int curr; string s; bool flag = true; while (flag) { flag = false; s = ""; curr = 0; F0R (i, n) { if (x[i] != 0) { curr = x[i]; s += to_string(x[i]) + " "; x[i] = 0; flag = true; break; } } if (!flag) break; bool flag2 = true; while (flag2) { flag2 = false; FOR (i, i+1, n) { if (x[i] > curr) { curr = x[i]; s += to_string(x[i]) + " "; x[i] = 0; flag2 = true; break; } } } rounds.push_back(s); } n = rounds.size(); cout << n << "\n"; F0R (i, n) { cout << rounds[i] << "\n"; } }
Test details
Test 1
Group: 1, 3
Verdict: ACCEPTED
input |
---|
1000 447773962 773442532 122816 137... |
correct output |
---|
53 447773962 773442532 908719430 ... |
user output |
---|
53 447773962 773442532 908719430 ... Truncated |
Test 2
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
1000 1 1 1 1 ... |
user output |
---|
1000 1 1 1 1 ... Truncated |
Test 3
Group: 1, 3
Verdict: ACCEPTED
input |
---|
1000 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
correct output |
---|
1 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
1 1 2 3 4 5 6 7 8 9 10 11 12 13 ... Truncated |
Test 4
Group: 1, 3
Verdict: ACCEPTED
input |
---|
1000 1000 999 998 997 996 995 994 9... |
correct output |
---|
1000 1000 999 998 997 ... |
user output |
---|
1000 1000 999 998 997 ... Truncated |
Test 5
Group: 2, 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 1 1 1 1 ... |
user output |
---|
(empty) |
Test 6
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
200000 5 2 1 10 6 10 5 5 5 4 4 2 3 7 ... |
correct output |
---|
20776 5 10 2 6 10 1 5 7 9 10 5 7 8 9 10 ... |
user output |
---|
(empty) |
Test 7
Group: 3
Verdict: ACCEPTED
input |
---|
200000 591414747 75940263 760367935 9... |
correct output |
---|
879 591414747 760367935 901888417 ... |
user output |
---|
879 591414747 760367935 901888417 ... Truncated |
Test 8
Group: 3
Verdict: ACCEPTED
input |
---|
200000 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
correct output |
---|
1 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
1 1 2 3 4 5 6 7 8 9 10 11 12 13 ... Truncated |
Test 9
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
200000 200000 199999 199998 199997 19... |
correct output |
---|
200000 200000 199999 199998 199997 ... |
user output |
---|
(empty) |
Test 10
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
200000 199999 199997 199995 199993 19... |
correct output |
---|
100000 199999 200000 199997 199998 199995 199996 199993 199994 ... |
user output |
---|
(empty) |