oj.uz

Submission #387512

# Submission time Handle Problem Language Result Execution time Memory
387512 2021-04-08T16:47:20 Z ACmachine Scales (IOI15_scales) C++17
55.5556 / 100
 1 ms 384 KB 
#include "scales.h"
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)

const double EPS = 1e-9;
const int MOD = 1e9+7;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

void DBG(){cout << "]" << endl;}
template<typename T, typename ...U> void DBG(const T& head, const U... args){ cout << head << "; "; DBG(args...); }
#define dbg(...) cout << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__);
#define chk() cout << "Check at line(" << __LINE__ << ") hit." << endl;

template<class T, unsigned int U>
ostream& operator<<(ostream& out, const array<T, U> &v){out << "[";  REP(i, U) out << v[i] << ", ";  out << "]"; return out;}
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}

template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }

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

void orderCoins() {
    /* ... */
    int W[] = {1, 2, 3, 4, 5, 6};
    int w1[3]; int w2[3];
    w1[0] = getLightest(1, 2, 3);
    w1[2] = getHeaviest(1, 2, 3);
    FOR(i, 1, 4, 1){
        if(w1[0] != i && w1[2] != i)
            w1[1] = i;
    }
    w2[0] = getLightest(4, 5, 6);
    w2[2] = getHeaviest(4, 5, 6);
    FOR(i, 4, 7, 1){
        if(w2[0] != i && w2[2] != i)
            w2[1] = i;
    }
    int f = getLightest(w1[0], w2[0], w1[1]);
    W[0] = f;
    int pp1 = 0;
    int pp2 = 0;
    if(w1[pp1] == f)
        pp1++;
    if(w2[pp2] == f)
        pp2++;
    int id = 1;
    auto median_trick = [&](int a, int b, int c){
        int x = getMedian(a, b, c);
        if(a == x){
            W[3] = b;
            W[4] = a;
            W[5] = c;
        }
        else if(x == b){
            W[3] = a;
            W[4] = b;
            W[5] = c;
        }
        else if(x == c){
            W[3] = b;
            W[4] = c;
            W[5] = a;
        }
    };
    while(true){
        if((3 - pp1) == 1 && (3 - pp2) == 2){
            median_trick(w1[pp1], w2[pp2], w2[pp2 + 1]);
            break;
        }
        if((3 - pp1) == 2 && (3 - pp2) == 1){
            median_trick(w2[pp2], w1[pp1], w1[pp1 + 1]);
            break;
        }
        if(pp1 < 3 && pp2 < 3){
            int s = getHeaviest(f, w1[pp1], w2[pp2]);
            if(s == w1[pp1]){
                W[id] = w2[pp2];
                pp2++;
            }
            if(s == w2[pp2]){
                W[id] = w1[pp1];
                pp1++;
            }
        }
        else if(pp1 < 3){
            W[id] = w1[pp1];
            pp1++;
        }
        else if(pp2 < 3){
            W[id] = w2[pp2];
            pp2++;
        }
        else
            break;
        id++;
    }
    answer(W);
}

Compilation message

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

Subtask #1
55.555556 / 100.0

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