| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1076114 | Joshua_Andersson | 저울 (IOI15_scales) | C++14 | 666 ms | 600 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "scales.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll linf = ll(1e18);
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> p2;
#define rep(i, high) for (int i = 0; i < high; i++)
#define repp(i, low, high) for (int i = low; i < high; i++)
#define repe(i, container) for (auto& i : container)
#define sz(container) ((int)container.size())
#define all(x) begin(x),end(x)
#if _LOCAL
#define assert(x) if (!(x)) __debugbreak()
#endif
#define DEB 1
int q1(const vi& items, int a, int b, int c)
{
#if DEB
assert(a < b);
assert(b < c);
#endif
if (items[a] > items[b] && items[a] > items[c]) return a;
if (items[b] > items[a] && items[b] > items[c]) return b;
if (items[c] > items[b] && items[c] > items[a]) return c;
}
int q2(const vi& items, int a, int b, int c)
{
#if DEB
assert(a < b);
assert(b < c);
#endif
if (items[a] < items[b] && items[a] < items[c]) return a;
if (items[b] < items[a] && items[b] < items[c]) return b;
if (items[c] < items[b] && items[c] < items[a]) return c;
}
int q3(const vi& items, int a, int b, int c)
{
#if DEB
assert(a < b);
assert(b < c);
#endif
vector<p2> v;
v.emplace_back(items[a], a);
v.emplace_back(items[b], b);
v.emplace_back(items[c], c);
sort(all(v));
return v[1].second;
}
int q4(const vi& items, int a, int b, int c, int d)
{
#if DEB
assert(a < b);
assert(b < c);
assert(c < d);
#endif
vector<p2> heavier;
if (items[a] > items[d]) heavier.emplace_back(items[a], a);
if (items[b] > items[d]) heavier.emplace_back(items[b], b);
if (items[c] > items[d]) heavier.emplace_back(items[c], c);
if (sz(heavier))
{
sort(all(heavier));
return heavier[0].second;
}
else
{
return q2(items, a, b, c);
}
}
uniform_int_distribution<int> adist(0, 3);
uniform_int_distribution<int> ndist(0, 5);
mt19937 rng(10);
pair<int, vi> getmove(const vvi& possible)
{
while (1) {
int move = adist(rng);
if (move == 0)
{
int a, b, c;
a = ndist(rng);
b = ndist(rng);
while (b == a) b = ndist(rng);
c = ndist(rng);
while (c == b || c == a) c = ndist(rng);
vi s = { a,b,c };
sort(all(s));
a = s[0];
b = s[1];
c = s[2];
int tot = 0;
rep(resp, 3)
{
int newsz = 0;
repe(p, possible)
{
if (q1(p, a, b, c) == s[resp])
{
newsz++;
}
}
tot = max(tot, newsz);
}
return { tot,{0,a,b,c} };
}
if (move == 1)
{
int a, b, c;
a = ndist(rng);
b = ndist(rng);
while (b == a) b = ndist(rng);
c = ndist(rng);
while (c == b || c == a) c = ndist(rng);
vi s = { a,b,c };
sort(all(s));
a = s[0];
b = s[1];
c = s[2];
int tot = 0;
rep(resp, 3)
{
int newsz = 0;
repe(p, possible)
{
if (q2(p, a, b, c) == s[resp])
{
newsz++;
}
}
tot = max(tot, newsz);
}
return { tot,{1,a,b,c} };
}
if (move == 2)
{
int a, b, c;
a = ndist(rng);
b = ndist(rng);
while (b == a) b = ndist(rng);
c = ndist(rng);
while (c == b || c == a) c = ndist(rng);
vi s = { a,b,c };
sort(all(s));
a = s[0];
b = s[1];
c = s[2];
int tot = 0;
rep(resp, 3)
{
int newsz = 0;
repe(p, possible)
{
if (q3(p, a, b, c) == s[resp])
{
newsz++;
}
}
tot = max(tot, newsz);
}
return { tot,{2,a,b,c} };
}
else
{
int a, b, c, d;
a = ndist(rng);
b = ndist(rng);
while (b == a) b = ndist(rng);
c = ndist(rng);
while (c == b || c == a) c = ndist(rng);
d = ndist(rng);
while (d == a || d == b || d == c) d = ndist(rng);
vi s = { a,b,c, d };
sort(all(s));
a = s[0];
b = s[1];
c = s[2];
d = s[3];
int tot = 0;
rep(resp, 3)
{
int newsz = 0;
repe(p, possible)
{
if (q4(p, a, b, c, d) == s[resp])
{
newsz++;
}
}
tot = max(tot, newsz);
}
return { tot,{3,a,b,c, d} };
}
}
}
void init(int T) {
vvi possible;
vi order = { 1,2,3,4,5,6 };
do
{
possible.push_back(order);
} while (next_permutation(order.begin(),order.end()));
auto start = chrono::high_resolution_clock::now();
vi bestquery;
int bestval = 10000;
//while (chrono::duration_cast<chrono::milliseconds>(chrono::high_resolution_clock::now() - start).count() < 500)
rep(i, 10)
{
int v;
vi q;
tie(v, q) = getmove(possible);
if (v<bestval)
{
bestval = v;
bestquery = q;
}
}
cout << "";
}
void orderCoins() {
vvi possible;
vi order = { 1,2,3,4,5,6 };
do
{
possible.push_back(order);
} while (next_permutation(order.begin(), order.end()));
vvi newp;
int resp = getHeaviest(1, 2, 6) - 1;
repe(p, possible)
{
if (q1(p, 0, 1, 5) == resp)
{
newp.push_back(p);
}
}
possible = newp;
int rounds = 0;
while (sz(possible)>1)
{
vi bestquery;
int bestval = 10000;
rep(i, 1100)
{
int v;
vi q;
tie(v, q) = getmove(possible);
if (v < bestval)
{
bestval = v;
bestquery = q;
}
}
rounds++;
if (bestquery[0] == 0)
{
vvi newp;
int resp = getHeaviest(bestquery[1]+1, bestquery[2]+1, bestquery[3]+1)-1;
repe(p, possible)
{
if (q1(p, bestquery[1],bestquery[2],bestquery[3])==resp)
{
newp.push_back(p);
}
}
possible = newp;
}
else if (bestquery[0] == 1)
{
vvi newp;
int resp = getLightest(bestquery[1] + 1, bestquery[2] + 1, bestquery[3] + 1) - 1;
repe(p, possible)
{
if (q2(p, bestquery[1], bestquery[2], bestquery[3]) == resp)
{
newp.push_back(p);
}
}
possible = newp;
}
else if (bestquery[0] == 2)
{
vvi newp;
int resp = getMedian(bestquery[1] + 1, bestquery[2] + 1, bestquery[3] + 1) - 1;
repe(p, possible)
{
if (q3(p, bestquery[1], bestquery[2], bestquery[3]) == resp)
{
newp.push_back(p);
}
}
possible = newp;
}
else if (bestquery[0] == 3)
{
vvi newp;
int resp = getNextLightest(bestquery[1] + 1, bestquery[2] + 1, bestquery[3] + 1, bestquery[4] + 1) - 1;
repe(p, possible)
{
if (q4(p, bestquery[1], bestquery[2], bestquery[3], bestquery[4]) == resp)
{
newp.push_back(p);
}
}
possible = newp;
}
else assert(0);
}
cerr << "rounds: " << rounds << "\n";
vi p = possible[0];
int W[] = { 0,
0,
0,
0,
0,
0};
rep(i, 6) W[p[i]-1] = i + 1;
answer(W);
}
컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||