Submission #676223

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
676223	2022-12-29T21:50:18 Z	mseebacher	Global Warming (CEOI18_glo)	C++17	28 / 100	2000 ms	4984 KB

glo

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
#define MAXI (int)1e5
#define pb(x) push_back(x)

vector<int> ad[MAXI];
vector<bool> vis(MAXI,0);
map<pair<int,int>,int> m;

void dfs(int x){
	if(vis[x]) return;
	vis[x] = 1;
	for(auto s:ad[x]){
		dfs(s);
	}
}

int lis(vector<int> const& a) {
    int n = a.size();
    const int INF = 1e9;
    vector<int> d(n+1, INF);
    d[0] = -INF;

    for (int i = 0; i < n; i++) {
        int j = upper_bound(d.begin(), d.end(), a[i]) - d.begin();
        if (d[j-1] < a[i] && a[i] < d[j])
            d[j] = a[i];
    }

    int ans = 0;
    for (int i = 0; i <= n; i++) {
        if (d[i] < INF)
            ans = i;
    }
    return ans;
}

int main(){
	
	int n,x; cin >> n >> x;
	x *=-1;
	int maxi = 0;
	vector<int> a(n,0);
	for(int i = 0;i<n;i++) cin >> a[i];
	
		vector<int> b(a);
		for(int j = 0;j<n;j++){
			b[j] +=x;
			maxi = max(maxi,lis(b));
		}
	cout << maxi;
	return 0;
}

Subtask #1

5.0 / 5.0

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

Subtask #2

10.0 / 10.0

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

Subtask #3

13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	2644 KB	Output is correct
2	Correct	1 ms	2644 KB	Output is correct
3	Correct	1 ms	2644 KB	Output is correct
4	Correct	2 ms	2644 KB	Output is correct
5	Correct	2 ms	2644 KB	Output is correct
6	Correct	1 ms	2644 KB	Output is correct
7	Correct	1 ms	2644 KB	Output is correct
8	Correct	1 ms	2644 KB	Output is correct
9	Correct	2 ms	2644 KB	Output is correct
10	Correct	2 ms	2644 KB	Output is correct
11	Correct	2 ms	2644 KB	Output is correct
12	Correct	2 ms	2596 KB	Output is correct
13	Correct	2 ms	2644 KB	Output is correct
14	Correct	1 ms	2644 KB	Output is correct
15	Correct	2 ms	2644 KB	Output is correct
16	Correct	3 ms	2644 KB	Output is correct
17	Correct	1 ms	2644 KB	Output is correct
18	Correct	2 ms	2644 KB	Output is correct
19	Correct	29 ms	2644 KB	Output is correct
20	Correct	28 ms	2644 KB	Output is correct
21	Correct	27 ms	2660 KB	Output is correct
22	Correct	34 ms	2644 KB	Output is correct
23	Correct	22 ms	2676 KB	Output is correct
24	Correct	26 ms	2668 KB	Output is correct
25	Correct	15 ms	2672 KB	Output is correct
26	Correct	19 ms	2672 KB	Output is correct

Subtask #4

0 / 10.0

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

Subtask #5

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	2053 ms	3356 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	2062 ms	3860 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #7

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	2644 KB	Output is correct
2	Correct	1 ms	2644 KB	Output is correct
3	Correct	1 ms	2644 KB	Output is correct
4	Correct	2 ms	2644 KB	Output is correct
5	Correct	2 ms	2644 KB	Output is correct
6	Correct	1 ms	2644 KB	Output is correct
7	Correct	1 ms	2644 KB	Output is correct
8	Correct	1 ms	2644 KB	Output is correct
9	Correct	2 ms	2644 KB	Output is correct
10	Correct	2 ms	2644 KB	Output is correct
11	Correct	2 ms	2644 KB	Output is correct
12	Correct	2 ms	2596 KB	Output is correct
13	Correct	2 ms	2644 KB	Output is correct
14	Correct	1 ms	2644 KB	Output is correct
15	Correct	2 ms	2644 KB	Output is correct
16	Correct	3 ms	2644 KB	Output is correct
17	Correct	1 ms	2644 KB	Output is correct
18	Correct	2 ms	2644 KB	Output is correct
19	Correct	29 ms	2644 KB	Output is correct
20	Correct	28 ms	2644 KB	Output is correct
21	Correct	27 ms	2660 KB	Output is correct
22	Correct	34 ms	2644 KB	Output is correct
23	Correct	22 ms	2676 KB	Output is correct
24	Correct	26 ms	2668 KB	Output is correct
25	Correct	15 ms	2672 KB	Output is correct
26	Correct	19 ms	2672 KB	Output is correct
27	Execution timed out	2067 ms	4984 KB	Time limit exceeded
28	Halted	0 ms	0 KB	-