oj.uz

답안 #61995

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
61995 2018-07-27T08:21:24 Z 노영훈(#1796) popa (BOI18_popa) C++11
0 / 100
 18 ms 836 KB 
#include "popa.h"
#include <iostream>
using namespace std;
static const int MX=1010;

int my_q(int x, int l, int r){
    return query(x,x,l,r);
}

static int n;

static int *Lson, *Rson;

static int tree[1<<11];

static int init(int v, int s, int e){
    if(s==e) return tree[v]=s;
    int m=(s+e)/2;
    int l=init(v*2, s, m), r=init(v*2+1, m+1, e);
    if(my_q(l,s,e)){
        tree[v]=l;
        Rson[m]=r;
    }
    else{
        tree[v]=r;
        Lson[m+1]=l;
    }
    // cout<<s<<' '<<e<<": "<<tree[v]<<'\n';
    return tree[v];
}

int solve(int N, int _Lson[], int _Rson[]){
    n=N; Lson=_Lson, Rson=_Rson;
    for(int i=0; i<n; i++) Lson[i]=Rson[i]=-1;
    int root=init(1,0,n-1);
    // for(int i=0; i<n; i++) cout<<Lson[i]<<' ';
    // cout<<'\n';
    // for(int i=0; i<n; i++) cout<<Rson[i]<<' ';
    // cout<<'\n';
    return root;
}

Subtask #1
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 5 ms 632 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 14 ms 832 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 18 ms 836 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -