oj.uz

Submission #604747

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

int n, d, t;
int a[2000005];
int cur = 0, cnt = 0;
int ans = 0;

priority_queue<int> g;

int main()
{
    scanf("%d %d %d", &n, &d, &t);
    for(int i = 0; i < n; i++)
    {
        scanf("%d", &a[i]);
        cur++;
        if(a[i] <= t)
        {
            ans++;
            ans += cnt;
            if(cnt) g.push(cnt);
            cur = a[i];
            cnt = 0;
        }
        else if(cur <= t) cnt++;
    }
    ans += cnt;
    if(cnt) g.push(cnt);
    cnt = 0;
    while(!g.empty() && cnt < d)
    {
        ans -= g.top();
        g.pop();
        cnt++;
    }
    printf("%d\n",ans);
    return 0;
}

Compilation message

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

Subtask #1
0 / 15.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 25.0

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

Subtask #6
0 / 20.0

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