oj.uz

Submission #887504

# Submission time Handle Problem Language Result Execution time Memory
887504 2023-12-14T16:34:29 Z Ahmed57 Team Contest (JOI22_team) C++17
100 / 100
 1224 ms 114928 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
long long seg1[1800001],seg2[1800001];
pair<long long,long long> seg3[1800001],seg4[1800001];

void build(int p,int l,int r){
	seg1[p] = seg2[p] = -1e9;
	seg3[p] = {-1e9,-1e9};
	seg4[p] = {-1e9,-1e9};
    if(l==r){
        return ;
    }
    int md = (l+r)/2;
    build(p*2,l,md);build(p*2+1,md+1,r);
}
void update1(int p,int l,int r,int idx,long long val){
	if(l==r){
		seg1[p] = max(seg1[p],val);
		return ;
	}
	int md = (l+r)/2;
	if(idx<=md)update1(p*2,l,md,idx,val);
	else update1(p*2+1,md+1,r,idx,val);
	seg1[p] = max(seg1[p*2],seg1[p*2+1]);
}void update2(int p,int l,int r,int idx,long long val){
	if(l==r){
		seg2[p] = max(seg2[p],val);
		return ;
	}
	int md = (l+r)/2;
	if(idx<=md)update2(p*2,l,md,idx,val);
	else update2(p*2+1,md+1,r,idx,val);
	seg2[p] = max(seg2[p*2],seg2[p*2+1]);
}void update3(int p,int l,int r,int idx,long long val2,long long val){
	if(l==r){
		seg3[p] = max(seg3[p],make_pair(val,val+val2));
		return ;
	}
	int md = (l+r)/2;
	if(idx<=md)update3(p*2,l,md,idx,val2,val);
	else update3(p*2+1,md+1,r,idx,val2,val);
	seg3[p] = max(seg3[p*2],seg3[p*2+1]);
}void update4(int p,int l,int r,int idx,long long val2,long long val){
	if(l==r){
		seg4[p] = max(seg4[p],make_pair(val,val+val2));
		return ;
	}
	int md = (l+r)/2;
	if(idx<=md)update4(p*2,l,md,idx,val2,val);
	else update4(p*2+1,md+1,r,idx,val2,val);
	seg4[p] = max(seg4[p*2],seg4[p*2+1]);
}
long long query1(int p,int l,int r,int lq,int rq){
	if(r<lq||l>rq||lq>rq)return -1e9;
    if(l>=lq&&r<=rq)return seg1[p];
    int md = (l+r)/2;
    return max(query1(p*2,l,md,lq,rq),query1(p*2+1,md+1,r,lq,rq));
}long long query2(int p,int l,int r,int lq,int rq){
	if(r<lq||l>rq||lq>rq)return -1e9;
    if(l>=lq&&r<=rq)return seg2[p];
    int md = (l+r)/2;
    return max(query2(p*2,l,md,lq,rq),query2(p*2+1,md+1,r,lq,rq));
}long long query3(int p,int l,int r,int lq,int rq,int limit){
	if(r<lq||l>rq||lq>rq)return -1e9;
    if(l>=lq&&r<=rq){
    	if(seg3[p].first>limit)return seg3[p].second;
    	else return -1e9;
    }
    int md = (l+r)/2;
    return max(query3(p*2,l,md,lq,rq,limit),query3(p*2+1,md+1,r,lq,rq,limit));
}long long query4(int p,int l,int r,int lq,int rq,int limit){
	if(r<lq||l>rq||lq>rq)return -1e9;
    if(l>=lq&&r<=rq){
    	if(seg4[p].first>limit)return seg4[p].second;
    	else return -1e9;
    }
    int md = (l+r)/2;
    return max(query4(p*2,l,md,lq,rq,limit),query4(p*2+1,md+1,r,lq,rq,limit));
}
signed main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	int n;
	cin>>n;
	vector<array<long long,3>> v;
	map<int,int> mp,sav;
	for(int i = 0;i<n;i++){
		long long a,b,c;cin>>a>>b>>c;
		v.push_back({a,b,c});
		mp[a]++;
		mp[b]++;
		mp[c]++;
	}
	int cnt = 0;
	for(auto i:mp){
		sav[i.first] = ++cnt;
	}
	sort(v.begin(),v.end());
	int ind = 0;
	long long ans = -1e9;
	build(1,1,cnt);
	for(int i = 0;i<n;i++){
        while(v[ind][0]<v[i][0]){
            {//taking first as max
                long long val = query1(1,1,cnt,1,sav[v[ind][1]]-1);
                if(val>v[ind][2]){
                	update3(1,1,cnt,sav[v[ind][1]],v[ind][1],val);
                }
            }
            {
                long long val = query2(1,1,cnt,1,sav[v[ind][2]]-1);
                if(val>v[ind][1]){
                	update4(1,1,cnt,sav[v[ind][2]],v[ind][2],val);
                }
            }
            update1(1,1,cnt,sav[v[ind][1]],v[ind][2]);
            update2(1,1,cnt,sav[v[ind][2]],v[ind][1]);
            ind++;
        }
        ans = max(ans,v[i][0]+max(query3(1,1,cnt,sav[v[i][1]]+1,cnt,v[i][2]),query4(1,1,cnt,sav[v[i][2]]+1,cnt,v[i][1])));
	}
	cout<<(ans<0?-1:ans)<<endl;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6620 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6608 KB Output is correct
9 Correct 1 ms 6492 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 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6748 KB Output is correct
15 Correct 1 ms 6488 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6488 KB Output is correct
19 Correct 1 ms 6744 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6636 KB Output is correct
23 Correct 1 ms 6492 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct
25 Correct 1 ms 6488 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6620 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6608 KB Output is correct
9 Correct 1 ms 6492 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 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6748 KB Output is correct
15 Correct 1 ms 6488 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6488 KB Output is correct
19 Correct 1 ms 6744 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6636 KB Output is correct
23 Correct 1 ms 6492 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct
25 Correct 1 ms 6488 KB Output is correct
26 Correct 14 ms 10328 KB Output is correct
27 Correct 11 ms 9820 KB Output is correct
28 Correct 12 ms 9912 KB Output is correct
29 Correct 9 ms 9712 KB Output is correct
30 Correct 6 ms 7256 KB Output is correct
31 Correct 7 ms 7004 KB Output is correct
32 Correct 5 ms 6748 KB Output is correct
33 Correct 4 ms 7260 KB Output is correct
34 Correct 10 ms 10332 KB Output is correct
35 Correct 2 ms 6488 KB Output is correct
36 Correct 2 ms 6692 KB Output is correct
37 Correct 4 ms 6748 KB Output is correct
38 Correct 4 ms 7004 KB Output is correct
39 Correct 2 ms 6492 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 54 ms 11968 KB Output is correct
12 Correct 35 ms 9668 KB Output is correct
13 Correct 38 ms 10192 KB Output is correct
14 Correct 50 ms 12728 KB Output is correct
15 Correct 40 ms 11712 KB Output is correct
16 Correct 30 ms 11720 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 54 ms 11968 KB Output is correct
12 Correct 35 ms 9668 KB Output is correct
13 Correct 38 ms 10192 KB Output is correct
14 Correct 50 ms 12728 KB Output is correct
15 Correct 40 ms 11712 KB Output is correct
16 Correct 30 ms 11720 KB Output is correct
17 Correct 1 ms 6744 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 1 ms 6488 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 81 ms 12104 KB Output is correct
23 Correct 75 ms 11900 KB Output is correct
24 Correct 52 ms 9820 KB Output is correct
25 Correct 74 ms 12736 KB Output is correct
26 Correct 44 ms 11196 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 54 ms 11968 KB Output is correct
12 Correct 35 ms 9668 KB Output is correct
13 Correct 38 ms 10192 KB Output is correct
14 Correct 50 ms 12728 KB Output is correct
15 Correct 40 ms 11712 KB Output is correct
16 Correct 30 ms 11720 KB Output is correct
17 Correct 1 ms 6744 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 1 ms 6488 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 81 ms 12104 KB Output is correct
23 Correct 75 ms 11900 KB Output is correct
24 Correct 52 ms 9820 KB Output is correct
25 Correct 74 ms 12736 KB Output is correct
26 Correct 44 ms 11196 KB Output is correct
27 Correct 1 ms 6492 KB Output is correct
28 Correct 1 ms 6492 KB Output is correct
29 Correct 1 ms 6492 KB Output is correct
30 Correct 1 ms 6492 KB Output is correct
31 Correct 5 ms 6744 KB Output is correct
32 Correct 2 ms 6492 KB Output is correct
33 Correct 2 ms 6492 KB Output is correct
34 Correct 167 ms 12996 KB Output is correct
35 Correct 139 ms 12208 KB Output is correct
36 Correct 150 ms 11556 KB Output is correct
37 Correct 123 ms 11808 KB Output is correct
38 Correct 70 ms 13044 KB Output is correct
39 Correct 36 ms 9416 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 54 ms 11968 KB Output is correct
12 Correct 35 ms 9668 KB Output is correct
13 Correct 38 ms 10192 KB Output is correct
14 Correct 50 ms 12728 KB Output is correct
15 Correct 40 ms 11712 KB Output is correct
16 Correct 30 ms 11720 KB Output is correct
17 Correct 1 ms 6744 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 1 ms 6488 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 81 ms 12104 KB Output is correct
23 Correct 75 ms 11900 KB Output is correct
24 Correct 52 ms 9820 KB Output is correct
25 Correct 74 ms 12736 KB Output is correct
26 Correct 44 ms 11196 KB Output is correct
27 Correct 1 ms 6492 KB Output is correct
28 Correct 1 ms 6492 KB Output is correct
29 Correct 1 ms 6492 KB Output is correct
30 Correct 1 ms 6492 KB Output is correct
31 Correct 5 ms 6744 KB Output is correct
32 Correct 2 ms 6492 KB Output is correct
33 Correct 2 ms 6492 KB Output is correct
34 Correct 167 ms 12996 KB Output is correct
35 Correct 139 ms 12208 KB Output is correct
36 Correct 150 ms 11556 KB Output is correct
37 Correct 123 ms 11808 KB Output is correct
38 Correct 70 ms 13044 KB Output is correct
39 Correct 36 ms 9416 KB Output is correct
40 Correct 6 ms 7000 KB Output is correct
41 Correct 8 ms 6744 KB Output is correct
42 Correct 4 ms 6748 KB Output is correct
43 Correct 5 ms 6744 KB Output is correct
44 Correct 308 ms 14064 KB Output is correct
45 Correct 226 ms 12992 KB Output is correct
46 Correct 250 ms 12796 KB Output is correct
47 Correct 222 ms 13808 KB Output is correct
48 Correct 89 ms 13256 KB Output is correct

Subtask #7
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6620 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6608 KB Output is correct
9 Correct 1 ms 6492 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 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6748 KB Output is correct
15 Correct 1 ms 6488 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6488 KB Output is correct
19 Correct 1 ms 6744 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6636 KB Output is correct
23 Correct 1 ms 6492 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct
25 Correct 1 ms 6488 KB Output is correct
26 Correct 14 ms 10328 KB Output is correct
27 Correct 11 ms 9820 KB Output is correct
28 Correct 12 ms 9912 KB Output is correct
29 Correct 9 ms 9712 KB Output is correct
30 Correct 6 ms 7256 KB Output is correct
31 Correct 7 ms 7004 KB Output is correct
32 Correct 5 ms 6748 KB Output is correct
33 Correct 4 ms 7260 KB Output is correct
34 Correct 10 ms 10332 KB Output is correct
35 Correct 2 ms 6488 KB Output is correct
36 Correct 2 ms 6692 KB Output is correct
37 Correct 4 ms 6748 KB Output is correct
38 Correct 4 ms 7004 KB Output is correct
39 Correct 2 ms 6492 KB Output is correct
40 Correct 1 ms 6492 KB Output is correct
41 Correct 1 ms 6492 KB Output is correct
42 Correct 1 ms 6492 KB Output is correct
43 Correct 1 ms 6492 KB Output is correct
44 Correct 1 ms 6492 KB Output is correct
45 Correct 1 ms 6492 KB Output is correct
46 Correct 1 ms 6492 KB Output is correct
47 Correct 1 ms 6492 KB Output is correct
48 Correct 1 ms 6492 KB Output is correct
49 Correct 1 ms 6492 KB Output is correct
50 Correct 54 ms 11968 KB Output is correct
51 Correct 35 ms 9668 KB Output is correct
52 Correct 38 ms 10192 KB Output is correct
53 Correct 50 ms 12728 KB Output is correct
54 Correct 40 ms 11712 KB Output is correct
55 Correct 30 ms 11720 KB Output is correct
56 Correct 1 ms 6744 KB Output is correct
57 Correct 1 ms 6492 KB Output is correct
58 Correct 1 ms 6492 KB Output is correct
59 Correct 1 ms 6488 KB Output is correct
60 Correct 2 ms 6492 KB Output is correct
61 Correct 81 ms 12104 KB Output is correct
62 Correct 75 ms 11900 KB Output is correct
63 Correct 52 ms 9820 KB Output is correct
64 Correct 74 ms 12736 KB Output is correct
65 Correct 44 ms 11196 KB Output is correct
66 Correct 1 ms 6492 KB Output is correct
67 Correct 1 ms 6492 KB Output is correct
68 Correct 1 ms 6492 KB Output is correct
69 Correct 1 ms 6492 KB Output is correct
70 Correct 5 ms 6744 KB Output is correct
71 Correct 2 ms 6492 KB Output is correct
72 Correct 2 ms 6492 KB Output is correct
73 Correct 167 ms 12996 KB Output is correct
74 Correct 139 ms 12208 KB Output is correct
75 Correct 150 ms 11556 KB Output is correct
76 Correct 123 ms 11808 KB Output is correct
77 Correct 70 ms 13044 KB Output is correct
78 Correct 36 ms 9416 KB Output is correct
79 Correct 6 ms 7000 KB Output is correct
80 Correct 8 ms 6744 KB Output is correct
81 Correct 4 ms 6748 KB Output is correct
82 Correct 5 ms 6744 KB Output is correct
83 Correct 308 ms 14064 KB Output is correct
84 Correct 226 ms 12992 KB Output is correct
85 Correct 250 ms 12796 KB Output is correct
86 Correct 222 ms 13808 KB Output is correct
87 Correct 89 ms 13256 KB Output is correct
88 Correct 1224 ms 114928 KB Output is correct
89 Correct 705 ms 68920 KB Output is correct
90 Correct 927 ms 94724 KB Output is correct
91 Correct 555 ms 64660 KB Output is correct
92 Correct 409 ms 21528 KB Output is correct
93 Correct 535 ms 54520 KB Output is correct
94 Correct 389 ms 34756 KB Output is correct
95 Correct 179 ms 38888 KB Output is correct
96 Correct 585 ms 113368 KB Output is correct
97 Correct 43 ms 11672 KB Output is correct
98 Correct 206 ms 22256 KB Output is correct
99 Correct 225 ms 22256 KB Output is correct