| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 433478 | Tangent | 저울 (IOI15_scales) | C++17 | 43 ms | 564 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "scales.h"
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vii;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vii> vvii;
typedef vector<vll> vvll;
typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;
#define ffor(i, a, b) for (ll i = (a); i < (ll)(b); i++)
#define fford(i, a, b) for (ll i = (a); i > (ll)(b); i--)
#define rep(i, n) ffor(i, 0, n)
#define forin(x, a) for (auto &x: a)
#define all(a) a.begin(), a.end()
inline int gm(int A, int B, int C) {
if (B < A && A < C)
return 0;
if (C < A && A < B)
return 0;
if (A < B && B < C)
return 1;
if (C < B && B < A)
return 1;
return 2;
}
inline int gh(int A, int B, int C) {
if (A > B && A > C)
return 0;
if (B > A && B > C)
return 1;
return 2;
}
inline int gl(int A, int B, int C) {
if (A < B && A < C)
return 0;
if (B < A && B < C)
return 1;
return 2;
}
inline int gnl(int A, int B, int C, int D) {
int allLess = 1;
if (A > D || B > D || C > D)
allLess = 0;
if (allLess == 1) {
if (A < B && A < C)
return 0;
if (B < A && B < C)
return 1;
return 2;
}
if (A > D) {
if ((A < B || B < D) && (A < C || C < D))
return 0;
}
if (B > D) {
if ((B < A || A < D) && (B < C || C < D))
return 1;
}
return 2;
}
const vvii combis = {{0, 1, 2}, {0, 1, 3}, {0, 1, 4}, {0, 1, 5}, {0, 2, 3}, {0, 2, 4}, {0, 2, 5}, {0, 3, 4}, {0, 3, 5}, {0, 4, 5}, {1, 2, 3}, {1, 2, 4}, {1, 2, 5}, {1, 3, 4}, {1, 3, 5}, {1, 4, 5}, {2, 3, 4}, {2, 3, 5}, {2, 4, 5}, {3, 4, 5}};
vii cc(1100), tt(1100);
map<int, vii> res;
bool search(vvii &curr, int idx = 1) {
if (curr.size() <= 1) {
if (curr.size() == 1) {
res[idx] = curr[0];
}
return true;
}
rep(i, combis.size()) {
auto &combi = combis[i];
vector<vvii> groups(3);
forin(p, curr) {
groups[gl(p[combi[0]], p[combi[1]], p[combi[2]])].emplace_back(p);
}
int cmax = max(groups[0].size(), max(groups[1].size(), groups[2].size()));
int cmin = min(groups[0].size(), min(groups[1].size(), groups[2].size()));
if (cmax - cmin <= 1) {
cc[idx] = i;
tt[idx] = 0;
if (search(groups[0], 3 * idx - 1) && search(groups[1], 3 * idx) && search(groups[2], 3 * idx + 1)) {
return true;
}
}
groups.assign(3, vvii());
forin(p, curr) {
groups[gm(p[combi[0]], p[combi[1]], p[combi[2]])].emplace_back(p);
}
cmax = max(groups[0].size(), max(groups[1].size(), groups[2].size()));
cmin = min(groups[0].size(), min(groups[1].size(), groups[2].size()));
if (cmax - cmin <= 1) {
cc[idx] = i;
tt[idx] = 1;
if (search(groups[0], 3 * idx - 1) && search(groups[1], 3 * idx) && search(groups[2], 3 * idx + 1)) {
return true;
}
}
groups.assign(3, vvii());
forin(p, curr) {
groups[gh(p[combi[0]], p[combi[1]], p[combi[2]])].emplace_back(p);
}
cmax = max(groups[0].size(), max(groups[1].size(), groups[2].size()));
cmin = min(groups[0].size(), min(groups[1].size(), groups[2].size()));
if (cmax - cmin <= 1) {
cc[idx] = i;
tt[idx] = 2;
if (search(groups[0], 3 * idx - 1) && search(groups[1], 3 * idx) && search(groups[2], 3 * idx + 1)) {
return true;
}
}
groups.assign(3, vvii());
forin(p, curr) {
groups[gnl(p[combi[0]], p[combi[1]], p[combi[2]], p[combis[19 - i][0]])].emplace_back(p);
}
cmax = max(groups[0].size(), max(groups[1].size(), groups[2].size()));
cmin = min(groups[0].size(), min(groups[1].size(), groups[2].size()));
if (cmax - cmin <= 1) {
cc[idx] = i;
tt[idx] = 3;
if (search(groups[0], 3 * idx - 1) && search(groups[1], 3 * idx) && search(groups[2], 3 * idx + 1)) {
return true;
}
}
groups.assign(3, vvii());
forin(p, curr) {
groups[gnl(p[combi[0]], p[combi[1]], p[combi[2]], p[combis[19 - i][1]])].emplace_back(p);
}
cmax = max(groups[0].size(), max(groups[1].size(), groups[2].size()));
cmin = min(groups[0].size(), min(groups[1].size(), groups[2].size()));
if (cmax - cmin <= 1) {
cc[idx] = i;
tt[idx] = 4;
if (search(groups[0], 3 * idx - 1) && search(groups[1], 3 * idx) && search(groups[2], 3 * idx + 1)) {
return true;
}
}
groups.assign(3, vvii());
forin(p, curr) {
groups[gnl(p[combi[0]], p[combi[1]], p[combi[2]], p[combis[19 - i][2]])].emplace_back(p);
}
cmax = max(groups[0].size(), max(groups[1].size(), groups[2].size()));
cmin = min(groups[0].size(), min(groups[1].size(), groups[2].size()));
if (cmax - cmin <= 1) {
cc[idx] = i;
tt[idx] = 5;
if (search(groups[0], 3 * idx - 1) && search(groups[1], 3 * idx) && search(groups[2], 3 * idx + 1)) {
return true;
}
}
}
return false;
}
void init(int T) {
vvii curr;
vii x = {1, 2, 3, 4, 5, 6};
int a = getLightest(1, 2, 3) - 1, b = getHeaviest(4, 5, 6) - 4;
do {
curr.emplace_back(x);
} while(next_permutation(all(x)));
search(curr);
}
void orderCoins() {
int idx = 1;
while (res.find(idx) == res.end()) {
auto combi = combis[cc[idx]];
int bt = tt[idx];
if (bt == 0) {
int ans = getLightest(combi[0] + 1, combi[1] + 1, combi[2] + 1);
if (ans == combi[0] + 1) {
idx = 3 * idx - 1;
} else if (ans == combi[1] + 1) {
idx = 3 * idx;
} else {
idx = 3 * idx + 1;
}
} else if (bt == 1) {
int ans = getMedian(combi[0] + 1, combi[1] + 1, combi[2] + 1);
if (ans == combi[0] + 1) {
idx = 3 * idx - 1;
} else if (ans == combi[1] + 1) {
idx = 3 * idx;
} else {
idx = 3 * idx + 1;
}
} else if (bt == 2) {
int ans = getHeaviest(combi[0] + 1, combi[1] + 1, combi[2] + 1);
if (ans == combi[0] + 1) {
idx = 3 * idx - 1;
} else if (ans == combi[1] + 1) {
idx = 3 * idx;
} else {
idx = 3 * idx + 1;
}
} else {
int d = combis[19 - cc[idx]][bt - 3];
int ans = getNextLightest(combi[0] + 1, combi[1] + 1, combi[2] + 1, d + 1);
if (ans == combi[0] + 1) {
idx = 3 * idx - 1;
} else if (ans == combi[1] + 1) {
idx = 3 * idx;
} else {
idx = 3 * idx + 1;
}
}
}
int res2[] = {0, 0, 0, 0, 0, 0};
rep(i, 6) {
res2[res[idx][i] - 1] = i + 1;
}
answer(res2);
}
컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||