Submission #1089967

#	Time	Username	Problem	Language	Result	Execution time	Memory
1089967		lucri	popa (BOI18_popa)	C++17	0 / 100	1 ms	344 KiB

popa

#include<bits/stdc++.h>
int query(int a,int b,int c,int d);
int t[1010];
void sp(int nod, int* Left, int* Right)
{
    if(nod==-1)
        return;
    sp(Left[nod],Left,Right);
    sp(Right[nod],Left,Right);
    std::swap(Left[nod],Right[nod]);
    return;
}
int solve(int N, int* Left, int* Right)
{
    int n=N;
    for(int i=0;i<n;++i)
    {
        t[i]=-1;
        Left[i]=Right[i]=-1;
    }
    for(int i=0;i+1<n;++i)
    {
        if(query(i,i,i,i+1)==true)
        {
            t[i+1]=i;
            Right[i]=i+1;
        }
        else
        {
            int x=t[i];
            while(t[x]!=-1&&query(x,i+1,i+1,i+1)==true)
                x=t[x];
            if(t[x]==-1)
            {
                Left[i+1]=x;
                t[x]=i+1;
            }
            else
            {
                Right[t[x]]=i+1;
                t[i+1]=t[x];
                t[x]=i+1;
                Left[i+1]=x;
            }
        }
    }
    for(int i=0;i<n;++i)
        if(t[i]==-1)
            return i;
}

Compilation message (stderr)

popa.cpp: In function 'int solve(int, int*, int*)':
popa.cpp:50:1: warning: control reaches end of non-void function [-Wreturn-type]
   50 | }
      | ^

• Subtask 1: 0 / 37
• Subtask 2: 0 / 24
• Subtask 3: 0 / 39