제출 #760888

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
760888		Ahmed57	Scales (IOI15_scales)	C++17	33.33 / 100	1 ms	332 KiB

scales

#include "scales.h"

#include <bits/stdc++.h>

using namespace std;
void init(int T){
    return ;
}
//int ww[7];
//int getHeaviest(int A, int B, int C);
//int getLightest(int A, int B, int C);
//int getMedian(int A, int B, int C);
//int getNextLightest(int A, int B, int C, int D);
//void answer(int W[6]);
vector<int> ers(vector<int> v,int x){
    vector<int> res;
    for(auto i:v){
        if(i==x)continue;
        res.push_back(i);
    }
    return res;
}
void orderCoins(){
    vector<int> rem;
    int ans[6] = {0};
    for(int i = 1;i<=6;i++)rem.push_back(i);
    random_shuffle(rem.begin(),rem.end());
    int x = getLightest(rem[0],rem[1],rem[2]);
    int y = getLightest(rem[3],rem[4],rem[5]);
    int z = getLightest(x,y,((x!=rem[0]&&y!=rem[0])?rem[0]:((x!=rem[1]&&y!=rem[1])?rem[1]:rem[2])));
    ans[0] = z;
    rem = ers(rem,z);
    x = getLightest(rem[0],rem[1],rem[2]);
    y = getLightest(rem[2],rem[3],rem[4]);
    if(x==y){
        z = x;
    }else{
        z = getLightest(x,y,((x!=rem[0]&&y!=rem[0])?rem[0]:((x!=rem[1]&&y!=rem[1])?rem[1]:rem[2])));
    }
    ans[1] = z;
    rem = ers(rem,z);
    x = getLightest(rem[0],rem[1],rem[2]);
    y = getLightest(rem[1],rem[2],rem[3]);
    if(x==y){
        z = x;
    }else{
        z = getLightest(x,y,((x!=rem[0]&&y!=rem[0])?rem[0]:((x!=rem[1]&&y!=rem[1])?rem[1]:rem[2])));
    }
    ans[2] = z;
    rem = ers(rem,z);
    z = getLightest(rem[0],rem[1],rem[2]);
    ans[3] = z;
    rem = ers(rem,z);
    z = getMedian(rem[0],rem[1],z);
    ans[4] = z;
    rem = ers(rem,z);
    ans[5] = rem[0];
    int he[] = {ans[0],ans[1],ans[2],ans[3],ans[4],ans[5]};
    answer(he);
    return ;
}
/*
int main(){
    ww[1] = 2 , ww[2] = 1, ww[3] = 3 , ww[4] = 4, ww[5] =5 , ww[6] = 6;
    orderCoins();
}*/

컴파일 시 표준 에러 (stderr) 메시지

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

• Subtask 1: 33.333333 / 100