# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
791626 | Sohsoh84 | 라멘 (JOI14_ramen) | C++17 | 0 ms | 0 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 "ramen.h"
#include <bits/stdc++.h>
using namespace std;
void Ramen(int N) {
vector<int> mn_poss, mx_poss;
for (int i = 0; i < N - 1; i += 2) {
if (Compare(i, i + 1) == 1) {
mn_poss.push_back(i + 1);
mx_poss.push_back(i);
} else {
mn_poss.push_back(i);
mx_poss.push_back(i + 1);
}
}
if (N & 1) {
mn_poss.push_back(N - 1);
mx_poss.push_back(N - 1);
}
int best_mx = mx_poss.front();
for (int e : mx_poss) {
if (e == mx_poss.front()) continue;
if (Compare(e, best_mx) == 1)
best_mx = e;
}
int best_mn = mn_poss.front();
for (int e : mn_poss)
if (e == mn_poss.front()) continue;
if (Compare(best_mn, e) == 1)
best_mn = e;
Answer(best_mn, best_mx);
}