# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
780438 | vjudge1 | Scales (IOI15_scales) | C++17 | 1 ms | 276 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "scales.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define st first
#define nd second
#define sp " "
//#define endl "\n"
#define pii pair<int, int>
void init(int T) {
/* ... */
}
vector<int> order4(vector<int> v){
//cout<<v[1]<<sp<<v[2]<<sp<<v[3]<<sp<<v[0]<<endl;
int tmp = getNextLightest(v[1], v[2], v[3], v[0]);
//cout<<tmp<<endl;
vector<int> rem;
for (int i = 1; i < 4; i++){
if (v[i] != tmp) rem.pb(v[i]);
}
int k = getLightest(v[0], tmp, rem[0]);
//cout<<k<<endl;
vector<int> ans;
if (k == rem[0]){
int l = getLightest(rem[0], rem[1], v[0]);
int m = getHeaviest(rem[0], rem[1], v[0]);
if (m == v[0]){
if (l != rem[0]){
swap(rem[0], rem[1]);
}
ans = {rem[0], rem[1], v[0], tmp};
}
else{
ans = {rem[0], v[0], tmp, rem[1]};
}
}
if (k == tmp){
int l = getLightest(v[0], rem[0], rem[1]);
//l = getLightest(v[0], rem[0], rem[1]);
if (l == rem[1]) swap(rem[0], rem[1]);
ans = {tmp, rem[0], rem[1], v[0]};
}
if (k == v[0]){
int l = getHeaviest(tmp, rem[0], rem[1]);
int m = getLightest(tmp, rem[0], rem[1]);
if (m == tmp){
if (l == rem[0]) swap(rem[0], rem[1]);
ans = {v[0], tmp, rem[0], rem[1]};
}
else{
ans = {rem[1], v[0], tmp, rem[0]};
}
}
return ans;
}
void orderCoins() {
/* ... */
int W[] = {1, 2, 3, 4, 5, 6};
int x = getLightest(1, 2, 3);
int y = getLightest(4, 5, 6);
int tmp = 1;
if (x == 1) tmp = 2;
//cout<<x<<sp<<y<<sp<<tmp<<endl;
int z = getLightest(tmp, x, y);
vector<int> ans, done(7, 0);
ans.pb(z);
done[z] = 1;
if (z == x){
vector<int> t;
for (int i = 1; i <= 3; i++){
if (i != x) t.pb(i);
}
z = getLightest(t[0], t[1], y);
done[z] = 1;
ans.pb(z);
}
else{
vector<int> t;
for (int i = 4; i <= 6; i++){
if (i != y) t.pb(i);
}
z = getLightest(t[0], t[1], x);
done[z] = 1;
ans.pb(z);
}
vector<int> rem;
for (int i = 1; i <= 6; i++){
if (done[i] == 0) rem.pb(i);
}
rem = order4(rem);
for (auto i : rem) ans.pb(i);
for (int i = 0; i < 6; i++){
W[i] = ans[i];
}
answer(W);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |