# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1088215 | browntoad | Scales (IOI15_scales) | C++14 | 1 ms | 600 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 <bits/stdc++.h>
#include "scales.h"
using namespace std;
#define ll long long
// #define int ll
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, n+1)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define pii pair<int, int>
#define f first
#define s second
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) (int)((x).size())
const ll maxn = 1e5+5;
int tt;
void init(int T){
tt = T;
}
void orderCoins(){
vector<int> ww = {1, 2, 3, 4, 5, 6};
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
shuffle(ALL(ww), rng);
int mnl = getLightest(ww[0], ww[1], ww[2]), mxl = getHeaviest(ww[0], ww[1], ww[2]);
int mel;
REP(i, 3) if (ww[i] != mnl && ww[i] != mxl) mel = ww[i];
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |