Submission #41736

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
41736	2018-02-21T06:11:33 Z	funcsr	Scales (IOI15_scales)	C++14	56.4236 / 100	2 ms	828 KB

scales

#include "scales.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <queue>
#include <cassert>
#include <deque>
using namespace std;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define index(x, y) (int)(lower_bound(all(x), y) - x.begin())
#define pb push_back
#define _1 first
#define _2 second
typedef pair<int, int> P;

void init(int T) {}
deque<int> sort3(vector<int> a) {
  assert(a.size() == 3);
  int lo = getLightest(a[0], a[1], a[2]);
  int hi = getHeaviest(a[0], a[1], a[2]);
  int rest = -1;
  for (int x : a) if (x != lo && x != hi) rest = x;
  return {lo, rest, hi};
}

void orderCoins() {
  deque<int> L = sort3({1, 2, 3}),
             R = sort3({4, 5, 6});
  vector<int> ret;
  while (!L.empty() && !R.empty()) {
    if (L.size() == 1 && R.size() == 1) {
      assert(ret.size());
      int mx = getHeaviest(ret[0], L.front(), R.front());
      ret.pb(L.front()==mx?R.front():L.front());
      ret.pb(mx);
      L.clear();
      R.clear();
      continue;
    }
    if (R.size() == 1) swap(L, R);
    int med = getMedian(L[0], R[0], R[1]);
    if (med == L[0]) {
      ret.pb(R[0]);
      ret.pb(L[0]);
      L.pop_front();
      R.pop_front();
    }
    else if (med == R[1]) {
      ret.pb(R[0]);
      ret.pb(R[1]);
      R.pop_front();
      R.pop_front();
    }
    else if (med == R[0]) {
      ret.pb(L[0]);
      L.pop_front();
    }
    else abort();
  }
  while (!L.empty()) ret.pb(L.front()), L.pop_front();
  while (!R.empty()) ret.pb(R.front()), R.pop_front();
  assert(ret.size() == 6);
  int W[] = {ret[0], ret[1], ret[2], ret[3], ret[4], ret[5]};
  answer(W);
}

Compilation message

scales.cpp:19:15: warning: unused parameter 'T' [-Wunused-parameter]
 void init(int T) {}
               ^

Subtask #1

56.423611 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Partially correct	2 ms	252 KB	Output is partially correct
2	Partially correct	2 ms	484 KB	Output is partially correct
3	Partially correct	2 ms	484 KB	Output is partially correct
4	Partially correct	2 ms	484 KB	Output is partially correct
5	Partially correct	2 ms	540 KB	Output is partially correct
6	Partially correct	2 ms	580 KB	Output is partially correct
7	Partially correct	2 ms	580 KB	Output is partially correct
8	Partially correct	2 ms	580 KB	Output is partially correct
9	Partially correct	2 ms	608 KB	Output is partially correct
10	Partially correct	2 ms	624 KB	Output is partially correct
11	Partially correct	2 ms	624 KB	Output is partially correct
12	Partially correct	2 ms	624 KB	Output is partially correct
13	Partially correct	2 ms	632 KB	Output is partially correct
14	Partially correct	2 ms	632 KB	Output is partially correct
15	Partially correct	2 ms	632 KB	Output is partially correct
16	Partially correct	2 ms	632 KB	Output is partially correct
17	Partially correct	2 ms	632 KB	Output is partially correct
18	Partially correct	2 ms	684 KB	Output is partially correct
19	Partially correct	2 ms	684 KB	Output is partially correct
20	Partially correct	2 ms	776 KB	Output is partially correct
21	Partially correct	2 ms	776 KB	Output is partially correct
22	Partially correct	2 ms	776 KB	Output is partially correct
23	Partially correct	1 ms	776 KB	Output is partially correct
24	Partially correct	2 ms	796 KB	Output is partially correct
25	Partially correct	2 ms	796 KB	Output is partially correct
26	Partially correct	2 ms	804 KB	Output is partially correct
27	Partially correct	2 ms	804 KB	Output is partially correct
28	Partially correct	2 ms	828 KB	Output is partially correct
29	Partially correct	2 ms	828 KB	Output is partially correct
30	Partially correct	2 ms	828 KB	Output is partially correct
31	Partially correct	2 ms	828 KB	Output is partially correct
32	Partially correct	2 ms	828 KB	Output is partially correct
33	Partially correct	2 ms	828 KB	Output is partially correct
34	Partially correct	2 ms	828 KB	Output is partially correct
35	Partially correct	2 ms	828 KB	Output is partially correct
36	Partially correct	2 ms	828 KB	Output is partially correct
37	Partially correct	2 ms	828 KB	Output is partially correct
38	Partially correct	2 ms	828 KB	Output is partially correct
39	Partially correct	2 ms	828 KB	Output is partially correct
40	Partially correct	2 ms	828 KB	Output is partially correct