제출 #1056790

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1056790		Zbyszek99	The short shank; Redemption (BOI21_prison)	C++17	0 / 100	2088 ms	2396 KiB

prison

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define size(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace std;
//mt19937 mt;void random(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll rand(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

vector<int> v;
int n,d,t;

int count_f(int l, int r)
{
    int ans = 0;
    int max_end = -1;
    rep2(i,l,r)
    {
        max_end = max(max_end,i + t-v[i]);
   //     if(l == r) cout << max_end << " me\n";
        if(i <= max_end) ans++;
    }
    return ans;
}

void solve()
{
    cin >> n >> d >> t;
    v.resize(n);
    rep(i,n) cin >> v[i];
    int ans = 1e9;
    rep(i,n-1)
    {
     //   cout << count_f(0,i) << " " << count_f(i+1,n-1) << " cout\n";
        ans = min(ans,count_f(0,i) + count_f(i+1,n-1));
    }
    cout << ans << "\n";
}

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random();
    int t = 1;
    //cin >> t;
    while(t--) solve();
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 10
• Subtask 3: 0 / 20
• Subtask 4: 0 / 10
• Subtask 5: 0 / 25
• Subtask 6: 0 / 20