제출 #971530

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

prison

#include <random>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <chrono>
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((x).size())
typedef long long ll;
using ull = unsigned long long;
using namespace std;
mt19937 rnd(348502);
ll mod1 = 998244353;
ll mod = 1e9 + 7;
const ll N = 510;

int a[N], lr[N];
int han[N];
int ans[N];

void solve()
{
    int n, d, k, t;
    cin >> n >> d >> t;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        if (a[i] <= t)
            lr[i] = min(t - a[i] + i, n);
    }
    stack<pair<int, int>> se;
    int obshi = 0;
    for (int i = 1; i <= n; i++)
    {
        se.push({ i, lr[i] });
        while (!se.empty() && se.top().second < i)
        {
            se.pop();
        }
        if (!se.empty())
        {
            han[i] = se.top().first;
            ans[se.top().first]++;
            obshi++;
        }
    }
    int ma = 0;
    for (int i = 1; i <= n; i++)
    {
        ma = max(ma, ans[i]);
    }
    cout << obshi - ma + 1;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int tt = 1;
    //cin >> tt;
    while (tt--) {
        solve();
    }
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

prison.cpp: In function 'void solve()':
prison.cpp:37:15: warning: unused variable 'k' [-Wunused-variable]
   37 |     int n, d, k, t;
      |               ^

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