Submission #704006

#	Time	Username	Problem	Language	Result	Execution time	Memory
704006		shmad	Art Collections (BOI22_art)	C++17	50 / 100	820 ms	568 KiB

art

#include <bits/stdc++.h>
#define pb push_back
#define vt vector
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()

#ifndef ONLINE_JUDGE
	#include "art.h"
#endif

using namespace std;

#ifdef ONLINE_JUDGE
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!");
}
#endif

int n, all;

bool cmp (int i, int j) {
	vt<int> v(n);
	iota(all(v), 1);
	i--, j--;
	swap(v[i], v[j]);
	int res = publish(v);
	return (res > all);	
}

vt<int> merge_sort (vt<int> p) {
	if (sz(p) == 1) return p;
	vt<int> L, R;
	for (int i = 0; i < sz(p); i++) (i < sz(p) / 2 ? L : R).pb(p[i]);
	L = merge_sort(L), R = merge_sort(R);
	p.clear();
	int i = 0, j = 0;
	while (i < sz(L) && j < sz(R)) {
		if (cmp(L[i], R[j])) p.pb(L[i]), i++;
		else p.pb(R[j]), j++;
	}
	while (i < sz(L)) p.pb(L[i]), i++;
	while (j < sz(R)) p.pb(R[j]), j++;
	return p;
}

void solve (int m) {
	n = m;
	vt<int> p(n);
	iota(all(p), 1);
	all = publish(p);
	p = merge_sort(p);
	answer(p);
}

#ifdef ONLINE_JUDGE

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