#include <bits/stdc++.h>
#include "unique.h"
using namespace std;
vector<int> PickUnique(int N){
vector<int> ans(N);
int prevL=0, prevR=UniqueCount(0,N-1);
for (int i=0; i<=N-1; i++){
int newL = UniqueCount(0,i);
int newR;
if (i!=N-1) newR = UniqueCount(i+1,N-1);
else newR = UniqueCount(0,N-1);
if (newL == prevL+1 && newR == prevR-1) ans[i]=1;
else ans[i] = 0;
prevL = newL;
prevR = newR;
}
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
256 KB |
Correct : C = 5 |
2 |
Correct |
4 ms |
384 KB |
Correct : C = 11 |
3 |
Correct |
4 ms |
384 KB |
Correct : C = 51 |
4 |
Incorrect |
5 ms |
384 KB |
Wrong |
5 |
Halted |
0 ms |
0 KB |
- |