Submission #706366

#	Time	Username	Problem	Language	Result	Execution time	Memory
706366		marvinthang	Scales (IOI15_scales)	C++17	45.45 / 100	1 ms	340 KiB

scales

/*************************************
*    author: marvinthang             *
*    created: 06.03.2023 15:25:06    *
*************************************/

#include "scales.h"
#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> scan_op(pair <U, V>)  { return in >> u.fi >> u.se; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }

// end of template

void init(int T) {

}

void orderCoins() {
    int W[] = {1, 2, 3, 4, 5, 6};
    vector <int> v, left, right;
    left.push_back(getLightest(1, 2, 3));
    left.push_back(getMedian(1, 2, 3));
    left.push_back(6 - left[0] - left[1]);

    right.push_back(getLightest(4, 5, 6));
    right.push_back(getMedian(4, 5, 6));
    right.push_back(15 - right[0] - right[1]);

    int i = 0, j = 0;
    while (i < 3 || j < 3) {
        if (i == 3) {
            v.insert(v.end(), j + ALL(right));
            break;
        }
        if (j == 3) {
            v.insert(v.end(), i + ALL(left));
            break;
        }
        if (i == 2 ? getHeaviest(left[i], right[j], left[0]) == right[j] : getLightest(left[i], right[j], left[2]) == left[i]) v.push_back(left[i++]);
        else v.push_back(right[j++]);
    }
    copy(ALL(v), W);
    answer(W);
}

Compilation message (stderr)

scales.cpp: In function 'void init(int)':
scales.cpp:46:15: warning: unused parameter 'T' [-Wunused-parameter]
   46 | void init(int T) {
      |           ~~~~^

• Subtask 1: 45.454545 / 100