# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
676458 | vjudge1 | Cake (CEOI14_cake) | C++17 | 2093 ms | 17096 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;
typedef pair<int,int> pii;
int n,q,a,d[300005],where[300005];
set<pii> s;
void compute()
{
where[a]=1;
int st=a-1;
int dr=a+1;
int cnt=1;
while(st>0||dr<=n)
{
cnt++;
if(d[st]<d[dr])
{
where[st]=cnt;
st--;
}
else
{
where[dr]=cnt;
dr++;
}
}
}
int main()
{
ios_base::sync_with_stdio(false);
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |