Submission #230928

#TimeUsernameProblemLanguageResultExecution timeMemory
230928kymList of Unique Integers (FXCUP4_unique)C++17
100 / 100
5 ms512 KiB
#ifndef LOCAL #include "unique.h" #endif #include <bits/stdc++.h> #pragma GCC optimize("Ofast") #pragma GCC target("avx,avx2,fma") using namespace std; #define FOR(i,s,e) for(ll i = s; i <= (ll)e; ++i) #define DEC(i,s,e) for(ll i = s; i >= (ll)e; --i) #define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0); #define db(x) cerr << #x << "=" << x << "\n" #define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n" #define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n" #define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n" #define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{" << ite.f << ',' << ite.s << "} "; cerr << "\n" #define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n" mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); #define ll long long #define pb push_back #define all(x) (x).begin(), (x).end() #define f first #define s second #define reach cerr << "LINE: " << __LINE__ << "\n"; typedef pair <ll, ll> pi; typedef tuple<ll,ll,ll> ti3; string cts(char x) {string t(1,x); return t;} ll rand(ll a, ll b) { return a + rng() % (b-a+1); } const int MOD = 1e9 + 7; const int inf = (int)1e9 + 500; const long long oo = (ll)1e18 + 500; template <typename T> void chmax(T& a, T b) { a = max(a, b); } template <typename T> void chmin(T& a, T b) { a = min(a, b); } const int MAXN = -1; #ifndef LOCAL #define cerr if(0)cout #endif int lf[205],rg[205]; int UniqueCount(int R, int C); vector<int> PickUnique(int n) { lf[0]=1; rg[n-1]=1; FOR(i,1,n-1)lf[i]=UniqueCount(0,i); DEC(i,n-2,0)rg[i]=UniqueCount(i,n-1); //dba(lf,0,n-1); //dba(rg,0,n-1); vector<int>v; FOR(i,0,n-1) { if(i==0){ if(rg[0]<=rg[1])v.pb(0); else v.pb(1); } else if(i==n-1) { if(lf[n-1]<=lf[n-2])v.pb(0); else v.pb(1); } else { if(lf[i]<=lf[i-1] || rg[i]<=rg[i+1])v.pb(0); else v.pb(1); } } //dbv(v); return v; }
#Verdict Execution timeMemoryGrader output
Fetching results...