oj.uz

Submission #747020

# Submission time Handle Problem Language Result Execution time Memory
747020 2023-05-23T12:20:35 Z pls33 Art Collections (BOI22_art) C++17
50 / 100
 752 ms 568 KB 
#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;

#pragma region dalykai
template <typename F>
void _debug(F f)
{
    f();
}

#ifndef _AAAAAAAAA
#define debug(x)
#else
#define debug(x) _debug(x)
#endif
using p32 = pair<int, int>;
using p32u = pair<uint32_t, uint32_t>;
using p64 = pair<int64_t, int64_t>;
using p64u = pair<uint64_t, uint64_t>;
using vi16 = vector<int16_t>;
using vi16u = vector<uint16_t>;
using vi32 = vector<int>;
using vi32u = vector<uint32_t>;
using vi64 = vector<int64_t>;
using vi64u = vector<uint64_t>;
using vp32 = vector<p32>;
using vp32u = vector<p32u>;
using vp64 = vector<p64>;
using vp64u = vector<p64u>;
using vvi32 = vector<vi32>;
using vvi32u = vector<vi32u>;
using vvi64 = vector<vi64>;
using vvi64u = vector<vi64u>;
using vvp32 = vector<vp32>;
using vvp32u = vector<vp32u>;
using vvp64 = vector<vp64>;
using vvp64u = vector<vp64u>;
using f80 = long double;
#pragma endregion

#ifndef _AAAAAAAAA
#include "art.h"
#else
int publish(vector<int> R);
void answer(vector<int> R);
void solve(int N);
#endif

template<class Iter, typename _F>
void merge_sort(Iter first, Iter last, _F f)
{
    if (last - first > 1)
    {
        Iter middle = first + (last - first) / 2;
        merge_sort(first, middle, f);
        merge_sort(middle, last, f);
        std::inplace_merge(first, middle, last, f);
    }
}

void solve(int n) {
    vector<int> order(n);
    iota(order.begin(), order.end(), 1);
    vector<int> start = order;

    int initial = publish(order);

    if(!initial)
    {
        answer(order);
        return;
    }

    auto compare = [&](int a, int b)
    {
        swap(start[a - 1], start[b - 1]);
        int ans = publish(start);
        swap(start[a - 1], start[b - 1]);
        return ans < initial;
    };

    /*make_heap(order.begin(), order.end(), compare);

    auto it = order.end();
    while(it != order.begin())
    {
        pop_heap(order.begin(), it, compare);
        it--;
    }*/

    merge_sort(order.begin(), order.end(), compare);

    answer(order);
}

#ifdef _AAAAAAAAA
void __attribute__((noreturn)) __attribute__((format(printf, 1, 2))) result(const char *msg, ...) {
    va_list args;
    va_start(args, msg);
    vfprintf(stdout, msg, args);
    fprintf(stdout, "\n");
    va_end(args);
    exit(0);
}

namespace {
    int N;
    int Q = 0;
    const int MAX_Q = 4000;
    const int MAX_N = 4000;
    vector<int> solution;
}  // namespace

int publish(vector<int> R) {
    printf("publish({");
    for(int i = 0; i < int(R.size()); ++i) {
        if(i == 0)
            printf("%d", R[i]);
        else
            printf(", %d", R[i]);
    }
    printf("})\n");
    fflush(stdout);

    if (++Q > MAX_Q)
        result("Too many published rankings!");

    if (int(R.size()) != N)
        result("Invalid published ranking!");

    set<int> chosen;
    for(auto &x : R) {
        if(x < 1 || x > N || chosen.count(x))
            result("Invalid published ranking!");
        chosen.insert(x);
    }
    vector<int> positions(N+1);
    for(int i = 0; i < N; ++i)
        positions[R[i]] = i;

    int complaints = 0;
    for(int i = 0; i < N; ++i) {
        for(int j = i+1; j < N; ++j) {
            if(positions[solution[i]] > positions[solution[j]])
                ++complaints;
        }
    }

    return complaints;
}

void __attribute__((noreturn)) answer(vector<int> R) {
    printf("answer({");
    for(int i = 0; i < int(R.size()); ++i) {
        if(i == 0)
            printf("%d", R[i]);
        else
            printf(", %d", R[i]);
    }
    printf("})\n");
    fflush(stdout);


    if(R == solution)
        result("Correct: %d published ranking(s).", Q);
    else
        result("Wrong answer!");
}

int main() {
    freopen("art.in", "r", stdin);
    if (scanf("%d", &N) != 1 || N < 2 || N > MAX_N)
        result("Invalid input!");

    solution.resize(N);
    set<int> chosen;
    for(auto &x : solution) {
        if(scanf("%d", &x) != 1 || x < 1 || x > N || chosen.count(x))
            result("Invalid input!");
        chosen.insert(x);
    }

    solve(N);

    result("No answer!");
}
#endif

Compilation message

art.cpp:8: warning: ignoring '#pragma region dalykai' [-Wunknown-pragmas]
    8 | #pragma region dalykai
      | 
art.cpp:43: warning: ignoring '#pragma endregion ' [-Wunknown-pragmas]
   43 | #pragma endregion
      | 
interface.cpp: In function 'int publish(std::vector<int>)':
interface.cpp:20:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   20 |     if(v.size() != N) {
      |        ~~~~~~~~~^~~~
interface.cpp: In function 'void answer(std::vector<int>)':
interface.cpp:36:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |     if(v.size() != N) {
      |        ~~~~~~~~~^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 0 ms 208 KB Output is correct
20 Correct 2 ms 208 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 0 ms 208 KB Output is correct
20 Correct 2 ms 208 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 2 ms 208 KB Output is correct
24 Correct 2 ms 208 KB Output is correct
25 Correct 2 ms 208 KB Output is correct
26 Correct 0 ms 208 KB Output is correct
27 Correct 29 ms 208 KB Output is correct
28 Correct 49 ms 208 KB Output is correct
29 Correct 45 ms 208 KB Output is correct
30 Correct 55 ms 208 KB Output is correct
31 Correct 49 ms 208 KB Output is correct
32 Correct 1 ms 208 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 1 ms 208 KB Output is correct
35 Correct 0 ms 208 KB Output is correct
36 Correct 0 ms 208 KB Output is correct
37 Correct 0 ms 208 KB Output is correct
38 Correct 0 ms 208 KB Output is correct
39 Correct 2 ms 208 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 0 ms 208 KB Output is correct
20 Correct 2 ms 208 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 2 ms 208 KB Output is correct
24 Correct 2 ms 208 KB Output is correct
25 Correct 2 ms 208 KB Output is correct
26 Correct 0 ms 208 KB Output is correct
27 Correct 29 ms 208 KB Output is correct
28 Correct 49 ms 208 KB Output is correct
29 Correct 45 ms 208 KB Output is correct
30 Correct 55 ms 208 KB Output is correct
31 Correct 49 ms 208 KB Output is correct
32 Correct 1 ms 208 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 1 ms 208 KB Output is correct
35 Correct 0 ms 208 KB Output is correct
36 Correct 0 ms 208 KB Output is correct
37 Correct 0 ms 208 KB Output is correct
38 Correct 0 ms 208 KB Output is correct
39 Correct 2 ms 208 KB Output is correct
40 Correct 1 ms 208 KB Output is correct
41 Correct 3 ms 208 KB Output is correct
42 Correct 4 ms 208 KB Output is correct
43 Correct 3 ms 208 KB Output is correct
44 Correct 2 ms 208 KB Output is correct
45 Correct 0 ms 208 KB Output is correct
46 Correct 29 ms 208 KB Output is correct
47 Correct 47 ms 208 KB Output is correct
48 Correct 54 ms 208 KB Output is correct
49 Correct 53 ms 208 KB Output is correct
50 Correct 41 ms 208 KB Output is correct
51 Correct 1 ms 208 KB Output is correct
52 Correct 1 ms 208 KB Output is correct
53 Correct 91 ms 208 KB Output is correct
54 Correct 176 ms 208 KB Output is correct
55 Correct 162 ms 208 KB Output is correct
56 Correct 147 ms 208 KB Output is correct
57 Correct 183 ms 208 KB Output is correct
58 Correct 1 ms 208 KB Output is correct
59 Correct 1 ms 208 KB Output is correct
60 Correct 1 ms 208 KB Output is correct
61 Correct 1 ms 208 KB Output is correct
62 Correct 1 ms 208 KB Output is correct
63 Correct 1 ms 208 KB Output is correct
64 Correct 2 ms 208 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 0 ms 208 KB Output is correct
20 Correct 2 ms 208 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 2 ms 208 KB Output is correct
24 Correct 2 ms 208 KB Output is correct
25 Correct 2 ms 208 KB Output is correct
26 Correct 0 ms 208 KB Output is correct
27 Correct 29 ms 208 KB Output is correct
28 Correct 49 ms 208 KB Output is correct
29 Correct 45 ms 208 KB Output is correct
30 Correct 55 ms 208 KB Output is correct
31 Correct 49 ms 208 KB Output is correct
32 Correct 1 ms 208 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 1 ms 208 KB Output is correct
35 Correct 0 ms 208 KB Output is correct
36 Correct 0 ms 208 KB Output is correct
37 Correct 0 ms 208 KB Output is correct
38 Correct 0 ms 208 KB Output is correct
39 Correct 2 ms 208 KB Output is correct
40 Correct 1 ms 208 KB Output is correct
41 Correct 3 ms 208 KB Output is correct
42 Correct 4 ms 208 KB Output is correct
43 Correct 3 ms 208 KB Output is correct
44 Correct 2 ms 208 KB Output is correct
45 Correct 0 ms 208 KB Output is correct
46 Correct 29 ms 208 KB Output is correct
47 Correct 47 ms 208 KB Output is correct
48 Correct 54 ms 208 KB Output is correct
49 Correct 53 ms 208 KB Output is correct
50 Correct 41 ms 208 KB Output is correct
51 Correct 1 ms 208 KB Output is correct
52 Correct 1 ms 208 KB Output is correct
53 Correct 91 ms 208 KB Output is correct
54 Correct 176 ms 208 KB Output is correct
55 Correct 162 ms 208 KB Output is correct
56 Correct 147 ms 208 KB Output is correct
57 Correct 183 ms 208 KB Output is correct
58 Correct 1 ms 208 KB Output is correct
59 Correct 1 ms 208 KB Output is correct
60 Correct 1 ms 208 KB Output is correct
61 Correct 1 ms 208 KB Output is correct
62 Correct 1 ms 208 KB Output is correct
63 Correct 1 ms 208 KB Output is correct
64 Correct 2 ms 208 KB Output is correct
65 Correct 1 ms 208 KB Output is correct
66 Correct 2 ms 208 KB Output is correct
67 Correct 2 ms 208 KB Output is correct
68 Correct 2 ms 208 KB Output is correct
69 Correct 3 ms 208 KB Output is correct
70 Correct 0 ms 208 KB Output is correct
71 Correct 34 ms 208 KB Output is correct
72 Correct 53 ms 208 KB Output is correct
73 Correct 51 ms 208 KB Output is correct
74 Correct 50 ms 208 KB Output is correct
75 Correct 57 ms 208 KB Output is correct
76 Correct 0 ms 208 KB Output is correct
77 Correct 1 ms 208 KB Output is correct
78 Correct 92 ms 208 KB Output is correct
79 Correct 162 ms 208 KB Output is correct
80 Correct 160 ms 208 KB Output is correct
81 Correct 149 ms 208 KB Output is correct
82 Correct 168 ms 208 KB Output is correct
83 Correct 1 ms 208 KB Output is correct
84 Incorrect 752 ms 568 KB Not correct
85 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 0 ms 208 KB Output is correct
20 Correct 2 ms 208 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 2 ms 208 KB Output is correct
24 Correct 2 ms 208 KB Output is correct
25 Correct 2 ms 208 KB Output is correct
26 Correct 0 ms 208 KB Output is correct
27 Correct 29 ms 208 KB Output is correct
28 Correct 49 ms 208 KB Output is correct
29 Correct 45 ms 208 KB Output is correct
30 Correct 55 ms 208 KB Output is correct
31 Correct 49 ms 208 KB Output is correct
32 Correct 1 ms 208 KB Output is correct
33 Correct 0 ms 208 KB Output is correct
34 Correct 1 ms 208 KB Output is correct
35 Correct 0 ms 208 KB Output is correct
36 Correct 0 ms 208 KB Output is correct
37 Correct 0 ms 208 KB Output is correct
38 Correct 0 ms 208 KB Output is correct
39 Correct 2 ms 208 KB Output is correct
40 Correct 1 ms 208 KB Output is correct
41 Correct 3 ms 208 KB Output is correct
42 Correct 4 ms 208 KB Output is correct
43 Correct 3 ms 208 KB Output is correct
44 Correct 2 ms 208 KB Output is correct
45 Correct 0 ms 208 KB Output is correct
46 Correct 29 ms 208 KB Output is correct
47 Correct 47 ms 208 KB Output is correct
48 Correct 54 ms 208 KB Output is correct
49 Correct 53 ms 208 KB Output is correct
50 Correct 41 ms 208 KB Output is correct
51 Correct 1 ms 208 KB Output is correct
52 Correct 1 ms 208 KB Output is correct
53 Correct 91 ms 208 KB Output is correct
54 Correct 176 ms 208 KB Output is correct
55 Correct 162 ms 208 KB Output is correct
56 Correct 147 ms 208 KB Output is correct
57 Correct 183 ms 208 KB Output is correct
58 Correct 1 ms 208 KB Output is correct
59 Correct 1 ms 208 KB Output is correct
60 Correct 1 ms 208 KB Output is correct
61 Correct 1 ms 208 KB Output is correct
62 Correct 1 ms 208 KB Output is correct
63 Correct 1 ms 208 KB Output is correct
64 Correct 2 ms 208 KB Output is correct
65 Correct 1 ms 208 KB Output is correct
66 Correct 2 ms 208 KB Output is correct
67 Correct 2 ms 208 KB Output is correct
68 Correct 2 ms 208 KB Output is correct
69 Correct 3 ms 208 KB Output is correct
70 Correct 0 ms 208 KB Output is correct
71 Correct 34 ms 208 KB Output is correct
72 Correct 53 ms 208 KB Output is correct
73 Correct 51 ms 208 KB Output is correct
74 Correct 50 ms 208 KB Output is correct
75 Correct 57 ms 208 KB Output is correct
76 Correct 0 ms 208 KB Output is correct
77 Correct 1 ms 208 KB Output is correct
78 Correct 92 ms 208 KB Output is correct
79 Correct 162 ms 208 KB Output is correct
80 Correct 160 ms 208 KB Output is correct
81 Correct 149 ms 208 KB Output is correct
82 Correct 168 ms 208 KB Output is correct
83 Correct 1 ms 208 KB Output is correct
84 Incorrect 752 ms 568 KB Not correct
85 Halted 0 ms 0 KB -