Submission #286337

#TimeUsernameProblemLanguageResultExecution timeMemory
286337dolphingarlicScales (IOI15_scales)C++14
71.43 / 100
1 ms384 KiB
#include "scales.h" #include <bits/stdc++.h> using namespace std; void init(int T) {} void orderCoins() { deque<int> K; int A = getNextLightest(1, 2, 3, 4); int B = A % 3 + 1; int C = getLightest(A, B, 4); if (C == A) { // A is the lightest; 4 is the heaviest int med = getMedian(A, B, 6 - A - B); K = {A, med, 6 - A - med, 4}; } else if (C == 4) { // (4 < A) < B int med = getMedian(4, B, 6 - A - B); if (med == 4) K = {6 - A - B, 4, A, B}; else if (med == B) K = {4, A, B, 6 - A - B}; else K = {4, A, 6 - A - B, B}; } else { // B < (4 < A) int med = getMedian(4, B, 6 - A - B); if (med == 4) K = {B, 4, A, 6 - A - B}; else if (med == B) K = {6 - A - B, B, 4, A}; else K = {B, 6 - A - B, 4, A}; } // for (int i : K) cout << i << ' '; // cout << '\n'; int five_pos = getNextLightest(K[1], K[2], K[3], 5); if (five_pos == K[1]) { int med = getMedian(K[0], K[1], 5); if (med == K[0]) K.push_front(5); else if (med == K[1]) K.push_back(5); else K.insert(K.begin() + 1, 5); } else K.insert(find(K.begin(), K.end(), five_pos), 5); // for (int i : K) cout << i << ' '; // cout << '\n'; int six_pos = getNextLightest(K[0], K[2], K[4], 6); if (six_pos == K[0]) { if (getLightest(K[0], K[1], 6) == 6) K.push_front(6); else K.push_back(6); } else if (six_pos == K[2]) { if (getMedian(K[1], K[2], 6) == K[1]) K.insert(K.begin() + 1, 6); else K.insert(K.begin() + 2, 6); } else { if (getMedian(K[3], K[4], 6) == K[3]) K.insert(K.begin() + 3, 6); else K.insert(K.begin() + 4, 6); } // for (int i : K) cout << i << ' '; // cout << '\n'; // cout << "END DEBUG\n"; int W[6] = {K[0], K[1], K[2], K[3], K[4], K[5]}; answer(W); }

Compilation message (stderr)

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