oj.uz

Submission #685234

# Submission time Handle Problem Language Result Execution time Memory
685234 2023-01-23T17:47:11 Z Farhan_HY Drvca (COCI19_drvca) C++14
0 / 110
 30 ms 4144 KB 
#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];
bool vis[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]);
    }
    if (v2.size() == 0) {
        v2.push_back(v1.back());
        v1.pop_back();
    }
    bool q = 1;
    if (v2.size() == 1) return 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);
    if (ok(1, 2)) {}
    else if (ok(1, 3)) {}
    else if (ok(2, 3)) {}
    else {
        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

drvca.cpp: In function 'bool ok(long long int, long long int)':
drvca.cpp:35:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |     for(int k = 1; k < v2.size(); k++)
      |                    ~~^~~~~~~~~~~
drvca.cpp: At global scope:
drvca.cpp:40:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   40 | main() {
      | ^~~~

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Incorrect 0 ms 212 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Incorrect 0 ms 212 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 4032 KB Output is correct
2 Correct 25 ms 3940 KB Output is correct
3 Correct 29 ms 4144 KB Output is correct
4 Correct 27 ms 3996 KB Output is correct
5 Correct 25 ms 3988 KB Output is correct
6 Correct 30 ms 3908 KB Output is correct
7 Correct 26 ms 3980 KB Output is correct
8 Correct 25 ms 3960 KB Output is correct
9 Incorrect 17 ms 3332 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Incorrect 0 ms 212 KB Output isn't correct
10 Halted 0 ms 0 KB -