oj.uz

Submission #572012

# Submission time Handle Problem Language Result Execution time Memory
572012 2022-06-03T09:18:57 Z zaneyu List of Unique Integers (FXCUP4_unique) C++17
100 / 100
 1 ms 472 KB 
#include "unique.h"
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long,null_type,less_equal<long long>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll maxn=5e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-6;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?"\n":"");
    return out;
}
std::vector<int> PickUnique(int n){
	int pv=0;
	vector<int> ok(n,1);
	REP(i,n){
		int z=UniqueCount(0,i);
		if(z!=pv+1) ok[i]=0;
		pv=z;
	}
	pv=0;
	for(int i=n-1;i>=0;i--){
		int z=UniqueCount(i,n-1);
		if(z!=pv+1) ok[i]=0;
		pv=z;
	}
	return ok;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 324 KB Correct : C = 4
2 Correct 0 ms 212 KB Correct : C = 10
3 Correct 0 ms 316 KB Correct : C = 50
4 Correct 1 ms 340 KB Correct : C = 100
5 Correct 0 ms 340 KB Correct : C = 100
6 Correct 1 ms 316 KB Correct : C = 154
7 Correct 1 ms 340 KB Correct : C = 200
8 Correct 1 ms 340 KB Correct : C = 300
9 Correct 1 ms 468 KB Correct : C = 356
10 Correct 1 ms 468 KB Correct : C = 400
11 Correct 1 ms 468 KB Correct : C = 400
12 Correct 0 ms 468 KB Correct : C = 400
13 Correct 1 ms 428 KB Correct : C = 400
14 Correct 1 ms 472 KB Correct : C = 400
15 Correct 1 ms 468 KB Correct : C = 400