# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
549887 | Hanksburger | Xylophone (JOI18_xylophone) | C++17 | 97 ms | 416 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 "xylophone.h"
#include <bits/stdc++.h>
using namespace std;
int a[5005];
void solve(int n)
{
a[2]=query(1, 2);
for (int i=3; i<=n; i++)
{
int res1=query(i-1, i), res2=query(i-2, i);
if (res1==res2)
{
if (a[i-2]<a[i-1])
a[i]=a[i-1]-res1;
else
a[i]=a[i-1]+res1;
}
else
{
if (a[i-2]<a[i-1])
{
if (res2==a[i-1]-a[i-2])
a[i]=a[i-1]-res1;
else
a[i]=a[i-1]+res1;
}
else
{
if (res2==a[i-2]-a[i-1])
a[i]=a[i-1]+res1;
else
a[i]=a[i-1]-res1;
}
}
}
int maxi=0, pos1, posn;
for (int i=1; i<=n; i++)
maxi=max(maxi, a[i]);
for (int i=1; i<=n; i++)
a[i]+=n-maxi;
for (int i=1; i<=n; i++)
{
if (a[i]==1)
pos1=i;
else if (a[i]==n)
posn=i;
}
if (pos1>posn)
for (int i=1; i<=n; i++)
a[i]=n-a[i]+1;
for (int i=1; i<=n; i++)
answer(i, a[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... |