# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1116493 | pedroslrey | Xylophone (JOI18_xylophone) | C++17 | 194 ms | 960 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 "xylophone.h"
using namespace std;
vector<int> to_perm(vector<int> &raw) {
int mini = 1e9;
for (int x: raw)
mini = min(mini, x);
vector<int> ans;
for (int x: raw)
ans.push_back(x - mini + 1);
return ans;
}
void solve(int n) {
vector<int> delta;
for (int i = 1; i < n; ++i)
delta.push_back(query(i, i + 1));
vector<bool> sign{false};
for (int i = 1; i < n - 1; ++i) {
int t = query(i, i + 2);
if (delta[i-1] + delta[i] == t) sign.push_back(sign.back());
else sign.push_back(!sign.back());
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |