Submission #579635

#	Time	Username	Problem	Language	Result	Execution time	Memory
579635		Josia	Art Collections (BOI22_art)	C++17	0 / 100	1 ms	208 KiB

art

#include <bits/stdc++.h>
#include <art.h>

using namespace std;


int nPublic;


map<pair<int, int>, bool> dict;


bool compare(int a, int b) {
    if (dict.count({a, b})) return dict[{a, b}];

    vector<int> ask;

    for (int i = 0; i<nPublic; i++) {
        if (i+1 == a || i+1 == b) continue;
        ask.push_back(i+1);
    }

    ask.push_back(a);
    ask.push_back(b);
    int AB = publish(ask);
    ask.pop_back();
    ask.pop_back();
    ask.push_back(b);
    ask.push_back(a);
    int BA = publish(ask);

    dict[{a, b}] = AB < BA;
    dict[{a, b}] = BA < AB;

    return AB < BA;
}



void solve(int n) {
    nPublic = n;
    vector<int> a;
    for (int i=0; i<n; i++) a.push_back(i+1);

    sort(a.begin(), a.end(), compare);

    answer(a);
}



// signed main() {
//     cin.tie(0);
//     ios_base::sync_with_stdio(0);

//     int n; cin >> n;

//     deque<int> a(n);

//     for (int i = 0; i<n; i++) cin >> a[i];

//     for (int i = 0; i<n; i++) {
//         int cnt = 0;
//         for (int i = 0; i<n; i++) {
//             for (int j = i+1; j<n; j++) {
//                 if (a[i]>a[j]) cnt++;
//             }
//         }
//         a.push_back(a[0]);
//         a.pop_front();
//         cout << cnt << "\n";
//     }

//     return 0;
// }

Compilation message (stderr)

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: 0 / 5
• Subtask 2: 0 / 15
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30