Submission #485434

#TimeUsernameProblemLanguageResultExecution timeMemory
485434MohamedFaresNebiliScales (IOI15_scales)C++14
45.45 / 100
1 ms292 KiB
#include <bits/stdc++.h> #include "scales.h" #pragma GCC optimize ("Ofast") #pragma GCC target ("avx2") using namespace std; using ll = long long; using vi = vector<int>; #define pb push_back #define ff first #define ss second #define lb lower_bound #define all(x) (x).begin() , (x).end() void init(int T) { return; } void orderCoins(void) { vector<int>res, curr; int W[6]; int a = getLightest(1, 2, 3), b = getLightest(4, 5, 6); for(int l = 1; l <= 6; l++) { if(l == a || l == b) continue; W[0] = getLightest(a, b, l); break; } for(int l = 1; l <= 6; l++) { if(l == W[0]) continue; curr.pb(l); } a = getLightest(curr[0], curr[1], curr[2]); W[1] = getLightest(a, curr[3], curr[4]); curr.clear(); for(int l = 1; l <= 6; l++) { if(l == W[0] || l == W[1]) continue; curr.pb(l); } a = getLightest(curr[0], curr[1], curr[2]); for(int l = 1; l <= 6; l++) { if(l == W[0] || l == W[1] || l == a || l == curr[3]) continue; W[2] = getLightest(a, l, curr[3]); break; } curr.clear(); for(int l = 1; l <= 6; l++) { if(l == W[0] || l == W[1] || l == W[2]) continue; curr.pb(l); } W[3] = getLightest(curr[0], curr[1], curr[2]); curr.clear(); for(int l = 1; l <= 6; l++) { if(l == W[0] || l == W[1] || l == W[2] || l == W[3]) continue; curr.pb(l); } W[5] = getHeaviest(curr[0], curr[1], W[0]); for(int l = 1; l <= 6; l++) { if(l == W[0] || l == W[1] || l == W[2] || l == W[3] || l == W[5]) continue; W[4] = l; break; } answer(W); }

Compilation message (stderr)

scales.cpp: In function 'void init(int)':
scales.cpp:17:23: warning: unused parameter 'T' [-Wunused-parameter]
   17 |         void init(int T) {
      |                   ~~~~^
#Verdict Execution timeMemoryGrader output
Fetching results...