oj.uz

답안 #1039341

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1039341 2024-07-30T18:38:28 Z MeGustaElArroz23 popa (BOI18_popa) C++17
37 / 100
 179 ms 424 KB 
    #include "popa.h"
    #include<bits/stdc++.h>
    using namespace std;
    int tole[1005],tori[1005];
    int calc(int le, int ri)
    {
        if(le>ri)
            return -1;
        if(le==ri)
        {
            tole[le]=tori[le]=-1;
            return le;
        }
        for(int root=le;root<=ri;root++)
        {
            if(query(root,root,le,ri))
            {
                tole[root] = calc(le,root-1);
                tori[root] = calc(root+1,ri);
                return root;
            }
        }
    }
	
    int solve(int N, int* Left, int* Right)
    {
        for(int i=0;i<N;i++)
            tole[i]=tori[i]=-1;
        int root = calc(0,N-1);
        for(int i=0;i<N;i++)
        {
            Left[i]=tole[i];
            Right[i]=tori[i];
        }
        return root;
    }

	void test(int N) {
        int* Left = new int[N];
        int* Right = new int[N];

        int root = solve(N, Left, Right);
        cout << "Root: " << root << endl;

        for (int i = 0; i < N; i++) {
            cout << Left[i] << " " << Right[i] << endl;
        }
    }

Compilation message

popa.cpp: In function 'int calc(int, int)':
popa.cpp:23:5: warning: control reaches end of non-void function [-Wreturn-type]
   23 |     }
      |     ^

Subtask #1
37.0 / 37.0

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

Subtask #2
0 / 24.0

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

Subtask #3
0 / 39.0

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