oj.uz

답안 #940084

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
940084 2024-03-07T05:24:46 Z vjudge1 Global Warming (CEOI18_glo) C++17
100 / 100
 611 ms 171768 KB 
#include <bits/stdc++.h>
 
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
#define rnd(l, r) uniform_int_distribution<int>(l, r)(rng)
 
using namespace std;

void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);} 
int pow(int a,int b,int m){int ans=1;while(b){if(b&1){ans=(ans*a)%m;}b>>=1;a=(a*a)%m;}return ans;}
int binpow(int a,int b){int ans=1;while(b){if(b&1){ans=(ans*a);}b>>=1;a=(a*a);}return ans;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int inf = 2e9 + 10, N = 2e5 + 100;
 
struct node{
    int mn;
    node *l, *r;
    node(){
        mn = 0;
        l = nullptr;
        r = nullptr;
    }
};
void update(node *&p, int pos, int val, int tl = -inf, int tr = inf){
    if(p == nullptr){
        p = new node();
    }
    if(tl == tr){
        p -> mn = val;
        return;
    }
    int mid = (tl + tr) >> 1;
    if(pos > mid)
        update(p -> r, pos, val, mid + 1, tr);
    else
        update(p -> l, pos, val, tl, mid);
    int left = 0;
    if(p -> l != nullptr)
        left = p -> l -> mn;
    int right = 0;
    if(p -> r != nullptr)
        right = p -> r -> mn;
    p -> mn = max(left, right);
}

int get(node *p, int l, int r, int tl = -inf, int tr = inf){
	if(p == nullptr)return 0;
    if(tl > r || tr < l)
        return 0;
    if(tl >= l && tr <= r)
        return p -> mn;
    int mid = (tl + tr) >> 1;
    return max(get(p -> r, l, r, mid + 1, tr), get(p -> l, l, r, tl, mid));
}
int a[N];
main(){
	iostream::sync_with_stdio(false);	
    cin.tie(nullptr);
    cout.tie(nullptr);
	int n, d;
	cin >> n >> d;
	node *root = new node(), *root2 = new node();
	int ans = 0;
	for(int i = 1 ; i<= n; i++){
		cin >> a[i];
		int j = get(root, 0, a[i] + d - 1);
		int j2 = get(root2, 0, a[i] - 1);
		int x2 = max({get(root2, a[i], a[i]), j + 1, j2 + 1});
		update(root2, a[i], x2);
		//cout << i <<" "<< x2 << endl;
		ans = max(ans, x2);
		
		int g = get(root, 0, a[i] - 1);
		ans = max(g + 1, ans);
		int x = get(root, a[i], a[i]);
		if(x < g + 1)
			update(root, a[i], g + 1);
		
	}
	cout << ans << endl;
}	
/*
 * Before implementing the problem:
	
	Do I understand the problem correctly?
	Which places are tricky? What do I need to remember to implement them correctly?
	Which place is the heaviest by implementation? Can I do it simpler?
	Which place is the slowest? Where do I need to be careful about constant factors and where I can choose slower but simpler implementation?
	----------------------------------
	If not AC:
 
	Did you remember to do everything to handle the tricky places you thought about before?
	Is the solution correct?
	Do I understand the problem correctly?
	----------------------------------
	If you have a test on which the solution gives wrong answer:
 
	Is the solution doing what it was supposed to do?
	Is the problem in the code or in the idea?
*/

Compilation message

glo.cpp:61:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   61 | main(){
      | ^~~~
glo.cpp: In function 'void fp(std::string)':
glo.cpp:13:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
glo.cpp:13:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 472 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 472 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 476 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 472 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 476 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 3 ms 1628 KB Output is correct
20 Correct 3 ms 1628 KB Output is correct
21 Correct 3 ms 1628 KB Output is correct
22 Correct 3 ms 1624 KB Output is correct
23 Correct 2 ms 1112 KB Output is correct
24 Correct 3 ms 1368 KB Output is correct
25 Correct 2 ms 348 KB Output is correct
26 Correct 2 ms 604 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 607 ms 171744 KB Output is correct
2 Correct 584 ms 171768 KB Output is correct
3 Correct 592 ms 171704 KB Output is correct
4 Correct 583 ms 171600 KB Output is correct
5 Correct 300 ms 93368 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 126 ms 49488 KB Output is correct
2 Correct 143 ms 49488 KB Output is correct
3 Correct 131 ms 49448 KB Output is correct
4 Correct 78 ms 26704 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 75 ms 5616 KB Output is correct
7 Correct 107 ms 35368 KB Output is correct

Subtask #6
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 274 ms 92240 KB Output is correct
2 Correct 261 ms 92240 KB Output is correct
3 Correct 567 ms 171764 KB Output is correct
4 Correct 282 ms 93204 KB Output is correct
5 Correct 142 ms 14156 KB Output is correct
6 Correct 253 ms 26792 KB Output is correct
7 Correct 261 ms 27676 KB Output is correct
8 Correct 208 ms 66460 KB Output is correct

Subtask #7
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 472 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 476 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 3 ms 1628 KB Output is correct
20 Correct 3 ms 1628 KB Output is correct
21 Correct 3 ms 1628 KB Output is correct
22 Correct 3 ms 1624 KB Output is correct
23 Correct 2 ms 1112 KB Output is correct
24 Correct 3 ms 1368 KB Output is correct
25 Correct 2 ms 348 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 607 ms 171744 KB Output is correct
28 Correct 584 ms 171768 KB Output is correct
29 Correct 592 ms 171704 KB Output is correct
30 Correct 583 ms 171600 KB Output is correct
31 Correct 300 ms 93368 KB Output is correct
32 Correct 126 ms 49488 KB Output is correct
33 Correct 143 ms 49488 KB Output is correct
34 Correct 131 ms 49448 KB Output is correct
35 Correct 78 ms 26704 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 75 ms 5616 KB Output is correct
38 Correct 107 ms 35368 KB Output is correct
39 Correct 274 ms 92240 KB Output is correct
40 Correct 261 ms 92240 KB Output is correct
41 Correct 567 ms 171764 KB Output is correct
42 Correct 282 ms 93204 KB Output is correct
43 Correct 142 ms 14156 KB Output is correct
44 Correct 253 ms 26792 KB Output is correct
45 Correct 261 ms 27676 KB Output is correct
46 Correct 208 ms 66460 KB Output is correct
47 Correct 267 ms 92172 KB Output is correct
48 Correct 267 ms 92348 KB Output is correct
49 Correct 611 ms 171608 KB Output is correct
50 Correct 314 ms 93320 KB Output is correct
51 Correct 218 ms 14932 KB Output is correct
52 Correct 314 ms 28552 KB Output is correct
53 Correct 269 ms 28240 KB Output is correct
54 Correct 275 ms 28920 KB Output is correct
55 Correct 439 ms 124240 KB Output is correct