oj.uz

Submission #917613

# Submission time Handle Problem Language Result Execution time Memory
917613 2024-01-28T13:19:35 Z nguyentunglam Scales (IOI15_scales) C++17
77.6786 / 100
 424 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);
//  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 worst1 = 0, worst2 = 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) {
          worst2 = max(worst2, sat);
          if (worst1 < worst2) swap(worst1, worst2);
        }
      }
      if (!worst1) continue;
      if (best > make_pair(worst1, worst2)) {
        best = make_pair(worst1, worst2);
        _a = a;
        _b = b;
        _c = c;
        _d = d;
        _t = 0;
      }
    }

    for(auto &[a, b, c] : three) for(int type = 3; type >= 1; type--) {
      int worst1 = 0, worst2 = 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) {
          worst2 = max(worst2, sat);
          if (worst1 < worst2) swap(worst1, worst2);
        }
      }
      if (!worst1) continue;
      if (best > make_pair(worst1, worst2)) {
        best = make_pair(worst1, worst2);
        _a = a;
        _b = b;
        _c = c;
        _t = type;
      }
    }

    #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:108:7: warning: '_t' may be used uninitialized in this function [-Wmaybe-uninitialized]
  108 |       if (_t == 1) result = getLightest(_a, _b, _c);
      |       ^~
scales.cpp:119:31: warning: '_d' may be used uninitialized in this function [-Wmaybe-uninitialized]
  119 |       result = getNextLightest(_a, _b, _c, _d);
      |                ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
scales.cpp:119:31: warning: '_c' may be used uninitialized in this function [-Wmaybe-uninitialized]
scales.cpp:119:31: warning: '_b' may be used uninitialized in this function [-Wmaybe-uninitialized]
scales.cpp:119:31: warning: '_a' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
77.678571 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 391 ms 500 KB Output is correct
2 Correct 419 ms 348 KB Output is correct
3 Correct 399 ms 344 KB Output is correct
4 Partially correct 393 ms 496 KB Output is partially correct
5 Correct 413 ms 500 KB Output is correct
6 Correct 405 ms 348 KB Output is correct
7 Partially correct 406 ms 512 KB Output is partially correct
8 Partially correct 398 ms 504 KB Output is partially correct
9 Partially correct 408 ms 744 KB Output is partially correct
10 Partially correct 416 ms 348 KB Output is partially correct
11 Partially correct 399 ms 344 KB Output is partially correct
12 Correct 417 ms 484 KB Output is correct
13 Partially correct 395 ms 508 KB Output is partially correct
14 Correct 401 ms 596 KB Output is correct
15 Correct 398 ms 508 KB Output is correct
16 Partially correct 401 ms 508 KB Output is partially correct
17 Partially correct 412 ms 348 KB Output is partially correct
18 Partially correct 424 ms 500 KB Output is partially correct
19 Correct 395 ms 500 KB Output is correct
20 Partially correct 403 ms 756 KB Output is partially correct
21 Correct 392 ms 600 KB Output is correct
22 Correct 415 ms 512 KB Output is correct
23 Partially correct 406 ms 348 KB Output is partially correct
24 Correct 392 ms 348 KB Output is correct
25 Correct 392 ms 504 KB Output is correct
26 Correct 392 ms 344 KB Output is correct
27 Partially correct 407 ms 596 KB Output is partially correct
28 Partially correct 409 ms 344 KB Output is partially correct
29 Correct 419 ms 508 KB Output is correct
30 Correct 391 ms 348 KB Output is correct
31 Correct 406 ms 592 KB Output is correct
32 Partially correct 391 ms 348 KB Output is partially correct
33 Correct 398 ms 744 KB Output is correct
34 Partially correct 398 ms 500 KB Output is partially correct
35 Correct 391 ms 500 KB Output is correct
36 Partially correct 408 ms 744 KB Output is partially correct
37 Partially correct 416 ms 504 KB Output is partially correct
38 Partially correct 398 ms 348 KB Output is partially correct
39 Correct 396 ms 600 KB Output is correct
40 Correct 400 ms 592 KB Output is correct