# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
685242 | Farhan_HY | Drvca (COCI19_drvca) | C++14 | 33 ms | 3232 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define int long long
#define F first
#define S second
#define T int t; cin >> t; while(t--)
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
const int N = 1e5 + 5;
const int M = 1e3 + 3;
const int inf = 1e18;
const int mod = 1e9 + 7;
int n, a[N];
vector<int> v1, v2;
bool ok(int i, int j) {
v1.clear();
v2.clear();
int d = a[j] - a[i];
v1.push_back(a[i]);
v1.push_back(a[j]);
for(int k = 1; k <= j; k++)
if (k != i && k != j) v2.push_back(a[k]);
for(int k = j + 1; k <= n; k++) {
if (a[k] - v1.back() == d) v1.push_back(a[k]);
else v2.push_back(a[k]);
}
bool q = 1;
for(int k = 1; k < v2.size(); k++)
q &= (v2[k] - v2[k - 1] == v2[1] - v2[0]);
return q;
}
main() {
IOS
cin >> n;
for(int i = 1; i <= n; i++) cin >> a[i];
sort(a, a + n + 1);
bool ans = 0;
for(int i = 1; i <= 2; i++) {
for(int j = i + 1; j <= 3; j++) {
ans |= ok(i, j);
if (ans) break;
}
if (ans) break;
}
if (!ans) {
cout << -1;
return 0;
}
cout << v1.size() << '\n';
for(auto x: v1) cout << x << ' ';
cout << '\n';
cout << v2.size() << '\n';
for(auto x: v2) cout << x << ' ';
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |