제출 #171009

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
171009		dndhk	popa (BOI18_popa)	C++14	0 / 100	14 ms	324 KiB

popa

#include <bits/stdc++.h>
#include "popa.h"
#define all(v) (v).begin(), (v).end()
#define sortv(v) sort(all(v))
#define uniqv(v) (v).erase(unique(all(v)), (v).end())
#define pb push_back
#define FI first
#define SE second
#define lb lower_bound
#define ub upper_bound
#define mp make_pair
#define test 1
#define TEST if(test)

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

const int MOD = 1000000007; // 998244353
const int INF = 2e9;
const ll INFLL = 1e18;
const int MAX_N = 1;


int solve(int N, int* Left, int* Right){
	int r = 0;
	Left[0] = Right[0] = -1;
	for(int i=1; i<N; i++){
		Left[i] = Right[i] = -1;
		int t = query(0, i, i, i);
		if(t==1){
			Left[i] = r;
			r = i;
		}else{
			Right[i-1] = i;
		}
	}
	return r;
}

• Subtask 1: 0 / 37
• Subtask 2: 0 / 24
• Subtask 3: 0 / 39