oj.uz

Submission #971535

# Submission time Handle Problem Language Result Execution time Memory
971535 2024-04-28T19:08:27 Z CyberCow The short shank; Redemption (BOI21_prison) C++17
10 / 100
 47 ms 14164 KB 
#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 = 500010;

int a[N], lr[N];
int han[N];
int ans[N];
int achqisjoga[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;
            achqisjoga[se.top().first]++;
            achqisjoga[i]--;
            ans[se.top().first]++;
            obshi++;
        }
    }
    int ma = 0, qaq = 0;
    for (int i = 1; i <= n; i++)
    {
        qaq += achqisjoga[i];
        ma = max(ma, qaq);
    }
    cout << obshi - ma;
}

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

Compilation message

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

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8536 KB Output is correct
2 Incorrect 2 ms 8540 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 47 ms 12116 KB Output is correct
3 Correct 45 ms 12888 KB Output is correct
4 Correct 39 ms 11860 KB Output is correct
5 Correct 38 ms 12060 KB Output is correct
6 Correct 38 ms 13904 KB Output is correct
7 Correct 38 ms 14092 KB Output is correct
8 Correct 41 ms 14164 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8536 KB Output is correct
2 Incorrect 2 ms 8540 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8536 KB Output is correct
2 Incorrect 8 ms 9052 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8536 KB Output is correct
2 Incorrect 2 ms 8540 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8536 KB Output is correct
2 Incorrect 2 ms 8540 KB Output isn't correct
3 Halted 0 ms 0 KB -