Submission #619879

#	Time	Username	Problem	Language	Result	Execution time	Memory
619879		yanndev	저울 (IOI15_scales)	C++17	33.33 / 100	1 ms	308 KiB

scales

#include "scales.h"
#include <bits/stdc++.h>
using namespace std;

mt19937 rng(4589);
int mx = -1;
map<pair<int, int>, bool> comp {};

void init(int T) {
    /* ... */
}

bool comp1(int a, int b) {
    if (a == b)
        return false;
    if (comp.find({a, b}) != comp.end())
        return comp[{a, b}];
        
    /*int c = a;
    while (c == a || c == b)
        c = (rng() % 6) + 1;*/
    int c = -1;
    for (int i = 1; i <= 6; i++)
        if (i != a && i != b)
            c = i;

    vector<int> ls {a, b, c};
    
    int small = getLightest(a, b, c);
    for (auto& x: ls) {
        if (x != small) {
            comp[{small, x}] = true;
            comp[{x, small}] = false;
        }
    }

    if (a == small)
        return true;
    if (b == small)
        return false;

    int big = getHeaviest(a, b, c);
    for (auto& x: ls) {
        if (x != big) {
            comp[{x, big}] = true;
            comp[{big, x}] = false;
        }
    }

    if (a == big)
        return false;
    if (b == big)
        return true;
}

bool comp2(int a, int b) {
    if (a == b)
        return false;
    if (comp.find({a, b}) != comp.end())
        return comp[{a, b}];
    if (b == mx) {
        comp[{a, b}] = true;
        comp[{b, a}] = false;
        return true;
    }
    if (a == mx) {
        comp[{a, b}] = false;
        comp[{b, a}] = true;
        return false;
    }

    int small = getLightest(a, b, mx);
    comp[{a, b}] = small == a;
    comp[{b, a}] = small != a;
    return small == a;
}

void orderCoins() {
    /* ... */
    int W[] = {1, 2, 3, 4, 5, 6};
    comp.clear();

    vector<int> cur {};
    for (int i = 1; i <= 6; i++) {
        if ((int)cur.size() < 3) {
            cur.push_back(i);
        }

        if ((int)cur.size() == 3) {
            mx = getHeaviest(cur[0], cur[1], cur[2]);
            cur = {mx};
        }
    }

    if ((int)cur.size() > 1) {
        for (int i = 1; (int)cur.size() < 3 && i <= 6; i++) {
            if (find(cur.begin(), cur.end(), i) == cur.end()) {
                cur.push_back(i);
            }
        }
        
        mx = getHeaviest(cur[0], cur[1], cur[2]);
    }

    //cout << "mx is " << mx << '\n';

    stable_sort(W, W + 6, comp2);
    answer(W);
}

Compilation message (stderr)

scales.cpp: In function 'void init(int)':
scales.cpp:9:15: warning: unused parameter 'T' [-Wunused-parameter]
    9 | void init(int T) {
      |           ~~~~^
scales.cpp: In function 'bool comp1(int, int)':
scales.cpp:27:28: warning: control reaches end of non-void function [-Wreturn-type]
   27 |     vector<int> ls {a, b, c};
      |                            ^

• Subtask 1: 33.333333 / 100