#include "scales.h"
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
void init(int T) {
/* ... */
}
void orderCoins() {
random_device rnd;
vector<int>v{1,2,3,4,5,6};
shuffle(v.begin(),v.end(),rnd);
int A=getLightest(v[0],v[1],v[2]),B=getMedian(v[0],v[1],v[2]),C=v[0]+v[1]+v[2]-A-B;
int D=getLightest(v[3],v[4],v[5]),E=getMedian(v[3],v[4],v[5]),F=v[3]+v[4]+v[5]-D-E;
int nD,nE,nF;
if(getHeaviest(B,C,F)!=C){
swap(A,D);swap(B,E);swap(C,F);
}
nD=getNextLightest(A,B,C,D);
nE=getNextLightest(A,B,C,E);
nF=getNextLightest(A,B,C,F);
int As[]{A,B,C},Ds[]{D,E,F},nDs[]{nD,nE,nF};
int s=0;
vector<int>ans;
rep(i,3){
while(s<3&&nDs[s]==As[i])ans.push_back(Ds[s++]);
ans.push_back(As[i]);
}
while(s<3)ans.push_back(Ds[s++]);
int W[6]{};
rep(i,6)W[i]=ans[i];
answer(W);
}
Compilation message
scales.cpp: In function 'void init(int)':
scales.cpp:6:15: warning: unused parameter 'T' [-Wunused-parameter]
void init(int T) {
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Partially correct |
5 ms |
256 KB |
Output is partially correct |
| 2 |
Partially correct |
5 ms |
256 KB |
Output is partially correct |
| 3 |
Partially correct |
5 ms |
256 KB |
Output is partially correct |
| 4 |
Partially correct |
5 ms |
256 KB |
Output is partially correct |
| 5 |
Partially correct |
5 ms |
376 KB |
Output is partially correct |
| 6 |
Partially correct |
5 ms |
256 KB |
Output is partially correct |
| 7 |
Partially correct |
5 ms |
256 KB |
Output is partially correct |
| 8 |
Partially correct |
5 ms |
376 KB |
Output is partially correct |
| 9 |
Partially correct |
5 ms |
256 KB |
Output is partially correct |
| 10 |
Partially correct |
5 ms |
256 KB |
Output is partially correct |
| 11 |
Partially correct |
5 ms |
256 KB |
Output is partially correct |
| 12 |
Partially correct |
5 ms |
256 KB |
Output is partially correct |
| 13 |
Partially correct |
5 ms |
256 KB |
Output is partially correct |
| 14 |
Partially correct |
5 ms |
256 KB |
Output is partially correct |
| 15 |
Partially correct |
5 ms |
256 KB |
Output is partially correct |
| 16 |
Partially correct |
5 ms |
256 KB |
Output is partially correct |
| 17 |
Partially correct |
5 ms |
256 KB |
Output is partially correct |
| 18 |
Partially correct |
5 ms |
256 KB |
Output is partially correct |
| 19 |
Partially correct |
5 ms |
256 KB |
Output is partially correct |
| 20 |
Partially correct |
5 ms |
376 KB |
Output is partially correct |
| 21 |
Partially correct |
5 ms |
376 KB |
Output is partially correct |
| 22 |
Partially correct |
5 ms |
376 KB |
Output is partially correct |
| 23 |
Partially correct |
5 ms |
376 KB |
Output is partially correct |
| 24 |
Partially correct |
5 ms |
256 KB |
Output is partially correct |
| 25 |
Partially correct |
5 ms |
256 KB |
Output is partially correct |
| 26 |
Partially correct |
5 ms |
256 KB |
Output is partially correct |
| 27 |
Partially correct |
5 ms |
300 KB |
Output is partially correct |
| 28 |
Partially correct |
5 ms |
256 KB |
Output is partially correct |
| 29 |
Partially correct |
5 ms |
256 KB |
Output is partially correct |
| 30 |
Partially correct |
5 ms |
256 KB |
Output is partially correct |
| 31 |
Partially correct |
5 ms |
256 KB |
Output is partially correct |
| 32 |
Partially correct |
5 ms |
256 KB |
Output is partially correct |
| 33 |
Partially correct |
5 ms |
256 KB |
Output is partially correct |
| 34 |
Partially correct |
5 ms |
256 KB |
Output is partially correct |
| 35 |
Partially correct |
5 ms |
376 KB |
Output is partially correct |
| 36 |
Partially correct |
5 ms |
256 KB |
Output is partially correct |
| 37 |
Partially correct |
5 ms |
256 KB |
Output is partially correct |
| 38 |
Partially correct |
5 ms |
256 KB |
Output is partially correct |
| 39 |
Partially correct |
5 ms |
256 KB |
Output is partially correct |
| 40 |
Partially correct |
5 ms |
256 KB |
Output is partially correct |
