#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a))
#define MEM_1(a) memset((a),-1,sizeof(a))
#define ALL(a) a.begin(),a.end()
#define COMPRESS(a) sort(ALL(a));a.resize(unique(ALL(a))-a.begin())
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<db, db> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const int MOD = 1000000007;
ll POW(ll a, ll b, ll MMM=MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
int ddx[]={2,2,-2,-2,1,1,-1,-1},ddy[]={1,-1,1,-1,2,-2,2,-2};
#include <unique.h>
Vi PickUnique(int N){
Vi L(N),R(N),ans(N);
fup(i,0,N-1,1){
L[i]=UniqueCount(0,i);
R[i]=UniqueCount(i,N-1);
}
if(R[0]==R[1]+1)ans[0]=1;
if(L[N-1]==L[N-2]+1)ans[N-1]=1;
fup(i,1,N-2,1){
if(L[i]==L[i-1]+1 && R[i]==R[i+1]+1)ans[i]=1;
}
return ans;
}
/*
int main() {
}*/
Compilation message
unique.cpp: In function 'Vi PickUnique(int)':
unique.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
| ^
unique.cpp:46:2: note: in expansion of macro 'fup'
46 | fup(i,0,N-1,1){
| ^~~
unique.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
| ^
unique.cpp:52:2: note: in expansion of macro 'fup'
52 | fup(i,1,N-2,1){
| ^~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Correct : C = 4 |
2 |
Correct |
0 ms |
364 KB |
Correct : C = 10 |
3 |
Correct |
0 ms |
364 KB |
Correct : C = 50 |
4 |
Correct |
0 ms |
364 KB |
Correct : C = 100 |
5 |
Correct |
1 ms |
364 KB |
Correct : C = 100 |
6 |
Correct |
1 ms |
364 KB |
Correct : C = 154 |
7 |
Correct |
1 ms |
364 KB |
Correct : C = 200 |
8 |
Correct |
1 ms |
492 KB |
Correct : C = 300 |
9 |
Correct |
1 ms |
492 KB |
Correct : C = 356 |
10 |
Correct |
1 ms |
492 KB |
Correct : C = 400 |
11 |
Correct |
1 ms |
492 KB |
Correct : C = 400 |
12 |
Correct |
1 ms |
492 KB |
Correct : C = 400 |
13 |
Correct |
1 ms |
492 KB |
Correct : C = 400 |
14 |
Correct |
1 ms |
492 KB |
Correct : C = 400 |
15 |
Correct |
1 ms |
492 KB |
Correct : C = 400 |