# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
502568 | fabijan_cikac | Xylophone (JOI18_xylophone) | C++17 | 116 ms | 1564 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;
void solve(int N){
map<int, map<int, int> > m; vector<pair<int, int> > v;
int a[15000]; bool b = true;
int sol[15000]; m[0][1] = query(1, 2);
for (int i = 2; i < N; ++i){
m[i - 2][i] = query(i - 1, i + 1);
m[i - 1][i] = query(i, i + 1);
}
//a[0] < a[1]
a[0] = 0; a[1] = m[0][1];
for (int i = 2; i < N; ++i){
bool c = false;
for (int j = -1; j <= 1; ++j){
if (j == 0) continue;
a[i] = a[i - 1] + j * m[i - 1][i];
if (max(a[i - 2], max(a[i - 1], a[i])) - min(a[i - 2], min(a[i - 1], a[i])) == m[i - 2][i]){
c = true; break;
}
}
if (!c){
b = false; break;
}
}
for (int i = 0; i < N; ++i)
v.push_back({a[i], i});
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |