oj.uz

Submission #885889

# Submission time Handle Problem Language Result Execution time Memory
885889 2023-12-11T01:46:25 Z ByeWorld Team Contest (JOI22_team) C++14
100 / 100
 190 ms 26848 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
#define bupol __builtin_popcount
#define int long long 
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
using namespace std;
const int MAXN = 3e5+20;
const int LOG = 60;
const int MOD = 998244353;
const int SQRT = 520;
const int INF = 1e18;
typedef pair<int,int> pii;
typedef pair<pii,int> ipii;
 
int n;
vector <ipii> vec;
int oz = -INF, oy = -INF; 
set <pii> by, bz; // by --> {y, z}
int ans = -1;

signed main(){
    //ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n;
    for(int i=1; i<=n; i++){
        int x, y, z; cin >> x >> y >> z;
        vec.pb({{x, y}, z});
    }
    vec.pb({{-1, -1}, -1});
    sort(vec.begin(), vec.end());
    //for(auto in : vec) cout << in.fi.fi << ' ' << in.fi.se << ' ' << in.se << " in\n";
    
    for(int i=1,j=1; i<=n; i++){
        while(vec[j].fi.fi < vec[i].fi.fi){
            int x = vec[j].fi.fi; int y = vec[j].fi.se; int z = vec[j].se;
            j++;
            //insert
            if(y<=oy && z<=oz) continue; // gk di insert
            
            if(by.empty()){
                if (y >= oy && z >= oz) {
                    by.insert({y, z}); bz.insert({z, y});
                }
                else if (y > oy) {
                    oy = y;
                }
                else if (z > oz) {
                    oz = z;
                }
                continue;
            }
            
            auto it = by.lower_bound(pii(y, z));
            if(!by.empty() && (*it)==pii(y,z)) continue;
            
        
            if(it == by.begin()){
                if(z < it->se){
                    if (y >= oy && z >= oz) {
                        by.insert({y, z}); bz.insert({z, y});
                    }
                    else if (y > oy) {
                        oy = y;
                    }
                    else if (z > oz) {
                        oz = z;
                    }
                }
                else if(z > it->se){
                    auto nx = bz.lower_bound(pii(z, -1));
                    nx--; //pasti ada
                    oy = (*nx).se; oz = z;
                    
                    auto lst = nx;
                    lst++;
                    auto te = bz.begin();
                    while(true) {
                        by.erase(pii((*te).se, (*te).fi)); 
                        auto te2 = te; te++; 
                        bz.erase(te2); 
                        if(te==lst) break;
                    }
                }
                else{
                    if (y < oy) {
                        oz = z;
                    }
                    else {
                        by.insert({y, z}); bz.insert({z, y});
                    }
                }
                continue;
            }
            
            auto it2 = it; it2--;
            pii bef = (*it2);
            
            if(it == by.end()){
                if(z >= (*it2).se){
                    by.insert({y, z}); bz.insert({z, y});
                } else {
                    oy = y; oz = (*it2).se;
                    by.clear(); bz.clear();
                }
                continue;
            }
            
            if(bef.se > z){
                oy = y; oz = bef.se; 
            
                auto te = by.begin();
                while(true) {
                    bz.erase(pii((*te).se, (*te).fi)); 
                    auto te2 = te; te++; 
                    by.erase(te2); 
                    if(te==it) break;
                }
                
            } else if(bef.se <= z && z <= (*it).se){ //insert
                by.insert({y, z}); bz.insert({z, y});
            } else { // new pair
                auto nx = bz.lower_bound(pii(z, -1));
                nx--; //pasti ada
                oy = (*nx).se; oz = z;
                
                auto lst = nx;
                lst++;
                auto te = bz.begin();
                while(true) {
                    by.erase(pii((*te).se, (*te).fi)); 
                    auto te2 = te; te++; 
                    bz.erase(te2); 
                    if(te==lst) break;
                }
            }
        }
        
        
        int x = vec[i].fi.fi; int y = vec[i].fi.se; int z = vec[i].se;
        
        //for(auto in : by) cout << in.fi << ' ' << in.se << " in\n"; 
        //cout << i << " ii\n";
        if(y<oy && z<oz) ans = max(ans, x+oy+oz);
        
    }
    cout << ans << '\n';
}

Compilation message

team.cpp: In function 'int main()':
team.cpp:41:17: warning: unused variable 'x' [-Wunused-variable]
   41 |             int x = vec[j].fi.fi; int y = vec[j].fi.se; int z = vec[j].se;
      |                 ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 504 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 756 KB Output is correct
6 Correct 0 ms 348 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 756 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 444 KB Output is correct
18 Correct 0 ms 440 KB Output is correct
19 Correct 0 ms 432 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 504 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 756 KB Output is correct
6 Correct 0 ms 348 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 756 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 444 KB Output is correct
18 Correct 0 ms 440 KB Output is correct
19 Correct 0 ms 432 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 6 ms 604 KB Output is correct
27 Correct 4 ms 732 KB Output is correct
28 Correct 4 ms 600 KB Output is correct
29 Correct 4 ms 604 KB Output is correct
30 Correct 2 ms 620 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 4 ms 604 KB Output is correct
33 Correct 3 ms 604 KB Output is correct
34 Correct 5 ms 1136 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 3 ms 860 KB Output is correct
38 Correct 3 ms 860 KB Output is correct
39 Correct 1 ms 348 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 436 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 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 60 ms 9404 KB Output is correct
12 Correct 39 ms 4384 KB Output is correct
13 Correct 45 ms 4084 KB Output is correct
14 Correct 64 ms 8092 KB Output is correct
15 Correct 55 ms 7864 KB Output is correct
16 Correct 52 ms 9404 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 436 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 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 60 ms 9404 KB Output is correct
12 Correct 39 ms 4384 KB Output is correct
13 Correct 45 ms 4084 KB Output is correct
14 Correct 64 ms 8092 KB Output is correct
15 Correct 55 ms 7864 KB Output is correct
16 Correct 52 ms 9404 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 436 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 444 KB Output is correct
22 Correct 70 ms 7920 KB Output is correct
23 Correct 65 ms 8132 KB Output is correct
24 Correct 48 ms 5316 KB Output is correct
25 Correct 68 ms 9592 KB Output is correct
26 Correct 59 ms 8124 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 436 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 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 60 ms 9404 KB Output is correct
12 Correct 39 ms 4384 KB Output is correct
13 Correct 45 ms 4084 KB Output is correct
14 Correct 64 ms 8092 KB Output is correct
15 Correct 55 ms 7864 KB Output is correct
16 Correct 52 ms 9404 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 436 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 444 KB Output is correct
22 Correct 70 ms 7920 KB Output is correct
23 Correct 65 ms 8132 KB Output is correct
24 Correct 48 ms 5316 KB Output is correct
25 Correct 68 ms 9592 KB Output is correct
26 Correct 59 ms 8124 KB Output is correct
27 Correct 0 ms 600 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 2 ms 564 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 77 ms 8644 KB Output is correct
35 Correct 73 ms 8128 KB Output is correct
36 Correct 80 ms 8376 KB Output is correct
37 Correct 82 ms 9152 KB Output is correct
38 Correct 76 ms 9660 KB Output is correct
39 Correct 51 ms 5576 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 436 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 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 60 ms 9404 KB Output is correct
12 Correct 39 ms 4384 KB Output is correct
13 Correct 45 ms 4084 KB Output is correct
14 Correct 64 ms 8092 KB Output is correct
15 Correct 55 ms 7864 KB Output is correct
16 Correct 52 ms 9404 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 436 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 444 KB Output is correct
22 Correct 70 ms 7920 KB Output is correct
23 Correct 65 ms 8132 KB Output is correct
24 Correct 48 ms 5316 KB Output is correct
25 Correct 68 ms 9592 KB Output is correct
26 Correct 59 ms 8124 KB Output is correct
27 Correct 0 ms 600 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 2 ms 564 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 77 ms 8644 KB Output is correct
35 Correct 73 ms 8128 KB Output is correct
36 Correct 80 ms 8376 KB Output is correct
37 Correct 82 ms 9152 KB Output is correct
38 Correct 76 ms 9660 KB Output is correct
39 Correct 51 ms 5576 KB Output is correct
40 Correct 2 ms 604 KB Output is correct
41 Correct 3 ms 572 KB Output is correct
42 Correct 4 ms 860 KB Output is correct
43 Correct 3 ms 860 KB Output is correct
44 Correct 91 ms 9920 KB Output is correct
45 Correct 98 ms 9236 KB Output is correct
46 Correct 105 ms 9664 KB Output is correct
47 Correct 99 ms 9668 KB Output is correct
48 Correct 84 ms 9740 KB Output is correct

Subtask #7
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 504 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 756 KB Output is correct
6 Correct 0 ms 348 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 756 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 444 KB Output is correct
18 Correct 0 ms 440 KB Output is correct
19 Correct 0 ms 432 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 6 ms 604 KB Output is correct
27 Correct 4 ms 732 KB Output is correct
28 Correct 4 ms 600 KB Output is correct
29 Correct 4 ms 604 KB Output is correct
30 Correct 2 ms 620 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 4 ms 604 KB Output is correct
33 Correct 3 ms 604 KB Output is correct
34 Correct 5 ms 1136 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 3 ms 860 KB Output is correct
38 Correct 3 ms 860 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 436 KB Output is correct
44 Correct 0 ms 344 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 60 ms 9404 KB Output is correct
51 Correct 39 ms 4384 KB Output is correct
52 Correct 45 ms 4084 KB Output is correct
53 Correct 64 ms 8092 KB Output is correct
54 Correct 55 ms 7864 KB Output is correct
55 Correct 52 ms 9404 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 0 ms 436 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 1 ms 444 KB Output is correct
61 Correct 70 ms 7920 KB Output is correct
62 Correct 65 ms 8132 KB Output is correct
63 Correct 48 ms 5316 KB Output is correct
64 Correct 68 ms 9592 KB Output is correct
65 Correct 59 ms 8124 KB Output is correct
66 Correct 0 ms 600 KB Output is correct
67 Correct 0 ms 348 KB Output is correct
68 Correct 0 ms 348 KB Output is correct
69 Correct 0 ms 348 KB Output is correct
70 Correct 2 ms 564 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 1 ms 348 KB Output is correct
73 Correct 77 ms 8644 KB Output is correct
74 Correct 73 ms 8128 KB Output is correct
75 Correct 80 ms 8376 KB Output is correct
76 Correct 82 ms 9152 KB Output is correct
77 Correct 76 ms 9660 KB Output is correct
78 Correct 51 ms 5576 KB Output is correct
79 Correct 2 ms 604 KB Output is correct
80 Correct 3 ms 572 KB Output is correct
81 Correct 4 ms 860 KB Output is correct
82 Correct 3 ms 860 KB Output is correct
83 Correct 91 ms 9920 KB Output is correct
84 Correct 98 ms 9236 KB Output is correct
85 Correct 105 ms 9664 KB Output is correct
86 Correct 99 ms 9668 KB Output is correct
87 Correct 84 ms 9740 KB Output is correct
88 Correct 125 ms 11204 KB Output is correct
89 Correct 159 ms 11144 KB Output is correct
90 Correct 128 ms 11960 KB Output is correct
91 Correct 153 ms 11800 KB Output is correct
92 Correct 103 ms 10428 KB Output is correct
93 Correct 130 ms 11260 KB Output is correct
94 Correct 128 ms 11364 KB Output is correct
95 Correct 122 ms 10172 KB Output is correct
96 Correct 190 ms 26848 KB Output is correct
97 Correct 122 ms 11188 KB Output is correct
98 Correct 150 ms 19256 KB Output is correct
99 Correct 152 ms 20464 KB Output is correct