Task: | Poistot |
Sender: | a256 |
Submission time: | 2025-01-18 15:06:34 +0200 |
Language: | C++ (C++11) |
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.00 s | 1, 3 | details |
#5 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
#6 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
#7 | ACCEPTED | 0.17 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 'int main()': input/code.cpp:16:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 16 | for(int j=0;j<R.size();++j){ | ~^~~~~~~~~
Code
#include <bits/stdc++.h> #define F first #define S second using namespace std; #define N 212345 int n,k,t[N]; vector<vector<int>> R; int main(){ cin.tie(0)->sync_with_stdio(0); cin>>n; for(int i=0;i<n;++i) cin>>t[i]; R.push_back({0}); for(int i=1;i<n;++i){ int b=0; for(int j=0;j<R.size();++j){ if(t[i]>t[R[j].back()]){ R[j].push_back(i); b=1; break; } } if(!b) R.push_back({i}); } //for(int i=0;i<n;++i) cout<<t[i]<<' '; cout<<R.size()<<'\n'; for(auto r:R){ for(auto i:r) cout<<t[i]<<' '; cout<<'\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) |