#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef pair<ll,ll> pll;
typedef long double ld;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
const int INF=2012345678;
const ll LLINF=4012345678012345678LL;
const ll MOD=1000000007; //998244353; //
const ld PI=3.1415926535898;
const ld EPS=1e-9;
ll gcd(ll a,ll b){if(a<b)swap(a,b);if(b==0)return a;return gcd(b,a%b);}
inline ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
inline ll expo(ll b,ll p,ll m){ll res=1; while(p){if(p&1)res=(res*b)%m; b=(b*b)%m; p>>=1;} return res;}
inline ll modinv(ll a,ll m){return expo(a,m-2,m);}
#include "unique.h"
//int UniqueCount(int R,int C);
std::vector<int> PickUnique(int N) {
int c[N][N];
for(int i=0;i<N;i++){
for(int j=i;j<N;j++){
c[i][j]=UniqueCount(i,j);
}
}
vector<int> ans;
for(int i=0;i<N;i++)ans.pb(1);
for(int i=0;i<N;i++){
if(i>0&&c[0][i-1]>c[0][i]){
ans[i]=0;
}
if(i<N-1&&c[i+1][N-1]>c[i][N-1]){
ans[i]=0;
}
}
return ans;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
256 KB |
Correct : C = 3 |
| 2 |
Correct |
4 ms |
256 KB |
Correct : C = 15 |
| 3 |
Incorrect |
4 ms |
384 KB |
Wrong |
| 4 |
Halted |
0 ms |
0 KB |
- |
