#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define debug(x) cerr << '[' << (#x) << "] = " << x << '\n';
template<class T> using ordered_set = tree<T, null_type , less<T> , rb_tree_tag , tree_order_statistics_node_update> ;
void PlayGround() {
int N; cin >> N;
vector<int>a(N);
for(int i=0; i<N; ++i) cin >> a[i];
sort(a.begin(), a.end());
if(N < 4) {
cout << 1 << '\n' << a[0] << '\n' << N-1 << '\n';
for(int i=1; i<N; ++i) cout << a[i] << ' ';
cout << '\n';
return;
}
auto print = [] (vector<int>&x, vector<int>&y) {
cout << x.size() << '\n';
for(auto it : x) cout << it << ' ';
cout << '\n';
cout << y.size() << '\n';
for(auto it : y) cout << it << ' ';
cout << "\n";
};
auto check = [] (multiset<int>& ms) {
if(ms.size()<3) return true;
int dif = *(next(ms.begin(), 1)) - *ms.begin();
int last = *ms.begin() - dif;
bool ret = true;
for(auto it : ms) {
ret &= it==last+dif;
last = it;
}
return ret;
};
vector<int>b = {0, 1, 2};
do {
vector<int>x = {a[b[0]], a[b[1]]};
if(x[0]>x[1]) swap(x[0], x[1]);
int dif = x[1] - x[0];
multiset<int>ms;
ms.insert(a[b[2]]);
for(int i=3; i<N; ++i) {
if(a[i]-x.back()==dif) x.push_back(a[i]);
else ms.insert(a[i]);
}
if(ms.empty()) {
vector<int>y = {x.back()};
x.pop_back();
print(x, y);
return;
}
for(int i=x.size(); i>0; --i) {
if(i<x.size()) ms.insert(x[i]);
if(check(ms)) {
vector<int>y;
for(auto it : ms) y.push_back(it);
x.resize(i);
print(x, y);
return;
}
}
// if(check(ms)) {
// vector<int>y;
// for(auto it : ms) y.push_back(it);
// print(x, y);
// return;
// }
} while(next_permutation(b.begin(), b.end()));
vector<int>x = {a[0], a[1], a[2]}, y;
if(x[2]-x[1]!=x[1]-x[0]) {
cout << -1 << '\n';
return;
}
multiset<int>ms;
map<int,int>mp;
for(int i=3; i<N; ++i) {
if(a[i]-x.back()==x[1]-x[0]) x.push_back(a[i]);
else ms.insert(a[i]);
}
if(ms.empty()) {
vector<int>y = {x.back()};
x.pop_back();
print(x, y);
return;
}
if(ms.size()>1) {
auto it = ms.begin();
auto it2 = it;
++it2;
while(it2!=ms.end()) {
mp[*it2-*it]++;
}
}
for(int i=x.size(); i>0; --i) {
if(i<x.size()) {
ms.insert(x[i]);
auto it = ms.find(x[i]);
if(it!=ms.begin() && next(it, 1)!=ms.end()) {
int gap = mp[*next(it, 1) - *prev(it, 1)];
mp[gap]--;
if(mp[gap]==0)
mp.erase(gap);
mp[*it - *prev(it, 1)]++;
mp[*next(it, 1) - *it]++;
} else if(it!=ms.begin()) {
mp[*it-*prev(it, 1)]++;
} else if(next(it, 1)!=ms.end()) {
mp[*next(it, 1)-*it]++;
}
}
if(mp.size()<2) {
vector<int>y;
for(auto it : ms) y.push_back(it);
x.resize(i);
print(x, y);
return;
}
}
// if(check(ms)) {
// vector<int>y;
// for(auto it : ms) y.push_back(it);
// print(x, y);
// return;
// }
cout << -1 << '\n';
#ifndef ONLINE_JUDGE
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// #endif
PlayGround();
return 0;
}
Compilation message
drvca.cpp: In function 'void PlayGround()':
drvca.cpp:64:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
64 | if(i<x.size()) ms.insert(x[i]);
| ~^~~~~~~~~
drvca.cpp:107:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
107 | if(i<x.size()) {
| ~^~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1087 ms |
204 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1087 ms |
204 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1098 ms |
5712 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1087 ms |
204 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
