제출 #298810

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
298810		eggag32	List of Unique Integers (FXCUP4_unique)	C++17	100 / 100	1 ms	640 KiB

unique

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include "unique.h"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl
#define debug2(x, y) debug(x), debug(y)
#define repn(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(i, a) for(int i = 0; i < (int)(a); i++)
#define all(v) v.begin(), v.end() 
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define sq(x) ((x) * (x))

template<class T> T gcd(T a, T b){ return ((b == 0) ? a : gcd(b, a % b)); }

vi PickUnique(int n){
	vi l(n, 0), r(n, 0);
	rep(i, n) l[i] = UniqueCount(0, i);
	for(int i = n - 1; i >= 0; i--) r[i] = UniqueCount(i, n - 1);
	vi ans(n, 0);
	rep(i, n){
		if(!i) ans[i] = (r[i] > r[i + 1]);
		else if(i == (n - 1)) ans[i] = (l[i] > l[i - 1]);
		else ans[i] = ((l[i] > l[i - 1]) && (r[i] > r[i + 1]));
	}
	return ans;
}

• Subtask 1: 100 / 100