Task: | Poistot |
Sender: | zli0122 |
Submission time: | 2025-01-18 16:00:49 +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.00 s | 1, 2, 3 | details |
#3 | ACCEPTED | 0.00 s | 1, 3 | details |
#4 | ACCEPTED | 0.00 s | 1, 3 | details |
#5 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
#6 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
#7 | ACCEPTED | 0.42 s | 3 | details |
#8 | ACCEPTED | 0.04 s | 3 | details |
#9 | TIME LIMIT EXCEEDED | -- | 3 | details |
#10 | TIME LIMIT EXCEEDED | -- | 3 | details |
Compiler report
input/code.cpp: In function 'void solve()': input/code.cpp:22:21: warning: unused variable 'a' [-Wunused-variable] 22 | for (int i = 0, a; i<N; i++) { | ^
Code
#include <bits/stdc++.h> using namespace std; #define int long typedef vector<int> vi; typedef pair<int, int> pi; #define fi first #define se second #define pb push_back #define MOD 1000000007 #define INF INT32_MAX/2-1 void solve() { int N; cin >> N; int arr[N]; bool taken[N] = {}; for (int i = 0, a; i<N; i++) { cin >> arr[i]; } stringstream ss; int ans = 0; int prev_r=-1; int prev_val; while (1) { int r = 0; bool done = true; for (int i=prev_r+1; i<N; i++) { if (!taken[i]) { r=i; done=false; break; } } if (done) { break; } ans++; prev_r=r; prev_val=0; ss << "\n"; for (int i=r; i<N; i++) { if (taken[i]) continue; if (arr[i] > prev_val) { ss << arr[i] << " "; prev_val=arr[i]; taken[i] = true; } } } cout << ans; cout << ss.str() << endl; } signed main() { cin.tie(0) -> ios::sync_with_stdio(0); solve(); }
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) |