답안 #876054

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
876054	2023-11-21T07:31:17 Z	tinnhiemnn	Rabbit Carrot (LMIO19_triusis)	C++14	14 / 100	2 ms	2496 KB

triusis

#include <bits/stdc++.h>
using namespace std;
#define file "file"
const long long N=2e5+5;
long long n,M,i,j,res,b[N],f[N];
int main()
{
    //freopen(file".inp", "r", stdin);
    //freopen(file".out", "w", stdout);
    ios_base::sync_with_stdio(); cin.tie();

    cin>>n>>M;
    for (i=1;i<=n;i++)
    {
        cin>>j; b[i]=M*i-j;
    }

    for (i=1;i<=n;i++)
    {
        if (b[i]>=f[res]) {res++; f[res]=b[i]; continue;}

        j=upper_bound(f+1, f+res+1, b[i]) - f;
        f[j]=b[i];
    }

    cout<<n-res;
}

Subtask #1

14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	0 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	0 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	0 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2492 KB	Output is correct
12	Correct	1 ms	2404 KB	Output is correct
13	Correct	1 ms	2496 KB	Output is correct
14	Correct	0 ms	2396 KB	Output is correct
15	Correct	0 ms	2392 KB	Output is correct
16	Correct	0 ms	2488 KB	Output is correct

Subtask #2

0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	0 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	0 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	0 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2492 KB	Output is correct
12	Correct	1 ms	2404 KB	Output is correct
13	Correct	1 ms	2496 KB	Output is correct
14	Correct	0 ms	2396 KB	Output is correct
15	Correct	0 ms	2392 KB	Output is correct
16	Correct	0 ms	2488 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	0 ms	2396 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	1 ms	2396 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	1 ms	2496 KB	Output is correct
25	Correct	2 ms	2392 KB	Output is correct
26	Correct	1 ms	2396 KB	Output is correct
27	Incorrect	2 ms	2396 KB	Output isn't correct
28	Halted	0 ms	0 KB	-

Subtask #3

0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	0 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2496 KB	Output is correct
9	Correct	2 ms	2392 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Incorrect	2 ms	2396 KB	Output isn't correct
12	Halted	0 ms	0 KB	-

Subtask #4

0 / 37.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	0 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2496 KB	Output is correct
9	Correct	2 ms	2392 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Incorrect	2 ms	2396 KB	Output isn't correct
12	Halted	0 ms	0 KB	-