Submission #1164647

#	Time	Username	Problem	Language	Result	Execution time	Memory
1164647		hynmj	Rabbit Carrot (LMIO19_triusis)	C++20	14 / 100	1 ms	328 KiB

triusis

//~~~~~~~~~~~~~MJ®™~~~~~~~~~~~~~
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#define rep1(n) for(ll i=0; i<(ll)(n); ++i)
#define rep2(i,n) for(ll i=0; i<(ll)(n); ++i)
#define rep3(i,a,b) for(ll i=(ll)(a); i<(ll)(b); ++i)
#define rep4(i,a,b,c) for(ll i=(ll)(a); i<(ll)(b); i+=(c))
#define cut4(a,b,c,d,e,...) e
#define rep(...) cut4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)
#define per1(n) for(ll i=((ll)n)-1; i>=0; --i)
#define per2(i,n) for(ll i=((ll)n)-1; i>=0; --i)
#define per3(i,a,b) for(ll i=((ll)a)-1; i>=(ll)(b); --i)
#define per4(i,a,b,c) for(ll i=((ll)a)-1; i>=(ll)(b); i-=(c))
#define per(...) cut4(__VA_ARGS__,per4,per3,per2,per1)(__VA_ARGS__)
#define ll long long
#define ln cout<<endl
#define int long long
#define vv vector<vi>
#define vp vector<pi>
#define append push_back
#define all(x) (x).begin(),(x).end()
#define allr(x) (x).rbegin(),(x).rend()
#define vi vector<int>
#define ret(x) {cout<<x;return;}
#define ui map<int,int>
#define pi pair<int,int>
#define ff first
#define ss second
using namespace std;
const int INF = 1e18, MOD = 1e9+7, N = 2e5+7;
int n, k, e, m, ans = INF;
int a[11];
int b[11];

bool works(int m)
{
    rep(11)a[i]=b[i];
    for (int i=1;i<=n;i++)
    {
        if (m&(1<<(i-1)))
        {
            // cout << "doing at i " << i << endl; 
            a[i]=a[i-1]+k;           
        }
    }
    
    for (int i=1;i<=n;i++)
    {
        if (a[i]>a[i-1]+k)
        {
            return false;
        }
        // else cout << a[i]  << " is not greater than " << a[i-1]+k << endl;
    }
    // rep(n+1) cout << a[i] << " ";
    // ln;
    return true;
}
void solve()
{
    cin >> n >> k;
    // vi a(11);
    // cout << n << " " << k << endl;
    rep(n)
    {
    	cin >> b[i+1];
    }
    // sort(b, b+n);
    for (int i=0; i<1025;i++)
    {
        if (works(i))
        {
            // cout << i << " " << works(i)<< endl;
            // if (__builtin_popcount(i)<ans )
            // {
            //     cout << i << " " << __builtin_popcount(i) << endl;
            // }
            ans = min(ans,(ll)__builtin_popcount(i));
        }
    }
    cout << (ans== INF ? -1 : ans);ln;
    // cout << 1024 << " " << works(1024)<< endl;

    






     // cout << ans;
    // cout << a.size();
    // for (auto i: a){cout << i << " ";}
}
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL); cout.tie(NULL);
    int ans=1;
    //cout<<setprecision(1000);
    // cin>>ans;
    rep(ans){
        // cout << "Case #" << i+1 << ": ";
        solve();ln;}}

• Subtask 1: 14 / 14
• Subtask 2: 0 / 21
• Subtask 3: 0 / 28
• Subtask 4: 0 / 37