Submission #139313

#TimeUsernameProblemLanguageResultExecution timeMemory
139313rzbtXylophone (JOI18_xylophone)C++14
0 / 100
2 ms376 KiB
#include <bits/stdc++.h> #pragma GCC optimize ("O3") #include "xylophone.h" using namespace std; #define MAXN 5003 int niz[MAXN]; void solve(int n) { niz[1]=1; niz[2]=1+query(1,2); niz[n]=n; for(int i=3;i<n;i++){ int x=query(i-2,i); int y=query(i-1,i); if(x==y && x==abs(niz[i-2]-niz[i-1]))niz[i]=2*niz[i-1]-niz[i-2]; else if(x==abs(niz[i-1]-niz[i-2])){ if(niz[i-2]<niz[i-1])niz[i]=niz[i-1]-y; else niz[i]=niz[i-1]+y; }else{ if(niz[i-2]<niz[i-1])niz[i]=niz[i-1]+y; else niz[i]=niz[i-1]-y; } } for(int i=1;i<=n;i++)answer(i,niz[i]); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...