oj.uz

Submission #917608

# Submission time Handle Problem Language Result Execution time Memory
917608 2024-01-28T13:16:22 Z nguyentunglam Scales (IOI15_scales) C++17
72.0238 / 100
 492 ms 600 KB 
#include "scales.h"
#include<bits/stdc++.h>
using namespace std;

mt19937 rng(1);

int n = 6;

int order[10];

vector<tuple<int, int, int> > three;
vector<tuple<int, int, int, int> > four;

void init(int T) {
  for(int a = 1; a <= n; a++) for(int b = a + 1; b <= n; b++) for(int c = b + 1; c <= n; c++) {
    three.emplace_back(a, b, c);
  }
  for(int d = 1; d <= n; d++) for(int a = 1; a <= n; a++) for(int b = a + 1; b <= n; b++) for(int c = b + 1; c <= n; c++) {
    if (d != a && d != b && d != c) {
      four.emplace_back(a, b, c, d);
    }
  }
}

int ask_three(int a, int b, int c, int type, vector<int> tmp) {
  order[1] = a; order[2] = b; order[3] = c;
  sort(order + 1, order + 4, [&] (const int &x, const int &y) {
       return tmp[x] < tmp[y];
       });
  return order[type];
}

int ask_four(int a, int b, int c, int d, vector<int> tmp) {
  int ret = 0;
  tmp[0] = 1e9;
  if (tmp[a] > tmp[d] && tmp[a] < tmp[ret]) ret = a;
  if (tmp[b] > tmp[d] && tmp[b] < tmp[ret]) ret = b;
  if (tmp[c] > tmp[d] && tmp[c] < tmp[ret]) ret = c;
  if (ret == 0) return ask_three(a, b, c, 1, tmp);
  return ret;
}

void orderCoins() {
//  shuffle(three.begin(), three.end(), rng);
//  shuffle(four.begin(), four.end(), rng);
  vector<vector<int> > p;

  for(int i = 1; i <= n; i++) order[i] = i;

  do {
    vector<int> tmp(n + 1);
    for(int i = 1; i <= n; i++) tmp[i] = order[i];
    p.push_back(tmp);
  } while (next_permutation(order + 1, order + n + 1));

  while (p.size() > 1) {
    pair<int, int> best = make_pair(1e9, 1e9);
    int _a, _b, _c, _d, _t;

    for(auto &[a, b, c, d] : four) {
      int worst = 0, sum = 0;
      for(int result = 1; result <= n; result++) {
        int sat = 0;
        for(auto &tmp : p) sat += result == ask_four(a, b, c, d, tmp);
        if (sat) {
          worst = max(worst, sat);
          sum += sat;
        }
      }
      if (!worst) continue;
      if (best > make_pair(worst, sum)) {
        best = make_pair(worst, sum);
        _a = a;
        _b = b;
        _c = c;
        _d = d;
        _t = 0;
      }
    }

    for(auto &[a, b, c] : three) for(int type = 3; type >= 1; type--) {
      int worst = 0, sum = 0;
      for(int result = 1; result <= n; result++) {
        int sat = 0;
        for(auto &tmp : p) sat += result == ask_three(a, b, c, type, tmp);
        if (sat) {
          worst = max(worst, sat);
          sum += sat;
        }
      }
      if (!worst) continue;
      if (best > make_pair(worst, sum)) {
        best = make_pair(worst, sum);
        _a = a;
        _b = b;
        _c = c;
        _t = type;
      }
    }

//    if (best == p.size()) break;

    #ifdef ngu
    cout << _a << " " << _b << " " << _c << " " << _d << " " << _t << endl;
    #endif // ngu

    int result = 0;
    vector<vector<int> > _p;
    if (_t) {
      if (_t == 1) result = getLightest(_a, _b, _c);
      if (_t == 2) result = getMedian(_a, _b, _c);
      if (_t == 3) result = getHeaviest(_a, _b, _c);
      for(auto &tmp : p) if (ask_three(_a, _b, _c, _t, tmp) == result) {
        _p.push_back(tmp);
      }
      assert(_p.size() < p.size());
      p = _p;
    }

    else {
      result = getNextLightest(_a, _b, _c, _d);
      for(auto &tmp : p) if (ask_four(_a, _b, _c, _d, tmp) == result) {
        _p.push_back(tmp);
      }
      assert(_p.size() < p.size());
      p = _p;
    }
  }

  vector<int> tmp = p.back();
  int hidden[n];
  for(int i = 1; i <= n; i++) hidden[tmp[i] - 1] = i;
  #ifdef ngu
  for(int i = 0; i < n; i++) cerr << hidden[i] << " ";
  #endif // ngu

  answer(hidden);
}

Compilation message

scales.cpp: In function 'void init(int)':
scales.cpp:14:15: warning: unused parameter 'T' [-Wunused-parameter]
   14 | void init(int T) {
      |           ~~~~^
scales.cpp: In function 'void orderCoins()':
scales.cpp:110:7: warning: '_t' may be used uninitialized in this function [-Wmaybe-uninitialized]
  110 |       if (_t == 1) result = getLightest(_a, _b, _c);
      |       ^~
scales.cpp:121:31: warning: '_d' may be used uninitialized in this function [-Wmaybe-uninitialized]
  121 |       result = getNextLightest(_a, _b, _c, _d);
      |                ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
scales.cpp:121:31: warning: '_c' may be used uninitialized in this function [-Wmaybe-uninitialized]
scales.cpp:121:31: warning: '_b' may be used uninitialized in this function [-Wmaybe-uninitialized]
scales.cpp:121:31: warning: '_a' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
72.02381 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 459 ms 348 KB Output is partially correct
2 Partially correct 492 ms 348 KB Output is partially correct
3 Partially correct 450 ms 504 KB Output is partially correct
4 Partially correct 458 ms 504 KB Output is partially correct
5 Partially correct 472 ms 600 KB Output is partially correct
6 Correct 446 ms 344 KB Output is correct
7 Partially correct 476 ms 508 KB Output is partially correct
8 Partially correct 470 ms 344 KB Output is partially correct
9 Partially correct 468 ms 504 KB Output is partially correct
10 Partially correct 450 ms 508 KB Output is partially correct
11 Partially correct 466 ms 500 KB Output is partially correct
12 Partially correct 419 ms 596 KB Output is partially correct
13 Partially correct 445 ms 512 KB Output is partially correct
14 Correct 442 ms 348 KB Output is correct
15 Partially correct 452 ms 592 KB Output is partially correct
16 Partially correct 464 ms 500 KB Output is partially correct
17 Partially correct 453 ms 592 KB Output is partially correct
18 Partially correct 446 ms 504 KB Output is partially correct
19 Partially correct 387 ms 348 KB Output is partially correct
20 Partially correct 449 ms 504 KB Output is partially correct
21 Partially correct 440 ms 344 KB Output is partially correct
22 Partially correct 470 ms 596 KB Output is partially correct
23 Partially correct 441 ms 344 KB Output is partially correct
24 Partially correct 448 ms 508 KB Output is partially correct
25 Partially correct 447 ms 504 KB Output is partially correct
26 Partially correct 442 ms 508 KB Output is partially correct
27 Partially correct 448 ms 504 KB Output is partially correct
28 Partially correct 448 ms 592 KB Output is partially correct
29 Partially correct 440 ms 344 KB Output is partially correct
30 Partially correct 447 ms 592 KB Output is partially correct
31 Partially correct 460 ms 516 KB Output is partially correct
32 Partially correct 451 ms 508 KB Output is partially correct
33 Partially correct 481 ms 596 KB Output is partially correct
34 Partially correct 441 ms 344 KB Output is partially correct
35 Partially correct 448 ms 348 KB Output is partially correct
36 Partially correct 443 ms 348 KB Output is partially correct
37 Partially correct 447 ms 504 KB Output is partially correct
38 Partially correct 446 ms 348 KB Output is partially correct
39 Partially correct 451 ms 344 KB Output is partially correct
40 Partially correct 449 ms 504 KB Output is partially correct