# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
447406 | prvocislo | The short shank; Redemption (BOI21_prison) | C++17 | 425 ms | 133796 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int N, D, T;
cin >> N >> D >> T;
vector<pair<int, int> > stk;
vector<int> t(N), d(N), ch(N, -1);
vector<vector<int> > g(N);
int maxi = -1, ans = N;
for (int i = 0; i < N; i++)
{
cin >> t[i];
int ti = T + i - t[i];
maxi = max(maxi, ti);
if (!stk.empty()) stk.back().second = max(stk.back().second, ti);
if (t[i] > T)
{
if (i > maxi) ans--;
else // novy pasivny zlocinec
{
d[i] = 1;
while (!stk.empty() && i > stk.back().second)
{
int j = stk.back().first, val = stk.back().second;
stk.pop_back();
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |