답안 #849242

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
849242 2023-09-14T09:53:59 Z vjudge1 Art Collections (BOI22_art) C++17
컴파일 오류
0 ms 0 KB
#include <bits/stdc++.h>
#define all(v) ((v).begin(),(v).end())
#define ll long long
#define F first
#define S second
const ll mod = 1e9 + 7;
const ll mxN = 1e5 + 2;
using namespace std;
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


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 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 answer(std::vector<int>);

void solve(int N) {
    vector<int>order;
    for(int i = 1; i<= N;i++){
      order.push_back(i);
    }
    int x = publish(order);
    while(1) {
      bool cont = 0;
      for(int i = 0; i < N - 1;i++){
        swap(order[i],order[i + 1]);
        int y = publish(order);
        if(y < x){
          cont = 1;
          x = y;
          // break;
        }else{
          swap(order[i],order[i + 1]);
        }
      }
      if(!cont)break;
    }
    answer(order);
}


// 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!");
// }

Compilation message

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) {
      |        ~~~~~~~~~^~~~
/usr/bin/ld: /tmp/ccHmO6dE.o: in function `publish(std::vector<int, std::allocator<int> >)':
interface.cpp:(.text+0x60): multiple definition of `publish(std::vector<int, std::allocator<int> >)'; /tmp/ccOPESgE.o:art.cpp:(.text+0x3b0): first defined here
/usr/bin/ld: /tmp/ccHmO6dE.o: in function `answer(std::vector<int, std::allocator<int> >)':
interface.cpp:(.text+0x170): multiple definition of `answer(std::vector<int, std::allocator<int> >)'; /tmp/ccOPESgE.o:art.cpp:(.text+0x2b0): first defined here
collect2: error: ld returned 1 exit status