oj.uz

Submission #977987

# Submission time Handle Problem Language Result Execution time Memory
977987 2024-05-08T15:28:42 Z Isam Global Warming (CEOI18_glo) C++17
25 / 100
 2000 ms 7080 KB 
#include<bits/stdc++.h>
using namespace std;

#define eb emplace_back
#define intt long long

constexpr int sz = 2e5 + 5;
constexpr intt inf = (intt)1E18 + 7;

int n, x, t[sz];

struct Node{
	intt sm;
	
} st[sz << 2], lazy[sz << 2];

Node operator+(Node i, Node j){
	return Node{i.sm + j.sm};
}

inline void build(int in, int l, int r){
	if(l == r){
		st[in].sm = t[l];
		return;
	}
	int mid = l + ((r - l) >> 1);
	build(in << 1, l, mid);
	build(in << 1 | 1, mid + 1, r);
	st[in] = st[in << 1] + st[in << 1 | 1];
	return;
}

Node zro;

inline void relax(int in, int l, int r){
	if(l ^ r){
		lazy[in << 1].sm += lazy[in].sm;
		lazy[in << 1 | 1].sm += lazy[in].sm;
	}
	st[in].sm += lazy[in].sm * (r - l + 1);
	lazy[in] = zro;
	return;
}

inline void update(int in, int l, int r, int L, int R, int val){
	if(lazy[in].sm != zro.sm) relax(in, l, r);
	if(l > R || r < L || l > r) return;
	if(l >= L && r <= R){
		lazy[in].sm += val;
		relax(in, l, r);
		return;
	}
	int mid = l + ((r - l) >> 1);
	update(in << 1, l, mid, L, R, val);
	update(in << 1 | 1, mid + 1, r, L, R, val);
	st[in] = st[in << 1] + st[in << 1 | 1];
	return;
}

Node get_ans(int l, int  r, int in, int L, int R){
	if(lazy[in].sm != zro.sm) relax(in, l, r);
	if(l > R || r < L || r < l) return zro;	
	if(l >= L && r <= R) return st[in];
	int mid = l + ((r - l) >> 1);
	return get_ans(l, mid, in << 1, L, R) + get_ans(mid + 1, r, in << 1 | 1, L, R);
}

inline int lis(vector<intt> const& a) {
    
	int N = a.size();
	
	vector<intt> d(N+1, inf);
    
	d[0] = -inf;

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

    int ans = 0;
    for (int l = 0; l <= N; l++) {
        if (d[l] < inf)
            ans = l;
    }
    return ans;
}


signed main(){
	ios_base::sync_with_stdio(0), cin.tie(0);
	
	cin >> n >> x;
	
	for(register int i = 1; i <= n; ++i){
		cin >> t[i];
	}
	
	if(x == 0){
		vector<intt> b;
		for(register int i = 1; i <= n; ++i){
			b.eb(t[i]);
		}
		return cout << lis(b) << '\n', 0;
	}
	
	build(1, 1, n);
	
	int ans(1);
	
	for(register intt ad = -x; ad <= x; ++ad){
		for(register int l = 1; l <= n; ++l){
			for(register int r = l + 1; r <= n; ++r){
				
				update(1, 1, n, l, r, ad);
				
				vector<intt> a;
				
				for(register int i = 1; i <= n; ++i) a.emplace_back(get_ans(1, n, 1, i, i).sm);
				
				ans = max(ans, lis(a));
				
				
				
				
				
				update(1, 1, n, l, r, -ad);
			}
		}
	}
	
	cout << ans << '\n';
	
}

Compilation message

glo.cpp: In function 'int main()':
glo.cpp:96:19: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   96 |  for(register int i = 1; i <= n; ++i){
      |                   ^
glo.cpp:102:20: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
  102 |   for(register int i = 1; i <= n; ++i){
      |                    ^
glo.cpp:112:20: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
  112 |  for(register intt ad = -x; ad <= x; ++ad){
      |                    ^~
glo.cpp:113:20: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
  113 |   for(register int l = 1; l <= n; ++l){
      |                    ^
glo.cpp:114:21: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
  114 |    for(register int r = l + 1; r <= n; ++r){
      |                     ^
glo.cpp:120:22: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
  120 |     for(register int i = 1; i <= n; ++i) a.emplace_back(get_ans(1, n, 1, i, i).sm);
      |                      ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 1 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 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 0 ms 348 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 1 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 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 0 ms 348 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 113 ms 2496 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 361 ms 2500 KB Output is correct
15 Correct 146 ms 2496 KB Output is correct
16 Correct 158 ms 2500 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 2 ms 2396 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 1 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 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 0 ms 348 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 113 ms 2496 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 361 ms 2500 KB Output is correct
15 Correct 146 ms 2496 KB Output is correct
16 Correct 158 ms 2500 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 2 ms 2396 KB Output is correct
19 Execution timed out 2061 ms 2556 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 4304 KB Output is correct
2 Correct 33 ms 6340 KB Output is correct
3 Correct 29 ms 6356 KB Output is correct
4 Correct 29 ms 6344 KB Output is correct
5 Correct 22 ms 5512 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2033 ms 5924 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 2004 ms 7080 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 2392 KB Output is correct
2 Correct 1 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 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 0 ms 348 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 113 ms 2496 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 361 ms 2500 KB Output is correct
15 Correct 146 ms 2496 KB Output is correct
16 Correct 158 ms 2500 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 2 ms 2396 KB Output is correct
19 Execution timed out 2061 ms 2556 KB Time limit exceeded
20 Halted 0 ms 0 KB -