oj.uz

Submission #1089913

# Submission time Handle Problem Language Result Execution time Memory
1089913 2024-09-17T11:48:21 Z lucri popa (BOI18_popa) C++17
0 / 100
 5 ms 424 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]==0)
        return nod;
    return tata(t[nod]);
}
int solve(int N, int* Left, int* Right)
{
    int n=N;
    for(int i=0;i<n;++i)
    {
        t[i]=0;
        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);
            t[x]=i+1;
            Left[i+1]=x;
        }
    }
    for(int i=0;i<n;++i)
        if(t[i]==0)
            return i;
    exit(1);
}

Subtask #1
0 / 37.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 344 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 424 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 39.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 344 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -