oj.uz

Submission #747035

# Submission time Handle Problem Language Result Execution time Memory
747035 2023-05-23T12:42:33 Z pls33 Art Collections (BOI22_art) C++17
100 / 100
 1677 ms 63648 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

int query(vector<int> r, map<vector<int>, int> &thing)
{
    auto it = thing.find(r);
    if(it == thing.end())
    {
        int ans = publish(r);
        thing.emplace_hint(it, r, ans);
        return ans;
    }

    return it->second;
}

void solve(int n) {
    map<vector<int>, int> thing;

    vector<int> order(n);

    for(int i = 1; i <= n; i++)
    {
        vector<int> fff(n);
        iota(fff.begin(), fff.end(), 1);

        rotate(fff.begin(), fff.begin() + i - 1, fff.end());
        int count1 = query(fff, thing);
        rotate(fff.begin(), fff.begin() + 1, fff.end());
        int count2 = query(fff, thing);

        order[(count1 - count2 + n - 1) / 2] = i;
    }

    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 244 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 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 244 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 304 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 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 1 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 1 ms 308 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 244 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 304 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 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 1 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 1 ms 308 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 1 ms 300 KB Output is correct
26 Correct 10 ms 456 KB Output is correct
27 Correct 9 ms 524 KB Output is correct
28 Correct 11 ms 456 KB Output is correct
29 Correct 10 ms 428 KB Output is correct
30 Correct 9 ms 460 KB Output is correct
31 Correct 11 ms 464 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 1 ms 208 KB Output is correct
37 Correct 0 ms 208 KB Output is correct
38 Correct 1 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 244 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 304 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 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 1 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 1 ms 308 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 1 ms 300 KB Output is correct
26 Correct 10 ms 456 KB Output is correct
27 Correct 9 ms 524 KB Output is correct
28 Correct 11 ms 456 KB Output is correct
29 Correct 10 ms 428 KB Output is correct
30 Correct 9 ms 460 KB Output is correct
31 Correct 11 ms 464 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 1 ms 208 KB Output is correct
37 Correct 0 ms 208 KB Output is correct
38 Correct 1 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 1 ms 304 KB Output is correct
42 Correct 1 ms 252 KB Output is correct
43 Correct 1 ms 208 KB Output is correct
44 Correct 1 ms 208 KB Output is correct
45 Correct 9 ms 464 KB Output is correct
46 Correct 9 ms 528 KB Output is correct
47 Correct 11 ms 524 KB Output is correct
48 Correct 9 ms 432 KB Output is correct
49 Correct 8 ms 484 KB Output is correct
50 Correct 10 ms 516 KB Output is correct
51 Correct 1 ms 208 KB Output is correct
52 Correct 21 ms 1032 KB Output is correct
53 Correct 21 ms 1032 KB Output is correct
54 Correct 28 ms 1088 KB Output is correct
55 Correct 31 ms 1016 KB Output is correct
56 Correct 25 ms 1088 KB Output is correct
57 Correct 25 ms 1020 KB Output is correct
58 Correct 1 ms 208 KB Output is correct
59 Correct 0 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 1 ms 208 KB Output is correct

Subtask #5
20.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 244 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 304 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 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 1 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 1 ms 308 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 1 ms 300 KB Output is correct
26 Correct 10 ms 456 KB Output is correct
27 Correct 9 ms 524 KB Output is correct
28 Correct 11 ms 456 KB Output is correct
29 Correct 10 ms 428 KB Output is correct
30 Correct 9 ms 460 KB Output is correct
31 Correct 11 ms 464 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 1 ms 208 KB Output is correct
37 Correct 0 ms 208 KB Output is correct
38 Correct 1 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 1 ms 304 KB Output is correct
42 Correct 1 ms 252 KB Output is correct
43 Correct 1 ms 208 KB Output is correct
44 Correct 1 ms 208 KB Output is correct
45 Correct 9 ms 464 KB Output is correct
46 Correct 9 ms 528 KB Output is correct
47 Correct 11 ms 524 KB Output is correct
48 Correct 9 ms 432 KB Output is correct
49 Correct 8 ms 484 KB Output is correct
50 Correct 10 ms 516 KB Output is correct
51 Correct 1 ms 208 KB Output is correct
52 Correct 21 ms 1032 KB Output is correct
53 Correct 21 ms 1032 KB Output is correct
54 Correct 28 ms 1088 KB Output is correct
55 Correct 31 ms 1016 KB Output is correct
56 Correct 25 ms 1088 KB Output is correct
57 Correct 25 ms 1020 KB Output is correct
58 Correct 1 ms 208 KB Output is correct
59 Correct 0 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 1 ms 208 KB Output is correct
65 Correct 1 ms 208 KB Output is correct
66 Correct 1 ms 208 KB Output is correct
67 Correct 1 ms 208 KB Output is correct
68 Correct 1 ms 208 KB Output is correct
69 Correct 1 ms 208 KB Output is correct
70 Correct 9 ms 512 KB Output is correct
71 Correct 8 ms 464 KB Output is correct
72 Correct 10 ms 464 KB Output is correct
73 Correct 9 ms 464 KB Output is correct
74 Correct 9 ms 524 KB Output is correct
75 Correct 10 ms 468 KB Output is correct
76 Correct 0 ms 208 KB Output is correct
77 Correct 24 ms 976 KB Output is correct
78 Correct 24 ms 1092 KB Output is correct
79 Correct 26 ms 1072 KB Output is correct
80 Correct 26 ms 972 KB Output is correct
81 Correct 25 ms 1092 KB Output is correct
82 Correct 23 ms 1096 KB Output is correct
83 Correct 439 ms 16092 KB Output is correct
84 Correct 432 ms 16216 KB Output is correct
85 Correct 477 ms 16152 KB Output is correct
86 Correct 454 ms 16076 KB Output is correct
87 Correct 0 ms 208 KB Output is correct
88 Correct 444 ms 16212 KB Output is correct
89 Correct 437 ms 16204 KB Output is correct
90 Correct 1 ms 208 KB Output is correct
91 Correct 1 ms 208 KB Output is correct
92 Correct 0 ms 288 KB Output is correct
93 Correct 1 ms 208 KB Output is correct
94 Correct 1 ms 208 KB Output is correct
95 Correct 1 ms 208 KB Output is correct

Subtask #6
30.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 244 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 304 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 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 1 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 1 ms 308 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 1 ms 208 KB Output is correct
25 Correct 1 ms 300 KB Output is correct
26 Correct 10 ms 456 KB Output is correct
27 Correct 9 ms 524 KB Output is correct
28 Correct 11 ms 456 KB Output is correct
29 Correct 10 ms 428 KB Output is correct
30 Correct 9 ms 460 KB Output is correct
31 Correct 11 ms 464 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 1 ms 208 KB Output is correct
37 Correct 0 ms 208 KB Output is correct
38 Correct 1 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 1 ms 304 KB Output is correct
42 Correct 1 ms 252 KB Output is correct
43 Correct 1 ms 208 KB Output is correct
44 Correct 1 ms 208 KB Output is correct
45 Correct 9 ms 464 KB Output is correct
46 Correct 9 ms 528 KB Output is correct
47 Correct 11 ms 524 KB Output is correct
48 Correct 9 ms 432 KB Output is correct
49 Correct 8 ms 484 KB Output is correct
50 Correct 10 ms 516 KB Output is correct
51 Correct 1 ms 208 KB Output is correct
52 Correct 21 ms 1032 KB Output is correct
53 Correct 21 ms 1032 KB Output is correct
54 Correct 28 ms 1088 KB Output is correct
55 Correct 31 ms 1016 KB Output is correct
56 Correct 25 ms 1088 KB Output is correct
57 Correct 25 ms 1020 KB Output is correct
58 Correct 1 ms 208 KB Output is correct
59 Correct 0 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 1 ms 208 KB Output is correct
65 Correct 1 ms 208 KB Output is correct
66 Correct 1 ms 208 KB Output is correct
67 Correct 1 ms 208 KB Output is correct
68 Correct 1 ms 208 KB Output is correct
69 Correct 1 ms 208 KB Output is correct
70 Correct 9 ms 512 KB Output is correct
71 Correct 8 ms 464 KB Output is correct
72 Correct 10 ms 464 KB Output is correct
73 Correct 9 ms 464 KB Output is correct
74 Correct 9 ms 524 KB Output is correct
75 Correct 10 ms 468 KB Output is correct
76 Correct 0 ms 208 KB Output is correct
77 Correct 24 ms 976 KB Output is correct
78 Correct 24 ms 1092 KB Output is correct
79 Correct 26 ms 1072 KB Output is correct
80 Correct 26 ms 972 KB Output is correct
81 Correct 25 ms 1092 KB Output is correct
82 Correct 23 ms 1096 KB Output is correct
83 Correct 439 ms 16092 KB Output is correct
84 Correct 432 ms 16216 KB Output is correct
85 Correct 477 ms 16152 KB Output is correct
86 Correct 454 ms 16076 KB Output is correct
87 Correct 0 ms 208 KB Output is correct
88 Correct 444 ms 16212 KB Output is correct
89 Correct 437 ms 16204 KB Output is correct
90 Correct 1 ms 208 KB Output is correct
91 Correct 1 ms 208 KB Output is correct
92 Correct 0 ms 288 KB Output is correct
93 Correct 1 ms 208 KB Output is correct
94 Correct 1 ms 208 KB Output is correct
95 Correct 1 ms 208 KB Output is correct
96 Correct 1 ms 208 KB Output is correct
97 Correct 1 ms 208 KB Output is correct
98 Correct 1 ms 208 KB Output is correct
99 Correct 1 ms 304 KB Output is correct
100 Correct 1 ms 208 KB Output is correct
101 Correct 8 ms 464 KB Output is correct
102 Correct 11 ms 540 KB Output is correct
103 Correct 10 ms 480 KB Output is correct
104 Correct 8 ms 436 KB Output is correct
105 Correct 9 ms 524 KB Output is correct
106 Correct 9 ms 464 KB Output is correct
107 Correct 1 ms 208 KB Output is correct
108 Correct 23 ms 1064 KB Output is correct
109 Correct 29 ms 984 KB Output is correct
110 Correct 26 ms 1048 KB Output is correct
111 Correct 24 ms 968 KB Output is correct
112 Correct 26 ms 1076 KB Output is correct
113 Correct 25 ms 1028 KB Output is correct
114 Correct 432 ms 16356 KB Output is correct
115 Correct 466 ms 16076 KB Output is correct
116 Correct 407 ms 16076 KB Output is correct
117 Correct 434 ms 16068 KB Output is correct
118 Correct 1 ms 208 KB Output is correct
119 Correct 440 ms 16136 KB Output is correct
120 Correct 443 ms 16108 KB Output is correct
121 Correct 1532 ms 63372 KB Output is correct
122 Correct 1600 ms 63300 KB Output is correct
123 Correct 1623 ms 63648 KB Output is correct
124 Correct 1613 ms 63268 KB Output is correct
125 Correct 1677 ms 63436 KB Output is correct
126 Correct 1614 ms 63476 KB Output is correct
127 Correct 0 ms 208 KB Output is correct
128 Correct 0 ms 208 KB Output is correct
129 Correct 0 ms 208 KB Output is correct
130 Correct 0 ms 208 KB Output is correct
131 Correct 1 ms 208 KB Output is correct
132 Correct 1 ms 208 KB Output is correct