oj.uz

Submission #604781

# Submission time Handle Problem Language Result Execution time Memory
604781 2022-07-25T09:45:18 Z hibiki The short shank; Redemption (BOI21_prison) C++11
0 / 100
 68 ms 9044 KB 
#include<bits/stdc++.h>
using namespace std;

int n, d, t;
int a[2000005], re[2000005];
int ans = 1e9, lst = -1e9, cnt = 0;

priority_queue<int> g;

int main()
{
    scanf("%d %d %d", &n, &d, &t);
    for(int i = 1; i <= n; i++)
    {
        scanf("%d", &a[i]);
        re[i] = re[i - 1];
        if(a[i] <= t) re[i]++, lst = i;
        else if(i - lst <= t) re[i]++;
    }
    lst = n + 1;
    for(int i = n; i > 1; i--)
    {
        if(a[i] <= t)
        {
            cnt++;
            cnt += min(t - a[i], lst - i - 1);
            lst = i;
        }
        ans = min(ans, cnt + re[i - 1]);
    }
    printf("%d\n",ans);
    return 0;
}

Compilation message

prison.cpp: In function 'int main()':
prison.cpp:12:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     scanf("%d %d %d", &n, &d, &t);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
prison.cpp:15:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |         scanf("%d", &a[i]);
      |         ~~~~~^~~~~~~~~~~~~

Subtask #1
0 / 15.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 54 ms 4160 KB Output is correct
3 Correct 68 ms 9044 KB Output is correct
4 Incorrect 50 ms 7572 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 0 ms 212 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 212 KB Output is correct
2 Incorrect 9 ms 852 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

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

Subtask #6
0 / 20.0

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