# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
41736 | funcsr | Scales (IOI15_scales) | C++14 | 2 ms | 828 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "scales.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <queue>
#include <cassert>
#include <deque>
using namespace std;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define index(x, y) (int)(lower_bound(all(x), y) - x.begin())
#define pb push_back
#define _1 first
#define _2 second
typedef pair<int, int> P;
void init(int T) {}
deque<int> sort3(vector<int> a) {
assert(a.size() == 3);
int lo = getLightest(a[0], a[1], a[2]);
int hi = getHeaviest(a[0], a[1], a[2]);
int rest = -1;
for (int x : a) if (x != lo && x != hi) rest = x;
return {lo, rest, hi};
}
void orderCoins() {
deque<int> L = sort3({1, 2, 3}),
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |