oj.uz

Submission #604416

# Submission time Handle Problem Language Result Execution time Memory
604416 2022-07-25T06:09:13 Z wiwiho Scales (IOI15_scales) C++14
56.5972 / 100
 1 ms 212 KB 
#include "scales.h"

#include <bits/stdc++.h>

#define iter(a) a.begin(), a.end()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(iter(a), greater<>())
#define eb emplace_back
#define ef emplace_front
#define pob pop_back()
#define pof pop_front()
#define mp make_pair
#define F first
#define S second
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b){ \
    for(auto pv : a) b << pv << " "; \
    b << "\n"; \
}

using namespace std;

typedef long long ll;
typedef long double ld;

using pii = pair<int, int>;
using pll = pair<ll, ll>;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

mt19937 rnd(clock());

void init(int T){
}

int tt = 0;
vector<int> solve(){
    tt++;
    cerr << "solve " << tt << "\n";
    
    vector<int> T = {1, 2, 3, 4, 5, 6};
    shuffle(iter(T), rnd);
    vector<int> A, B;
    {
        int l = getLightest(T[0], T[1], T[2]);
        int r = getHeaviest(T[0], T[1], T[2]);
        A.eb(l);
        A.eb(l ^ r ^ T[0] ^ T[1] ^ T[2]);
        A.eb(r);
    }
    {
        int l = getLightest(T[3], T[4], T[5]);
        int r = getHeaviest(T[3], T[4], T[5]);
        B.eb(l);
        B.eb(l ^ r ^ T[3] ^ T[4] ^ T[5]);
        B.eb(r);
    }
    printv(A, cerr);
    printv(B, cerr);

    int tmp = getMedian(A[1], A[2], B[2]);
    cerr << tmp << "\n";
    if(tmp == A[2]){
        // A[0] A[1] A[2] B[2]
        tmp = getMedian(A[1], A[2], B[1]);
        if(tmp == A[2]){
            // A[0] A[1] A[2] B[1] B[2]
            tmp = getMedian(A[0], A[1], B[0]);
            if(tmp == A[0]) return {B[0], A[0], A[1], A[2], B[1], B[2]};
            else if(tmp == B[0]) return {A[0], B[0], A[1], A[2], B[1], B[2]};
            else{
                tmp = getMedian(A[1], B[0], A[2]);
                if(tmp == B[0]) return {A[0], A[1], B[0], A[2], B[1], B[2]};
                else return {A[0], A[1], A[2], B[0], B[1], B[2]};
            }
        }
        else if(tmp == B[1]){
            // A[0] A[1] B[1] A[2] B[2]
            tmp = getMedian(A[0], A[1], B[0]);
            if(tmp == A[1]) return {A[0], A[1], B[0], B[1], A[2], B[2]};
            else if(tmp == B[0]) return {A[0], B[0], A[1], B[1], A[2], B[2]};
            else return {B[0], A[0], A[1], B[1], A[2], B[2]};
        }
        else{
            // B[1] A[1] A[2] B[2]
            tmp = getMedian(A[0], B[0], B[1]);
            if(tmp == B[0]) return {A[0], B[0], B[1], A[1], A[2], B[2]};
            else if(tmp == A[0]) return {B[0], A[0], B[1], A[1], A[2], B[2]};
            else return {B[0], B[1], A[0], A[1], A[2], B[2]};
        }
    }
    else if(tmp == B[2]){
        // A[0] A[1] B[2] A[2]
        tmp = getMedian(A[0], A[1], B[1]);
        if(tmp == A[1]){
            // A[0] A[1] B[1] B[2] A[2]
            tmp = getMedian(A[0], A[1], B[0]);
            if(tmp == A[1]) return {A[0], A[1], B[0], B[1], B[2], A[2]};
            else if(tmp == B[0]) return {A[0], B[0], A[1], B[1], B[2], A[2]};
            else return {B[0], A[0], A[1], B[1], B[2], A[2]};
        }
        else if(tmp == B[1]){
            // A[0] B[1] A[1] B[2] A[2]
            tmp = getMedian(B[0], A[0], B[1]);
            if(tmp == A[0]) return {B[0], A[0], B[1], A[1], B[2], A[2]};
            else return {A[0], B[0], B[1], A[1], B[2], A[2]};
        }
        else{
            return {B[0], B[1], A[0], A[1], B[2], A[2]};
        }
    }
    else{
        // B[0] B[1] B[2] A[1] A[2]
        tmp = getMedian(B[0], B[1], A[0]);
        if(tmp == B[0]) return {A[0], B[0], B[1], B[2], A[1], A[2]};
        else if(tmp == A[0]) return {B[0], A[0], B[1], B[2], A[1], A[2]};
        else{
            tmp = getMedian(A[0], B[2], A[1]);
            if(tmp == B[2]) return {B[0], B[1], A[0], B[2], A[1], A[2]};
            else return {B[0], B[1], B[2], A[0], A[1], A[2]};
        }
    }

}

void orderCoins(){
    vector<int> ans = solve();
    int av[6];
    for(int i = 0; i < 6; i++) av[i] = ans[i];
    answer(av);
}

Compilation message

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

Subtask #1
56.597222 / 100.0

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