제출 #292352

#제출 시각아이디문제언어결과실행 시간메모리
292352VodkaInTheJarScales (IOI15_scales)C++14
0 / 100
1 ms384 KiB
#include <bits/stdc++.h> #include "scales.h" using namespace std; void init(int t) { } vector <int> order_it(int a, int b, int c) { int temp = getMedian(a, b, c); if (temp == c) return {a, c, b}; else if (temp == a) return {c, a, b}; else return {a, b, c}; } int shit[6]; void orderCoins() { vector <int> v1; v1.push_back(getLightest(1, 2, 3)); v1.push_back(getMedian(1, 2, 3)); v1.push_back(getHeaviest(1, 2, 3)); /* if (1 != v1[0] && 1 != v1[1]) v1.push_back(1); else if (2 != v1[0] && 2 != v1[1]) v1.push_back(2); else v1.push_back(3); */ vector <int> v2; v2.push_back(getLightest(4, 5, 6)); v2.push_back(getMedian(4, 5, 6)); v2.push_back(getHeaviest(4, 5, 6)); /* if (4 != v2[0] && 4 != v2[1]) v1.push_back(4); else if (5 != v2[0] && 5 != v2[1]) v2.push_back(5); else v2.push_back(6); */ if (v1.size() != 3 || v2.size() != 3) { for (;;) { } } vector <int> ans; int temp = getNextLightest(v2[0], v2[1], v2[2], v1[2]); if (temp == v2[0]) { if (getLightest(v2[0], v1[0], v1[1]) == v2[0]) { for (auto i: v2) ans.push_back(i); for (auto i: v1) ans.push_back(i); } else { for (auto i: v1) ans.push_back(i); for (auto i: v2) ans.push_back(i); } } else if (temp == v2[1]) { for (auto i: order_it(v1[0], v1[1], v2[0])) ans.push_back(i); ans.push_back(v1[2]); ans.push_back(v2[1]); ans.push_back(v2[2]); } else { auto curr = getLightest(v1[0], v2[0], v1[1]); if (curr == v1[0]) { ans.push_back(curr); for (auto i: order_it(v2[0], v2[1], v1[1])) ans.push_back(i); ans.push_back(v1[2]); ans.push_back(v2[2]); } else { ans.push_back(curr); for (auto i: order_it(v1[0], v1[1], v2[1])) ans.push_back(i); ans.push_back(v1[2]); ans.push_back(v2[2]); } } for (int i = 0; i < 6; i++) shit[i] = ans[i]; answer(shit); }

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

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