oj.uz

답안 #61945

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
61945 2018-07-27T06:01:44 Z 윤교준(#1798) popa (BOI18_popa) C++11
0 / 100
 45 ms 476 KB 
#include "popa.h"
#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define sz(V) ((int)(V).size())
#define allv(V) ((V).begin()),((V).end())
#define sorv(V) sort(allv(V))
#define revv(V) reverse(allv(V))
#define univ(V) (V).erase(unique(allv(V)),(V).end())
#define befv(V) ((V)[sz(V)-2])
#define clv(V) (V).clear()
#define upmin(a,b) (a)=min((a),(b))
#define upmax(a,b) (a)=max((a),(b))
#define INF (0x3f3f3f3f)
#define INFLL (0x3f3f3f3f3f3f3f3fll)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

const int MAXN = 1005;

static vector<int> G[MAXN];

static int N;

int solve(int N, int *_L, int *_R) {
	::N = N;

	vector<int> V(1, 0);
	for(int i = 1; i < N; i++) {
		int j = sz(V)-1;
		for(; 0 <= j && query(V[j], i, i, i); j--);
		for(; j+2 < sz(V);) {
			G[befv(V)].eb(V.back());
			V.pop_back();
		}
		if(sz(V)-1 == j) V.eb(i);
		else {
			G[i].eb(V.back());
			V.back() = i;
		}
	}
	for(int i = 1; i < sz(V); i++) G[V[i-1]].eb(V[i]);

	for(int i = 0; i < N; i++) {
		_L[i] = _R[i] = -1;
		for(int v : G[i]) {
			if(v < i) _L[i] = v;
			else _R[i] = v;
		}
	}
	return V[0];
}

Subtask #1
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 248 KB not a binary tree
2 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 23 ms 436 KB not a binary tree
2 Halted 0 ms 0 KB -

Subtask #3
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 45 ms 476 KB not a binary tree
2 Halted 0 ms 0 KB -