# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
782896 | NothingXD | 저울 (IOI15_scales) | C++17 | 1 ms | 468 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "scales.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef complex<ld> point;
void debug_out(){cerr << endl;}
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T){
cerr << H << ' ';
debug_out(T...);
}
#define debug(...) cerr << "(" << #__VA_ARGS__ << "): ", debug_out(__VA_ARGS__)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define MP(x, y) make_pair(x, y)
vector<int> a, b, c;
int ans[6];
void init(int T) {
// khob alan chikar konam
}
void sort(vector<int> &v){
int x = getLightest(v[0], v[1], v[2]);
int y = getMedian(v[0], v[1], v[2]);
int z;
for (int i = 0; i < 3; i++){
if (v[i] != x && v[i] != y) z = v[i];
}
v.clear();
v.push_back(x);
v.push_back(y);
v.push_back(z);
}
vector<int> addin2(int x, int y, int z){
vector<int> res;
int tmp = getMedian(x, y, z);
if (tmp == x){
res.push_back(z);
res.push_back(x);
res.push_back(y);
}
else if (tmp == z){
res.push_back(x);
res.push_back(z);
res.push_back(y);
}
else{
res.push_back(x);
res.push_back(y);
res.push_back(z);
}
return res;
}
vector<int> addin3(int x, int y, int z, int a){
vector<int> res;
int tmp = getHeaviest(y, z, a);
if (tmp == a){
res.push_back(x);
res.push_back(y);
res.push_back(z);
res.push_back(a);
return res;
}
tmp = getNextLightest(x, y, z, a);
if (tmp == x) res.push_back(a);
res.push_back(x);
if (tmp == y) res.push_back(a);
res.push_back(y);
if (tmp == z) res.push_back(a);
res.push_back(z);
return res;
}
vector<int> addin4(vector<int> v, int x){
vector<int> res;
int tmp = getHeaviest(v[1], v[2], x);
if (tmp == x){
res.push_back(v[0]);
res.push_back(v[1]);
res.push_back(v[2]);
tmp = getMedian(v[2], v[3], x);
if (tmp == x){
res.push_back(x);
res.push_back(v[3]);
}
else{
res.push_back(v[3]);
res.push_back(x);
}
}
else{
res = addin2(v[0], v[1], x);
res.push_back(v[2]);
res.push_back(v[3]);
}
return res;
}
vector<int> addin5(vector<int> v, int x){
vector<int> res;
int tmp = getHeaviest(v[1], v[2], x);
if (tmp == x){
res.push_back(v[0]);
res.push_back(v[1]);
res.push_back(v[2]);
vector<int> tmp2 = addin2(v[3], v[4], x);
for (auto x: tmp2){
res.push_back(x);
}
}
else{
res = addin2(v[0], v[1], x);
res.push_back(v[2]);
res.push_back(v[3]);
res.push_back(v[4]);
}
return res;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void orderCoins() {
c.push_back(1);
c.push_back(2);
c.push_back(3);
sort(c);
c = addin3(c[0], c[1], c[2], 4);
c = addin4(c, 5);
c = addin5(c, 6);
int ans[6];
for (int i = 0; i < 6; i++) ans[i] = c[i];
answer(ans);
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |