제출 #1332961

#제출 시각아이디문제언어결과실행 시간메모리
1332961trandkList of Unique Integers (FXCUP4_unique)C++17
100 / 100
1 ms580 KiB
#include "unique.h"
#include <stdio.h>
#include <stdlib.h>
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iostream>
using namespace __gnu_pbds;
using namespace std;
#define for1(i, n) for(int i=1; i<=n; i++)
#define for0(i, n) for(int i=0; i<n; i++)
#define mnto(a, b) a = min(a, (__typeof__(a))b)
#define mxto(a, b) a = max(a, (__typeof__(a))b)
#define sz(a) (int)a.size();
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define arint vector<int>
#define arll vector<ll>
#define arpii vector<pii>
#define arpll vector<pll>
#define arpil vector<pil>
#define arpli vector<pli>
#define arbool vector<bool>
#define archar vector<char>
#define matint vector<arint>
#define matll vector<arll>
#define matpii vector<arpii>
#define matpll vector<arpll>
#define matpil vector<arpil>
#define matpli vector<arpli>
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define FAST_IO cin.tie(0), ios_base::sync_with_stdio(0);
#define INF 1000000001
#define MAXN 200005
#define MOD 1000000007

arint PickUnique(int N) {
	arint isu(N, 1);
	int cnt = 0;
	for0(i, N){
		int _cnt = UniqueCount(0, i);
		if(_cnt <= cnt)
			isu[i] = 0;
		cnt = _cnt;
	}
	
	cnt = 0;
	for(int i=N-1; i>=0; i--){
		int _cnt = UniqueCount(i, N-1);
		if(_cnt <= cnt)
			isu[i] = 0;
		cnt = _cnt;
	}
	return isu;
}
#Verdict Execution timeMemoryGrader output
Fetching results...