oj.uz

Submission #1068926

# Submission time Handle Problem Language Result Execution time Memory
1068926 2024-08-21T13:20:33 Z mindiyak Drvca (COCI19_drvca) C++14
0 / 110
 1000 ms 8016 KB 
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
#include <stack>
#include <queue>
#include <set>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<pi>> vvpi;
typedef vector<ld> vd;
typedef vector<long long> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (ll i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int M = 1e9+7;
void init(string name)
{
    freopen((name + ".in").c_str(), "r", stdin);
    freopen((name + ".out").c_str(), "w", stdout);
}
void fastIO()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
}


void solve()
{
    int n;cin >> n;
    vi arr(n);
    
    FOR(i,0,n)cin >> arr[i];
    sort(arr.begin(),arr.end());

    FOR(i,1,n){
        int d = arr[i] - arr[0];
        int cnt = 2;
        multiset<int> arr2;
        FOR(j,1,n)if(i!=j)arr2.insert(arr[j]);
        vi arr3 = {arr[0],arr[i]};

        // cerr << arr[0] << " " << arr[i] << " " << d << endl; 

        while(arr2.count(arr[0]+(d*cnt))){
            arr3.pb(arr[0]+d*cnt);
            arr2.erase(arr2.find(arr[0]+d*cnt));
            cnt ++;
        }

        // cerr << "arr3 -> ";
        // for(int a:arr3)cerr << a << " ";
        // cerr << endl;

        vi arr4;
        for(int a:arr2)arr4.pb(a);

        if(arr3.size() == n){
            arr4.pb(arr3[0]);
            arr3.erase(arr3.begin());
        }else{
            // cerr << "arr4 -> ";
            // for(int a:arr4)cerr << a << " ";
            // cerr << endl;

            d = arr4[1] - arr4[0];
            cnt = 2;
            while(cnt < n && (arr4[cnt] - arr4[cnt-1]) == d){
                cnt ++;
            }

            // cerr << cnt << " " << arr4.size() << endl;
            // cerr << endl;

            if(cnt != arr4.size())continue;
        }

        if(arr3.size() + arr4.size() == n){
            cout << arr3.size() << endl;
            for(int a:arr3)cout << a << " ";
            cout << endl;
            cout << arr4.size() << endl;
            for(int a:arr4)cout << a << " ";
            cout << endl;
            return;
        }
    }

    cout << -1 << endl;
}   
 
 
int main()
{
    fastIO();
    // init("test");
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}

Compilation message

drvca.cpp: In function 'void solve()':
drvca.cpp:85:24: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   85 |         if(arr3.size() == n){
      |            ~~~~~~~~~~~~^~~~
drvca.cpp:102:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |             if(cnt != arr4.size())continue;
      |                ~~~~^~~~~~~~~~~~~~
drvca.cpp:105:38: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  105 |         if(arr3.size() + arr4.size() == n){
      |            ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
drvca.cpp: In function 'void init(std::string)':
drvca.cpp:45:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |     freopen((name + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
drvca.cpp:46:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 |     freopen((name + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Incorrect 1 ms 348 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 600 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Incorrect 1 ms 348 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 7928 KB Output is correct
2 Correct 36 ms 7448 KB Output is correct
3 Correct 40 ms 8016 KB Output is correct
4 Correct 39 ms 7508 KB Output is correct
5 Correct 39 ms 7884 KB Output is correct
6 Correct 33 ms 7504 KB Output is correct
7 Correct 42 ms 8016 KB Output is correct
8 Correct 40 ms 7504 KB Output is correct
9 Execution timed out 1076 ms 7116 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

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