Submission #1246589

#	Time	Username	Problem	Language	Result	Execution time	Memory
1246589		lrnnz	Scales (IOI15_scales)	C++20	0 / 100	1 ms	320 KiB

scales

#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <queue>
#include <random>
#include "scales.h"
using namespace std;

#define all(a) (a).begin(), (a).end()
#define ll long long
#define ld long double
#define ui uint64_t
#define cont(set, element) ((set).find(element) != (set).end())
#define pb push_back

#define chmin(x, y) (x = min(x, y)) 
#define chmax(x, y) (x = max(x, y))

/********* DEBUG *********/

template <typename T>
void outvec(const vector<T>& Z){
    for (const T& x : Z)
    cout << x << ' ';
    cout << "\n";
}
void printVariable(const any& var) {
    if (!var.has_value()) {
        cout << "null";
        return;
    }

    if (var.type() == typeid(int)) {
        cout << any_cast<int>(var);
    } else if (var.type() == typeid(double)) {
        cout << any_cast<double>(var);
    } else if (var.type() == typeid(float)) {
        cout << any_cast<float>(var);
    } else if (var.type() == typeid(char)) {
        cout << any_cast<char>(var);
    } else if (var.type() == typeid(bool)) {
        cout << (any_cast<bool>(var) ? "true" : "false");
    } else if (var.type() == typeid(string)) {
        cout << any_cast<string>(var);
    } else if (var.type() == typeid(const char*)) {
        cout << any_cast<const char*>(var);
    } else if (var.type() == typeid(long long)) {
        cout << any_cast<long long>(var);
    } else {
        cout << "[unknown type]";
    }
}

template<typename... Args>
void outval(Args... args) {
    vector<any> variables = {args...};
    
    for (size_t i = 0; i < variables.size(); ++i) {
        printVariable(variables[i]);
        if (i != variables.size() - 1) {
            cout << " ";
        }
    }
    cout << "\n";
}

#define sp << " " <<
#define fi first
#define se second

/********* DEBUG *********/

const ll MOD2 = 1e9 + 7;
const ll MOD = 998244353;
const ll inf = 1e18;

void init(int T){

}

void orderCoins() {
    ll loA = getLightest(1,2,3), loB = getLightest(4,5,6);
    ll x = 1;
    while (x == loA || x == loB)
        x++;

    int ans[6];
    ll trueLo = getLightest(loA, loB, x);
    ans[0] = trueLo;

    vector<ll> inA, inB;
    for (int i = 1; i <= 3; i++)
        if (i != loA)
            inA.push_back(i);

    for (int i = 4; i <= 6; i++)
        if (i != loB)
            inB.push_back(i);

    if (trueLo == loA){
        ll a,b,c;
        a = inA[0], b = inA[1], c = loB;

        ans[1] = getLightest(a,b,c);
        if (ans[1] == c){
            c = getMedian(4,5,6);

            ans[2] = getLightest(a,b,c);

            ll x = 4;
            while (x == ans[2] || x == loB)
                x++;    

            if (ans[2] == c)     
                c = x;      
            else if (ans[2] == b)
                b = x;
            else
                a = x;

            ans[3] = getLightest(a,b,c);
            ans[4] = getMedian(a,b,c);
            ans[5] = a;

            if (ans[3] == a || ans[4] == a)
                ans[5] = b;
                
            if (ans[5] == b && (ans[3] == b || ans[4] == b))
                ans[5] = c;
        }
        else {
            if (ans[1] == a){
                a = inB[0];
                swap(a,b);
            }
            else{
                b = inB[0];
            }

            ans[2] = getLightest(a,b,c);
            if (ans[2] == a)
                a = inB[1];
            else if (ans[2] == b)
                b = inB[1];
            else
                c = inB[1];

            ans[3] = getLightest(a,b,c);
            ans[4] = getMedian(a,b,c);
            ans[5] = a;

            if (ans[3] == a || ans[4] == a)
                ans[5] = b;
                
            if (ans[5] == b && (ans[3] == b || ans[4] == b))
                ans[5] = c;
        }
    }
    else{
        ll a,b,c;
        a = inB[0], b = inB[1], c = loA;

        ans[1] = getLightest(a,b,c);
        if (ans[1] == c){
            c = getMedian(1,2,3);

            ans[2] = getLightest(a,b,c);

            ll x = 1;
            while (x == ans[2] || x == loA)
                x++;    

            if (ans[2] == c)     
                c = x;      
            else if (ans[2] == b)
                b = x;
            else
                a = x;

            ans[3] = getLightest(a,b,c);
            ans[4] = getMedian(a,b,c);
            ans[5] = a;

            if (ans[3] == a || ans[4] == a)
                ans[5] = b;
                
            if (ans[5] == b && (ans[3] == b || ans[4] == b))
                ans[5] = c;
        }
        else {
            if (ans[1] == a){
                a = inA[0];
                swap(a,b);
            }
            else{
                b = inA[0];
            }

            ans[2] = getLightest(a,b,c);
            if (ans[2] == a)
                a = inA[1];
            else if (ans[2] == b)
                b = inA[1];
            else
                c = inA[1];

            ans[3] = getLightest(a,b,c);
            ans[4] = getMedian(a,b,c);
            ans[5] = a;

            if (ans[3] == a || ans[4] == a)
                ans[5] = b;
                
            if (ans[5] == b && (ans[3] == b || ans[4] == b))
                ans[5] = c;
        }
    }

    answer(ans);
}

• Subtask 1: 0 / 100