Submission #1085640

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1085640	2024-09-08T14:00:14 Z	vjudge1	Global Warming (CEOI18_glo)	C++17	38 / 100	2000 ms	1760 KB

glo

#include <bits/stdc++.h>
 
using namespace std;

int n, x;
int t[200005];

int LIS() {
    vector<int> rez;
    for (int i=0;i<n;i++) {
        auto it=lower_bound(rez.begin(), rez.end(), t[i]);
        if (it==rez.end())
            rez.push_back(t[i]);
        else *it=t[i];
    }
    return rez.size();
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> x;
    for (int i=0;i<n;i++)
        cin >> t[i];
    if (x==0) {
        cout << LIS();
    }
    else {
        int rez=LIS();
        for (int i=0;i<n;i++) {
            t[i]-=x;
            rez=max(rez, LIS());
        }
        cout << rez;
    }
 
    return 0;
}

Subtask #1

5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	400 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	420 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct

Subtask #2

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	400 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	420 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct

Subtask #3

13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	400 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	420 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	8 ms	348 KB	Output is correct
20	Correct	7 ms	348 KB	Output is correct
21	Correct	7 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	8 ms	492 KB	Output is correct
24	Correct	10 ms	344 KB	Output is correct
25	Correct	7 ms	344 KB	Output is correct
26	Correct	7 ms	348 KB	Output is correct

Subtask #4

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	22 ms	1116 KB	Output is correct
2	Correct	23 ms	1128 KB	Output is correct
3	Correct	22 ms	1116 KB	Output is correct
4	Correct	23 ms	1116 KB	Output is correct
5	Correct	14 ms	1760 KB	Output is correct

Subtask #5

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	2059 ms	604 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #6

0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	2057 ms	860 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #7

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	400 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	420 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	8 ms	348 KB	Output is correct
20	Correct	7 ms	348 KB	Output is correct
21	Correct	7 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	8 ms	492 KB	Output is correct
24	Correct	10 ms	344 KB	Output is correct
25	Correct	7 ms	344 KB	Output is correct
26	Correct	7 ms	348 KB	Output is correct
27	Correct	22 ms	1116 KB	Output is correct
28	Correct	23 ms	1128 KB	Output is correct
29	Correct	22 ms	1116 KB	Output is correct
30	Correct	23 ms	1116 KB	Output is correct
31	Correct	14 ms	1760 KB	Output is correct
32	Execution timed out	2059 ms	604 KB	Time limit exceeded
33	Halted	0 ms	0 KB	-