oj.uz

Submission #199590

# Submission time Handle Problem Language Result Execution time Memory
199590 2020-02-02T06:07:21 Z SamAnd Drvca (COCI19_drvca) C++17
110 / 110
 56 ms 6512 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;

int n;
int a[N];

void stg(const vector<int>& v1, const vector<int>& v2)
{
    if (v1.empty())
        return;
    if (v2.empty())
        return;
    for (int i = 0; i < v1.size() - 1; ++i)
    {
        if (v1[i + 1] - v1[i] != v1[1] - v1[0])
            return;
    }
    for (int i = 0; i < v2.size() - 1; ++i)
    {
        if (v2[i + 1] - v2[i] != v2[1] - v2[0])
            return;
    }
    printf("%d\n", v1.size());
    for (int i = 0; i < v1.size(); ++i)
        printf("%d ", v1[i]);
    printf("\n");
    printf("%d\n", v2.size());
    for (int i = 0; i < v2.size(); ++i)
        printf("%d ", v2[i]);
    printf("\n");
    exit(0);
}

vector<int> v1, v2;
void rec(int i)
{
    if (i == n + 1)
    {
        stg(v1, v2);
        return;
    }
    if (v1.size() >= 2 && v1[1] - v1[0] == a[i] - v1.back())
    {
        v1.push_back(a[i]);
        rec(i + 1);
        v1.pop_back();
        return;
    }
    if (v2.size() >= 2 && v2[1] - v2[0] == a[i] - v2.back())
    {
        v2.push_back(a[i]);
        rec(i + 1);
        v2.pop_back();
        return;
    }
    if (v1.size() <= 1)
    {
        v1.push_back(a[i]);
        rec(i + 1);
        v1.pop_back();
    }
    if (v2.size() <= 1)
    {
        v2.push_back(a[i]);
        rec(i + 1);
        v2.pop_back();
    }
}

int main()
{
    //freopen("input.txt", "r", stdin);
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i)
        scanf("%d", &a[i]);
    sort(a + 1, a + n + 1);
    rec(1);
    printf("-1\n");
    return 0;
    v1.push_back(a[1]);
    v1.push_back(a[2]);
    for (int i = 3; i <= n; ++i)
    {
        if (a[i] - v1.back() == a[2] - a[1])
            v1.push_back(a[i]);
        else
            v2.push_back(a[i]);
    }
    stg(v1, v2);
    v1.clear();
    v2.clear();
    v1.push_back(a[1]);
    v2.push_back(a[2]);
    if (n == 2)
        stg(v1, v2);
    v1.push_back(a[3]);
    for (int i = 4; i <= n; ++i)
    {
        if (a[i] - v1.back() == a[3] - a[1])
            v1.push_back(a[i]);
        else
            v2.push_back(a[i]);
    }
    stg(v1, v2);
    v1.clear();
    v2.clear();
    v1.push_back(a[1]);
    v2.push_back(a[2]);
    v2.push_back(a[3]);
    for (int i = 4; i <= n; ++i)
    {
        if (a[i] - v2.back() == a[3] - a[2])
            v2.push_back(a[i]);
        else
            v1.push_back(a[i]);
    }
    stg(v1, v2);
    printf("-1\n");
    return 0;
}

Compilation message

drvca.cpp: In function 'void stg(const std::vector<int>&, const std::vector<int>&)':
drvca.cpp:14:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < v1.size() - 1; ++i)
                     ~~^~~~~~~~~~~~~~~
drvca.cpp:19:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < v2.size() - 1; ++i)
                     ~~^~~~~~~~~~~~~~~
drvca.cpp:24:29: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<int>::size_type {aka long unsigned int}' [-Wformat=]
     printf("%d\n", v1.size());
                    ~~~~~~~~~^
drvca.cpp:25:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < v1.size(); ++i)
                     ~~^~~~~~~~~~~
drvca.cpp:28:29: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<int>::size_type {aka long unsigned int}' [-Wformat=]
     printf("%d\n", v2.size());
                    ~~~~~~~~~^
drvca.cpp:29:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < v2.size(); ++i)
                     ~~^~~~~~~~~~~
drvca.cpp: In function 'int main()':
drvca.cpp:74:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
drvca.cpp:76:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a[i]);
         ~~~~~^~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 252 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 364 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 5 ms 256 KB Output is correct
13 Correct 6 ms 376 KB Output is correct
14 Correct 5 ms 256 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 252 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 364 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 5 ms 256 KB Output is correct
13 Correct 6 ms 376 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 6 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 6 ms 408 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 6 ms 376 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 248 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 5492 KB Output is correct
2 Correct 50 ms 5492 KB Output is correct
3 Correct 50 ms 5472 KB Output is correct
4 Correct 47 ms 5364 KB Output is correct
5 Correct 48 ms 5492 KB Output is correct
6 Correct 48 ms 5364 KB Output is correct
7 Correct 48 ms 5492 KB Output is correct
8 Correct 48 ms 5364 KB Output is correct
9 Correct 46 ms 5108 KB Output is correct
10 Correct 51 ms 6384 KB Output is correct
11 Correct 39 ms 6384 KB Output is correct
12 Correct 5 ms 256 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 252 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 364 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 5 ms 256 KB Output is correct
13 Correct 6 ms 376 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 6 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 6 ms 408 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 6 ms 376 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 248 KB Output is correct
31 Correct 48 ms 5492 KB Output is correct
32 Correct 50 ms 5492 KB Output is correct
33 Correct 50 ms 5472 KB Output is correct
34 Correct 47 ms 5364 KB Output is correct
35 Correct 48 ms 5492 KB Output is correct
36 Correct 48 ms 5364 KB Output is correct
37 Correct 48 ms 5492 KB Output is correct
38 Correct 48 ms 5364 KB Output is correct
39 Correct 46 ms 5108 KB Output is correct
40 Correct 51 ms 6384 KB Output is correct
41 Correct 39 ms 6384 KB Output is correct
42 Correct 5 ms 256 KB Output is correct
43 Correct 48 ms 6388 KB Output is correct
44 Correct 41 ms 4084 KB Output is correct
45 Correct 46 ms 5744 KB Output is correct
46 Correct 49 ms 6388 KB Output is correct
47 Correct 40 ms 4596 KB Output is correct
48 Correct 51 ms 5868 KB Output is correct
49 Correct 47 ms 6388 KB Output is correct
50 Correct 36 ms 3064 KB Output is correct
51 Correct 46 ms 6000 KB Output is correct
52 Correct 49 ms 6384 KB Output is correct
53 Correct 41 ms 4212 KB Output is correct
54 Correct 46 ms 5872 KB Output is correct
55 Correct 56 ms 6512 KB Output is correct
56 Correct 38 ms 6384 KB Output is correct
57 Correct 40 ms 6384 KB Output is correct
58 Correct 5 ms 256 KB Output is correct