# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1137067 | alterio | Scales (IOI15_scales) | C++20 | 0 ms | 328 KiB |
#include "scales.h"
#include <bits/stdc++.h>
using namespace std;
void init(int T) {
/* ... */
}
void orderCoins() {
/* ... */
int n = 6;
bool used[n + 1];
int W[n];
memset(used, 0, sizeof(used));
int ans1 = getLightest(1, 2, 3), ans2 = getLightest(4, 5, 6);
int other = 1;
if (ans1 == other) other = 2;
W[0] = getLightest(ans1, other, ans2);
used[W[0]] = 1;
auto left = [&]() {
vector<int> v;
for (int i = 1; i <= n; i++) {
if (!used[i]) v.push_back(i);
}
return v;
};
vector<int> v = left();
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |