oj.uz

답안 #1089964

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1089964 2024-09-17T12:46:30 Z lucri popa (BOI18_popa) C++17
37 / 100
 155 ms 428 KB 
#include<bits/stdc++.h>
int query(int a,int b,int c,int d);
int t[1010];
int tata(int nod)
{
    if(t[nod]==-1)
        return nod;
    return tata(t[nod]);
}
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=tata(i);
            while(query(x,i+1,i+1,i+1)==false)
                x=Right[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

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

Subtask #1
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 344 KB Output is correct
2 Correct 18 ms 344 KB Output is correct
3 Correct 7 ms 344 KB Output is correct
4 Correct 18 ms 344 KB Output is correct

Subtask #2
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 155 ms 428 KB too many queries
2 Halted 0 ms 0 KB -

Subtask #3
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 344 KB too many queries
2 Halted 0 ms 0 KB -