oj.uz

Submission #917556

# Submission time Handle Problem Language Result Execution time Memory
917556 2024-01-28T12:08:04 Z nguyentunglam Scales (IOI15_scales) C++17
72.0238 / 100
 484 ms 756 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);
  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) {
    int best = 1e9;
    int _a, _b, _c, _d, _t;
    for(auto &[a, b, c] : three) for(int type = 1; type <= 3; type++) {
      int worst = 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);
      }
      if (!worst) continue;
      if (best > worst) {
        best = worst;
        _a = a;
        _b = b;
        _c = c;
        _t = type;
      }
    }
    for(auto &[a, b, c, d] : four) {
      int worst = 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);
      }
      if (!worst) continue;
      if (best > worst) {
        best = worst;
        _a = a;
        _b = b;
        _c = c;
        _d = d;
        _t = 0;
      }
    }

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

//    cout << _a << " " << _b << " " << _c << " " << _d << " " << _t << endl;

    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) {
      |           ~~~~^
In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from scales.cpp:2:
scales.cpp: In function 'void orderCoins()':
scales.cpp:93:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |     assert(best < p.size());
      |            ~~~~~^~~~~~~~~~
scales.cpp:100:7: warning: '_t' may be used uninitialized in this function [-Wmaybe-uninitialized]
  100 |       if (_t == 1) result = getLightest(_a, _b, _c);
      |       ^~
scales.cpp:112:38: warning: '_d' may be used uninitialized in this function [-Wmaybe-uninitialized]
  112 |       for(auto &tmp : p) if (ask_four(_a, _b, _c, _d, tmp) == result) {
      |                              ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
scales.cpp:102:40: warning: '_c' may be used uninitialized in this function [-Wmaybe-uninitialized]
  102 |       if (_t == 3) result = getHeaviest(_a, _b, _c);
      |                             ~~~~~~~~~~~^~~~~~~~~~~~
scales.cpp:102:40: warning: '_b' may be used uninitialized in this function [-Wmaybe-uninitialized]
scales.cpp:102:40: 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 448 ms 504 KB Output is partially correct
2 Partially correct 438 ms 348 KB Output is partially correct
3 Partially correct 442 ms 592 KB Output is partially correct
4 Partially correct 456 ms 500 KB Output is partially correct
5 Partially correct 433 ms 548 KB Output is partially correct
6 Partially correct 450 ms 504 KB Output is partially correct
7 Partially correct 450 ms 508 KB Output is partially correct
8 Partially correct 454 ms 596 KB Output is partially correct
9 Partially correct 441 ms 504 KB Output is partially correct
10 Partially correct 435 ms 500 KB Output is partially correct
11 Partially correct 451 ms 596 KB Output is partially correct
12 Partially correct 433 ms 504 KB Output is partially correct
13 Partially correct 448 ms 600 KB Output is partially correct
14 Partially correct 458 ms 344 KB Output is partially correct
15 Partially correct 437 ms 512 KB Output is partially correct
16 Partially correct 440 ms 592 KB Output is partially correct
17 Correct 459 ms 492 KB Output is correct
18 Partially correct 443 ms 500 KB Output is partially correct
19 Partially correct 454 ms 344 KB Output is partially correct
20 Partially correct 442 ms 736 KB Output is partially correct
21 Partially correct 445 ms 516 KB Output is partially correct
22 Partially correct 461 ms 344 KB Output is partially correct
23 Partially correct 443 ms 500 KB Output is partially correct
24 Partially correct 447 ms 512 KB Output is partially correct
25 Partially correct 470 ms 728 KB Output is partially correct
26 Partially correct 446 ms 756 KB Output is partially correct
27 Partially correct 441 ms 344 KB Output is partially correct
28 Partially correct 456 ms 500 KB Output is partially correct
29 Correct 439 ms 508 KB Output is correct
30 Partially correct 484 ms 508 KB Output is partially correct
31 Partially correct 447 ms 500 KB Output is partially correct
32 Partially correct 439 ms 504 KB Output is partially correct
33 Partially correct 446 ms 600 KB Output is partially correct
34 Partially correct 438 ms 344 KB Output is partially correct
35 Partially correct 461 ms 496 KB Output is partially correct
36 Partially correct 455 ms 748 KB Output is partially correct
37 Partially correct 469 ms 500 KB Output is partially correct
38 Partially correct 449 ms 504 KB Output is partially correct
39 Partially correct 442 ms 508 KB Output is partially correct
40 Partially correct 468 ms 504 KB Output is partially correct