| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 727362 | Boycl07 | Scales (IOI15_scales) | C++17 | 1 ms | 468 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;
typedef long long ll;
#define rep(i, n) for(int i = 1; i <= n; ++i)
#define forn(i, l, r) for(int i = l; i <= r; ++i)
#define ford(i, r, l) for(int i = r; i >= l; --i)
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define task "MEETING"
#define endl "\n"
#define C(x, y) make_pair(x, y)
template<typename T> bool maximize(T &res, const T &val) { if (res <= val){ res = val; return true; }; return false; }
template<typename T> bool minimize(T &res, const T &val) { if (res >= val){ res = val; return true; }; return false; }
const int N = 8 + 7;
const int MOD = 1e9 + 7 ;
const int INF = 1e13 + 9999;
const int block_size = 230;
const int offset = N;
const int LIM = 721;
int p[N], pos[LIM][7], b[LIM], nx[LIM], n, arr[LIM][7];
int find_nx(int x)
{
if(!b[nx[x]]) return nx[x];
return nx[x] = find_nx(nx[x]);
}
void init(int T)
{
int idx = 0;
nx[0] = 1;
rep(i, 6) p[i] = i;
do
{
++idx;
rep(i, 6) pos[idx][p[i]] = 1;
nx[idx] = idx + 1;
rep(i, 6) arr[idx][i] = p[i];
} while(next_permutation(p + 1, p + 1 + 6));
}
int w[6];
struct condition {
int type;
int a, b, c, d;
int res;
condition(){}
condition(int type_, int a_, int b_, int c_) : type(type_), a(a_), b(b_), c(c_){}
condition(int type_, int a_, int b_, int c_, int d_) : type(type_), a(a_), b(b_), c(c_), d(d_){}
};
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
vector<condition> q;
void update()
{
auto e = q.back();
int type = e.type;
int a = e.a, b = e.b, c = e.c, d = e.d;
if(type == 0)
e.res = getLightest(a, b, c);
else if(type == 1)
e.res = getMedian(a, b, c);
else if(type == 0)
e.res = getHeaviest(a, b, c);
else e.res = getNextLightest(a, b, c, d);
}
int tmp[3];
bool check(int idx)
{
for(auto e : q)
{
int type = e.type;
int a = e.a, b = e.b, c = e.c, res = e.res;
tmp[0] = a;
tmp[1] = b;
tmp[2] = c;
sort(tmp, tmp + 2, [&idx](int x, int y) {
return pos[idx][x] < pos[idx][y];
});
if(type != 3)
{
if(type == 0)
{
if(res == a) return 1;
return 0;
}
else if(type == 1)
{
if(res == b) return 1;
return 0;
}
else
{
if(res == c) return 1;
return 0;
}
}
else
{
int d = e.d;
if(pos[d] < pos[a])
{
if(res == a) return 0;
return 1;
}
if(pos[d] < pos[b])
{
if(res == b) return 0;
return 1;
}
if(res != c) return 1;
return 0;
}
}
}
int randint(int l, int r)
{
return rng() % (r - l + 1) + l;
}
void orderCoins()
{
int cnt = 720;
rep(i, 720) b[i] = 0;
while(cnt > 1)
{
int type = rng() % 4;
if(type != 3)
{
int a = randint(1, 4);
int b = randint(a + 1, 5);
int c = randint(b + 1, 6);
if(randint(0, 1)) swap(a, b);
if(randint(0, 1)) swap(a, c);
if(randint(0, 1)) swap(b, c);
q.push_back(condition(type, a, b, c));
}
else
{
int a = randint(1, 3);
int b = randint(a + 1, 4);
int c = randint(b + 1, 5);
int d = randint(c + 1, 6);
if(randint(0, 1)) swap(a, b);
if(randint(0, 1)) swap(a, c);
if(randint(0, 1)) swap(b, c);
if(randint(0, 1)) swap(b, d);
q.push_back(condition(type, a, b, c, d));
}
update();
int idx = find_nx(0);
for(; idx <= n; idx = find_nx(idx))
{
if(check(idx)) --cnt, b[idx] = 0;
}
}
int idx = find_nx(0);
rep(i, 6) w[i - 1] = arr[idx][i];
answer(w);
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||