# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
851436 | Andrei | Xylophone (JOI18_xylophone) | C++17 | 65 ms | 1464 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>
using namespace std;
int a[5005];
int b[5005];
int diff1[5005];
int diff2[5005];
bool same[5005];
bool bigger[5005];
int query(int s,int t);
void answer(int i,int v);
void solve(int n)
{
if(n==2)
{
answer(1,1);
answer(2,2);
return;
}
for(int i=1; i<n; i++)
diff1[i]=query(i,i+1);
for(int i=1; i<n-1; i++)
diff2[i]=query(i,i+2);
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... |