oj.uz

Submission #930505

# Submission time Handle Problem Language Result Execution time Memory
930505 2024-02-20T04:23:29 Z Baizho Global Warming (CEOI18_glo) C++14
100 / 100
 220 ms 16324 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
 
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt")
 
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
 
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
 
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(4e5)+5;
const int M = ll(1e4) + 5;
const long long inf = 1e18;
const long double eps = 1e-15L;
 
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
 
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
 
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }

int n, x, a[N], b[N], c[N];

struct segtree {
	int t[N * 4];
	
	void update(int v, int tl, int tr, int p, int x) {
		if(tl == tr) {
			t[v] = x;
			return;
		}
		int tm = (tl + tr) / 2;
		if(p <= tm) update(v + v, tl, tm, p, x);
		else update(v + v + 1, tm + 1, tr, p, x);
		t[v] = max(t[v + v], t[v + v + 1]);
 	}
 	int get(int v, int tl, int tr, int l, int r) {
 		if(tl > r || l > tr) return 0;
 		if(l <= tl && tr <= r) return t[v];
 		int tm = (tl + tr) / 2;
 		return max(get(v + v, tl, tm, l, r), get(v + v + 1, tm + 1, tr, l, r));
	 }
}dp1, dp2;

void Baizho() {
	cin>>n>>x;
	vector<int> comp;
	for(int i = 1; i <= n; i ++) {
		cin>>a[i];
		b[i] = a[i] + x;
		comp.pb(a[i]); comp.pb(b[i]);
	}
	sort(all(comp));
	comp.erase(unique(all(comp)), comp.end());
//	segtree dp1;
	for(int i = 1; i <= n; i ++) {
		a[i] = upper_bound(all(comp), a[i]) - comp.begin();
		b[i] = upper_bound(all(comp), b[i]) - comp.begin();
		int val = dp1.get(1, 1, 2 * n, 1, a[i] - 1) + 1;
		c[i] = val;
		dp1.update(1, 1, 2 * n, a[i], val);
	}
	int ans = dp1.t[1];
//	segtree dp2;
	for(int i = n - 1; i >= 1; i --) {
		int val = dp2.get(1, 1, 2 * n, b[i + 1] + 1, 2 * n) + 1;
		dp2.update(1, 1, 2 * n, b[i + 1], val);
		ans = max(ans, c[i] + dp2.get(1, 1, 2 * n, a[i] + 1, 2 * n));
	}
	int val = dp2.get(1, 1, 2 * n, b[1] + 1, 2 * n) + 1;
	dp2.update(1, 1, 2 * n, b[1], val);
	cout<<max(ans, dp2.t[1])<<"\n";
	
}
 
signed main() {		
// 	Freopen("nondec");
    ios_base::sync_with_stdio(false);   
    cin.tie(0);cout.tie(0); 
//   	precalc();
   	
    int ttt = 1;
//    cin>>ttt;
 
    for(int i=1; i<=ttt; i++) {Baizho(); }
}

Compilation message

glo.cpp: In function 'void Freopen(std::string)':
glo.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
glo.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6488 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 6744 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 2 ms 4444 KB Output is correct
21 Correct 2 ms 4444 KB Output is correct
22 Correct 2 ms 4444 KB Output is correct
23 Correct 1 ms 4696 KB Output is correct
24 Correct 1 ms 4580 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct
26 Correct 2 ms 4444 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 202 ms 11464 KB Output is correct
2 Correct 197 ms 13508 KB Output is correct
3 Correct 203 ms 11428 KB Output is correct
4 Correct 210 ms 11428 KB Output is correct
5 Correct 98 ms 11460 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 7376 KB Output is correct
2 Correct 46 ms 7644 KB Output is correct
3 Correct 46 ms 7640 KB Output is correct
4 Correct 24 ms 7900 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 26 ms 6240 KB Output is correct
7 Correct 39 ms 7132 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 8520 KB Output is correct
2 Correct 97 ms 8548 KB Output is correct
3 Correct 217 ms 14444 KB Output is correct
4 Correct 104 ms 10964 KB Output is correct
5 Correct 68 ms 8328 KB Output is correct
6 Correct 111 ms 13420 KB Output is correct
7 Correct 115 ms 14232 KB Output is correct
8 Correct 82 ms 8424 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6488 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 6744 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 2 ms 4444 KB Output is correct
21 Correct 2 ms 4444 KB Output is correct
22 Correct 2 ms 4444 KB Output is correct
23 Correct 1 ms 4696 KB Output is correct
24 Correct 1 ms 4580 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct
26 Correct 2 ms 4444 KB Output is correct
27 Correct 202 ms 11464 KB Output is correct
28 Correct 197 ms 13508 KB Output is correct
29 Correct 203 ms 11428 KB Output is correct
30 Correct 210 ms 11428 KB Output is correct
31 Correct 98 ms 11460 KB Output is correct
32 Correct 52 ms 7376 KB Output is correct
33 Correct 46 ms 7644 KB Output is correct
34 Correct 46 ms 7640 KB Output is correct
35 Correct 24 ms 7900 KB Output is correct
36 Correct 1 ms 6492 KB Output is correct
37 Correct 26 ms 6240 KB Output is correct
38 Correct 39 ms 7132 KB Output is correct
39 Correct 104 ms 8520 KB Output is correct
40 Correct 97 ms 8548 KB Output is correct
41 Correct 217 ms 14444 KB Output is correct
42 Correct 104 ms 10964 KB Output is correct
43 Correct 68 ms 8328 KB Output is correct
44 Correct 111 ms 13420 KB Output is correct
45 Correct 115 ms 14232 KB Output is correct
46 Correct 82 ms 8424 KB Output is correct
47 Correct 96 ms 10552 KB Output is correct
48 Correct 96 ms 10552 KB Output is correct
49 Correct 220 ms 16324 KB Output is correct
50 Correct 109 ms 11720 KB Output is correct
51 Correct 88 ms 15700 KB Output is correct
52 Correct 125 ms 11648 KB Output is correct
53 Correct 116 ms 13724 KB Output is correct
54 Correct 123 ms 14248 KB Output is correct
55 Correct 173 ms 14996 KB Output is correct