oj.uz

Submission #917622

# Submission time Handle Problem Language Result Execution time Memory
917622 2024-01-28T13:26:36 Z nguyentunglam Scales (IOI15_scales) C++17
77.6786 / 100
 617 ms 752 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) {
    vector<int> best;
    best.push_back(p.size());
    int _a, _b, _c, _d, _t;

    for(auto &[a, b, c, d] : four) {
      vector<int> choice;
      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) choice.push_back(sat);
      }
      if (choice.empty()) continue;
      sort(choice.begin(), choice.end(), greater<int> ());
      if (best > choice) {
        best = choice;
        _a = a;
        _b = b;
        _c = c;
        _d = d;
        _t = 0;
      }
    }

    for(auto &[a, b, c] : three) for(int type = 3; type >= 1; type--) {
      vector<int> choice;
      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) choice.push_back(sat);
      }
      if (choice.empty()) continue;
      sort(choice.begin(), choice.end(), greater<int> ());
      if (best > choice) {
        best = choice;
        _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:58:26: warning: conversion from 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} to 'std::vector<int>::value_type' {aka 'int'} may change value [-Wconversion]
   58 |     best.push_back(p.size());
      |                    ~~~~~~^~
scales.cpp:105:7: warning: '_t' may be used uninitialized in this function [-Wmaybe-uninitialized]
  105 |       if (_t == 1) result = getLightest(_a, _b, _c);
      |       ^~
scales.cpp:116:31: warning: '_d' may be used uninitialized in this function [-Wmaybe-uninitialized]
  116 |       result = getNextLightest(_a, _b, _c, _d);
      |                ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
scales.cpp:116:31: warning: '_c' may be used uninitialized in this function [-Wmaybe-uninitialized]
scales.cpp:116:31: warning: '_b' may be used uninitialized in this function [-Wmaybe-uninitialized]
scales.cpp:116: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 449 ms 504 KB Output is correct
2 Correct 468 ms 344 KB Output is correct
3 Correct 459 ms 596 KB Output is correct
4 Partially correct 439 ms 492 KB Output is partially correct
5 Correct 447 ms 740 KB Output is correct
6 Correct 447 ms 348 KB Output is correct
7 Partially correct 441 ms 504 KB Output is partially correct
8 Partially correct 455 ms 592 KB Output is partially correct
9 Partially correct 617 ms 504 KB Output is partially correct
10 Partially correct 442 ms 344 KB Output is partially correct
11 Partially correct 479 ms 592 KB Output is partially correct
12 Correct 437 ms 500 KB Output is correct
13 Partially correct 456 ms 504 KB Output is partially correct
14 Correct 439 ms 600 KB Output is correct
15 Correct 445 ms 496 KB Output is correct
16 Partially correct 448 ms 500 KB Output is partially correct
17 Partially correct 444 ms 344 KB Output is partially correct
18 Partially correct 443 ms 504 KB Output is partially correct
19 Correct 480 ms 348 KB Output is correct
20 Partially correct 455 ms 512 KB Output is partially correct
21 Correct 463 ms 596 KB Output is correct
22 Correct 455 ms 496 KB Output is correct
23 Partially correct 453 ms 348 KB Output is partially correct
24 Correct 441 ms 504 KB Output is correct
25 Correct 485 ms 504 KB Output is correct
26 Correct 487 ms 348 KB Output is correct
27 Partially correct 445 ms 344 KB Output is partially correct
28 Partially correct 461 ms 512 KB Output is partially correct
29 Correct 495 ms 500 KB Output is correct
30 Correct 442 ms 504 KB Output is correct
31 Correct 452 ms 752 KB Output is correct
32 Partially correct 446 ms 500 KB Output is partially correct
33 Correct 450 ms 508 KB Output is correct
34 Partially correct 453 ms 596 KB Output is partially correct
35 Correct 442 ms 504 KB Output is correct
36 Partially correct 443 ms 500 KB Output is partially correct
37 Partially correct 472 ms 348 KB Output is partially correct
38 Partially correct 439 ms 500 KB Output is partially correct
39 Correct 451 ms 592 KB Output is correct
40 Correct 443 ms 504 KB Output is correct