Submission #246318

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
246318	2020-07-08T16:05:33 Z	Sorting	Global Warming (CEOI18_glo)	C++14	38 / 100	2000 ms	3072 KB

glo

#include <bits/stdc++.h>

using namespace std;

const int k_N = 2e5 + 3;
const int k_Inf = 1e9 + 3;

int n, x;
int t[k_N];

int get_lis(){
    vector<int> dp;
    dp.push_back({-k_Inf});

    for(int i = 0; i < n; ++i){
        auto it = lower_bound(dp.begin(), dp.end(), t[i]);
        if(it == dp.end())
            dp.push_back(t[i]);
        else
            dp[it - dp.begin()] = t[i];    
    }

    return (int)dp.size() - 1;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> x;
    for(int i = 0; i < n; ++i)
        cin >> t[i];

    int ans = 0;
    for(int r = 0; r < n; ++r){
        t[r] -= x;
        ans = max(get_lis(), ans);
        if(!x)
            break;
    }

    cout << ans << "\n";
}

Subtask #1

5.0 / 5.0

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

Subtask #2

10.0 / 10.0

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

Subtask #3

13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	384 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	4 ms	384 KB	Output is correct
7	Correct	4 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	4 ms	384 KB	Output is correct
10	Correct	4 ms	384 KB	Output is correct
11	Correct	4 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	5 ms	384 KB	Output is correct
14	Correct	4 ms	384 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	5 ms	384 KB	Output is correct
18	Correct	5 ms	384 KB	Output is correct
19	Correct	26 ms	384 KB	Output is correct
20	Correct	24 ms	384 KB	Output is correct
21	Correct	30 ms	392 KB	Output is correct
22	Correct	5 ms	384 KB	Output is correct
23	Correct	22 ms	384 KB	Output is correct
24	Correct	21 ms	432 KB	Output is correct
25	Correct	19 ms	384 KB	Output is correct
26	Correct	20 ms	384 KB	Output is correct

Subtask #4

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	46 ms	1152 KB	Output is correct
2	Correct	44 ms	3072 KB	Output is correct
3	Correct	46 ms	3064 KB	Output is correct
4	Correct	46 ms	3064 KB	Output is correct
5	Correct	42 ms	2988 KB	Output is correct

Subtask #5

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	2086 ms	512 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	2088 ms	768 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #7

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	384 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	4 ms	384 KB	Output is correct
7	Correct	4 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	4 ms	384 KB	Output is correct
10	Correct	4 ms	384 KB	Output is correct
11	Correct	4 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	5 ms	384 KB	Output is correct
14	Correct	4 ms	384 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	5 ms	384 KB	Output is correct
18	Correct	5 ms	384 KB	Output is correct
19	Correct	26 ms	384 KB	Output is correct
20	Correct	24 ms	384 KB	Output is correct
21	Correct	30 ms	392 KB	Output is correct
22	Correct	5 ms	384 KB	Output is correct
23	Correct	22 ms	384 KB	Output is correct
24	Correct	21 ms	432 KB	Output is correct
25	Correct	19 ms	384 KB	Output is correct
26	Correct	20 ms	384 KB	Output is correct
27	Correct	46 ms	1152 KB	Output is correct
28	Correct	44 ms	3072 KB	Output is correct
29	Correct	46 ms	3064 KB	Output is correct
30	Correct	46 ms	3064 KB	Output is correct
31	Correct	42 ms	2988 KB	Output is correct
32	Execution timed out	2086 ms	512 KB	Time limit exceeded
33	Halted	0 ms	0 KB	-