Submission #928755

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
928755	2024-02-17T04:29:12 Z	GrindMachine	Scales (IOI15_scales)	C++17	55.5556 / 100	1 ms	596 KB

scales

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "scales.h"

void init(int T) {

}

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

    deque<int> left_half, right_half;
    rep1(i,6){
        if(i <= 3) left_half.pb(i);
        else right_half.pb(i);
    }

    {
        int x = left_half[0], y = left_half[1], z = left_half[2];
        left_half.clear();

        int mn = getLightest(x,y,z);
        int med = getMedian(x,y,z);
        int mx = 0;
        if(x != mn and x != med) mx = x;
        if(y != mn and y != med) mx = y;
        if(z != mn and z != med) mx = z;

        left_half = {mn,med,mx};
    }

    {
        int x = right_half[0], y = right_half[1], z = right_half[2];
        right_half.clear();

        int mn = getLightest(x,y,z);
        int med = getMedian(x,y,z);
        int mx = 0;
        if(x != mn and x != med) mx = x;
        if(y != mn and y != med) mx = y;
        if(z != mn and z != med) mx = z;

        right_half = {mn,med,mx};
    }

    {
        int mn = getLightest(left_half[0],right_half[0],left_half[1]);
        if(mn == right_half[0]){
            swap(left_half,right_half);
        }
    }

    vector<int> ans;
    ans.pb(left_half[0]);
    left_half.pop_front();

    while(!left_half.empty() and !right_half.empty()){
        int compare_weight = left_half[0];
        int x = ans[0], y = right_half[0], z = -1;
        if(sz(right_half) >= 2) z = right_half[1];
        else z = ans[1];

        int res = getNextLightest(x,y,z,compare_weight);

        if(res == x){
            rep1(iter,2){
                if(!right_half.empty()){
                    ans.pb(right_half.front());
                    right_half.pop_front();
                }
            }
        }

        if(res == y){
            ans.pb(left_half.front());
            left_half.pop_front();
        }

        if(res == z){
            ans.pb(right_half.front());
            ans.pb(left_half.front());
            left_half.pop_front();
            right_half.pop_front();
        }
    }

    while(!left_half.empty()){
        ans.pb(left_half.front());
        left_half.pop_front();
    }

    while(!right_half.empty()){
        ans.pb(right_half.front());
        right_half.pop_front();
    }

    int ans_arr[6];
    rep(i,6) ans_arr[i] = ans[i];

    answer(ans_arr);
}

Compilation message

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

Subtask #1

55.555556 / 100.0

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