oj.uz

Submission #795076

# Submission time Handle Problem Language Result Execution time Memory
795076 2023-07-27T06:01:26 Z vjudge1 Team Contest (JOI22_team) C++17
64 / 100
 2000 ms 9660 KB 

// Author : حسن

#include <bits/stdc++.h>



using namespace std;

#define TL ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define rall(s) s.rbegin(),s.rend()
#define all(s) s.begin(),s.end()
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ld long double
#define YES cout<<"YES\n"
#define Yes cout<<"Yes\n"
#define yes cout<<"yes\n"
#define NO cout<<"NO\n"
#define No cout<<"No\n"
#define no cout<<"no\n"


const int N = 2e5 + 9 , mod = 1e9 + 7;
ll  d[N] = {} , a[N][4] = {},  us[N] , dp[N] = {} , b[309][309][4];

ll get(int i, int j, int k){
    ll mn = 0;
    while(i > 0){
        int x = j;
        while(x > 0){
        mn = max(mn , b[i][x][k]);
        x -= x & (-x);
        }
        i -= (i & (-i));
    }
    return mn;
}
void add(int i , int j , ll y , int k){
    while(i <= 300){
        int x = j;
        while(x <= 300){
        b[i][x][k] = max(b[i][x][k] , y);
        x += (x & -x);
        }
        i += i & (-i);
    }
}

void solve(){
    ll q , i , j , m ,n, z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = -1;
    cin>>n;
    vector<pair<int,pair<int,int>>>v;
    for(i =1; i <= n; i++){
        cin>>a[i][1]>>a[i][2]>>a[i][3] ;
            mx = max({mx , a[i][1] , a[i][2] , a[i][3]});
            v.pb({a[i][1] ,{ a[i][2] , a[i][3]}});
    }
    if(mx <= 300){
        mx = -1;
    for(i = 1; i <= n; i++){
        add(a[i][2] , a[i][3], a[i][1] , 1);
        add(a[i][1] , a[i][3], a[i][2] , 2);
        add(a[i][1] , a[i][2], a[i][3] , 3);
    }
    for(i = 1; i <= 300; i++){
        for(j = 1; j <= 300; j++){
            for(x = 1; x <= 300; x++){
                if(get(j - 1, x - 1 , 1) >= i && get(i - 1 , x - 1 , 2) >= j && get(i - 1 , j - 1 , 3) >= x)
                    mx = max(mx , i + j + x);
            }
        }
    }
    cout<<mx<<"\n";
    }else {
        mx = -1;
        sort(all(v));
        for(i = 0; i < n; i++)
            a[i+  1][1] = v[i].fi , a[i + 1][2] = v[i].se.fi , a[i + 1][3] = v[i].se.se;
        for(i = 1;i  <= n; i++){
            l = i;
            x = 0;
            set<int>st;
            for(j = i + 1; j <= n; j++){
                while(a[j][1] > a[l][1]){
                    if(a[l][2] < a[i][2] && a[l][3] > a[i][3])
                    x = max(x , a[l][3]) , st.insert(a[l][3]);
                    l++;
                }
                if(st.size() && a[i][2] > a[j][2]){
                    auto it = st.end();
                    it--;
                    if(*it > a[j][3]){
                    mx = max(mx , a[i][2] + a[j][1] + *it);
                    }
                }
            }
        }
        for(i = 1;i  <= n; i++){
            l = i;
            x = 0;
            set<int>st;
            for(j = i + 1; j <= n; j++){
                while(a[j][1] > a[l][1]){
                    if(a[l][3] < a[i][3] && a[l][2] > a[i][2])
                    x = max(x , a[l][2]) , st.insert(a[l][2]);
                    l++;
                }
                if(st.size() && a[i][3] > a[j][3]){
                    auto it = st.end();
                    it--;
                    if(*it > a[j][2]){
                    mx = max(mx , a[i][3] + a[j][1] + *it);
                    }
                }
            }
        }
        cout<<mx<<"\n";
    }
}

int main(){

     TL;
     /*
     #ifndef ONLINE_JUDGE
     freopen("input.txt", "r", stdin);
     freopen("output.txt", "w", stdout);
     #endif
     */
int t = 1;
//cin>>t;

while(t--)
     {
     solve();
     }

}
// Author : حسن

Compilation message

team.cpp: In function 'void solve()':
team.cpp:54:8: warning: unused variable 'q' [-Wunused-variable]
   54 |     ll q , i , j , m ,n, z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = -1;
      |        ^
team.cpp:54:20: warning: unused variable 'm' [-Wunused-variable]
   54 |     ll q , i , j , m ,n, z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = -1;
      |                    ^
team.cpp:54:26: warning: unused variable 'z' [-Wunused-variable]
   54 |     ll q , i , j , m ,n, z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = -1;
      |                          ^
team.cpp:54:30: warning: unused variable 's' [-Wunused-variable]
   54 |     ll q , i , j , m ,n, z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = -1;
      |                              ^
team.cpp:54:38: warning: unused variable 'f' [-Wunused-variable]
   54 |     ll q , i , j , m ,n, z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = -1;
      |                                      ^
team.cpp:54:45: warning: unused variable 'r' [-Wunused-variable]
   54 |     ll q , i , j , m ,n, z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = -1;
      |                                             ^
team.cpp:54:49: warning: unused variable 'k' [-Wunused-variable]
   54 |     ll q , i , j , m ,n, z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = -1;
      |                                                 ^
team.cpp:54:57: warning: unused variable 'y' [-Wunused-variable]
   54 |     ll q , i , j , m ,n, z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = -1;
      |                                                         ^
team.cpp:54:61: warning: unused variable 'mn' [-Wunused-variable]
   54 |     ll q , i , j , m ,n, z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = -1;
      |                                                             ^~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 485 ms 468 KB Output is correct
2 Correct 493 ms 468 KB Output is correct
3 Correct 506 ms 428 KB Output is correct
4 Correct 505 ms 460 KB Output is correct
5 Correct 498 ms 432 KB Output is correct
6 Correct 490 ms 440 KB Output is correct
7 Correct 503 ms 436 KB Output is correct
8 Correct 491 ms 436 KB Output is correct
9 Correct 492 ms 448 KB Output is correct
10 Correct 496 ms 428 KB Output is correct
11 Correct 512 ms 412 KB Output is correct
12 Correct 499 ms 472 KB Output is correct
13 Correct 497 ms 468 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 911 ms 2352 KB Output is correct
19 Correct 718 ms 1492 KB Output is correct
20 Correct 503 ms 596 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 587 ms 1364 KB Output is correct
25 Correct 582 ms 1364 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 485 ms 468 KB Output is correct
2 Correct 493 ms 468 KB Output is correct
3 Correct 506 ms 428 KB Output is correct
4 Correct 505 ms 460 KB Output is correct
5 Correct 498 ms 432 KB Output is correct
6 Correct 490 ms 440 KB Output is correct
7 Correct 503 ms 436 KB Output is correct
8 Correct 491 ms 436 KB Output is correct
9 Correct 492 ms 448 KB Output is correct
10 Correct 496 ms 428 KB Output is correct
11 Correct 512 ms 412 KB Output is correct
12 Correct 499 ms 472 KB Output is correct
13 Correct 497 ms 468 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 911 ms 2352 KB Output is correct
19 Correct 718 ms 1492 KB Output is correct
20 Correct 503 ms 596 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 587 ms 1364 KB Output is correct
25 Correct 582 ms 1364 KB Output is correct
26 Correct 468 ms 676 KB Output is correct
27 Correct 403 ms 596 KB Output is correct
28 Correct 327 ms 672 KB Output is correct
29 Correct 213 ms 644 KB Output is correct
30 Correct 139 ms 552 KB Output is correct
31 Correct 373 ms 596 KB Output is correct
32 Correct 870 ms 2952 KB Output is correct
33 Correct 23 ms 596 KB Output is correct
34 Correct 34 ms 652 KB Output is correct
35 Correct 656 ms 2680 KB Output is correct
36 Correct 651 ms 2652 KB Output is correct
37 Correct 53 ms 604 KB Output is correct
38 Correct 56 ms 596 KB Output is correct
39 Correct 505 ms 724 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 499 ms 468 KB Output is correct
2 Correct 485 ms 448 KB Output is correct
3 Correct 499 ms 424 KB Output is correct
4 Correct 486 ms 460 KB Output is correct
5 Correct 494 ms 428 KB Output is correct
6 Correct 496 ms 444 KB Output is correct
7 Correct 492 ms 440 KB Output is correct
8 Correct 505 ms 432 KB Output is correct
9 Correct 496 ms 436 KB Output is correct
10 Correct 488 ms 428 KB Output is correct
11 Correct 557 ms 7624 KB Output is correct
12 Correct 545 ms 4808 KB Output is correct
13 Correct 558 ms 5832 KB Output is correct
14 Correct 562 ms 7612 KB Output is correct
15 Correct 552 ms 7624 KB Output is correct
16 Correct 567 ms 7672 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 499 ms 468 KB Output is correct
2 Correct 485 ms 448 KB Output is correct
3 Correct 499 ms 424 KB Output is correct
4 Correct 486 ms 460 KB Output is correct
5 Correct 494 ms 428 KB Output is correct
6 Correct 496 ms 444 KB Output is correct
7 Correct 492 ms 440 KB Output is correct
8 Correct 505 ms 432 KB Output is correct
9 Correct 496 ms 436 KB Output is correct
10 Correct 488 ms 428 KB Output is correct
11 Correct 557 ms 7624 KB Output is correct
12 Correct 545 ms 4808 KB Output is correct
13 Correct 558 ms 5832 KB Output is correct
14 Correct 562 ms 7612 KB Output is correct
15 Correct 552 ms 7624 KB Output is correct
16 Correct 567 ms 7672 KB Output is correct
17 Correct 495 ms 416 KB Output is correct
18 Correct 493 ms 468 KB Output is correct
19 Correct 496 ms 468 KB Output is correct
20 Correct 523 ms 600 KB Output is correct
21 Correct 509 ms 700 KB Output is correct
22 Correct 573 ms 7644 KB Output is correct
23 Correct 569 ms 7644 KB Output is correct
24 Correct 546 ms 5400 KB Output is correct
25 Correct 590 ms 7656 KB Output is correct
26 Correct 550 ms 7624 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 499 ms 468 KB Output is correct
2 Correct 485 ms 448 KB Output is correct
3 Correct 499 ms 424 KB Output is correct
4 Correct 486 ms 460 KB Output is correct
5 Correct 494 ms 428 KB Output is correct
6 Correct 496 ms 444 KB Output is correct
7 Correct 492 ms 440 KB Output is correct
8 Correct 505 ms 432 KB Output is correct
9 Correct 496 ms 436 KB Output is correct
10 Correct 488 ms 428 KB Output is correct
11 Correct 557 ms 7624 KB Output is correct
12 Correct 545 ms 4808 KB Output is correct
13 Correct 558 ms 5832 KB Output is correct
14 Correct 562 ms 7612 KB Output is correct
15 Correct 552 ms 7624 KB Output is correct
16 Correct 567 ms 7672 KB Output is correct
17 Correct 495 ms 416 KB Output is correct
18 Correct 493 ms 468 KB Output is correct
19 Correct 496 ms 468 KB Output is correct
20 Correct 523 ms 600 KB Output is correct
21 Correct 509 ms 700 KB Output is correct
22 Correct 573 ms 7644 KB Output is correct
23 Correct 569 ms 7644 KB Output is correct
24 Correct 546 ms 5400 KB Output is correct
25 Correct 590 ms 7656 KB Output is correct
26 Correct 550 ms 7624 KB Output is correct
27 Correct 912 ms 2348 KB Output is correct
28 Correct 697 ms 1492 KB Output is correct
29 Correct 581 ms 1364 KB Output is correct
30 Correct 580 ms 1364 KB Output is correct
31 Correct 836 ms 2904 KB Output is correct
32 Correct 652 ms 2668 KB Output is correct
33 Correct 648 ms 2644 KB Output is correct
34 Correct 1438 ms 9540 KB Output is correct
35 Correct 1097 ms 9212 KB Output is correct
36 Correct 1044 ms 9660 KB Output is correct
37 Correct 903 ms 9560 KB Output is correct
38 Correct 1210 ms 9616 KB Output is correct
39 Correct 967 ms 7164 KB Output is correct

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 499 ms 468 KB Output is correct
2 Correct 485 ms 448 KB Output is correct
3 Correct 499 ms 424 KB Output is correct
4 Correct 486 ms 460 KB Output is correct
5 Correct 494 ms 428 KB Output is correct
6 Correct 496 ms 444 KB Output is correct
7 Correct 492 ms 440 KB Output is correct
8 Correct 505 ms 432 KB Output is correct
9 Correct 496 ms 436 KB Output is correct
10 Correct 488 ms 428 KB Output is correct
11 Correct 557 ms 7624 KB Output is correct
12 Correct 545 ms 4808 KB Output is correct
13 Correct 558 ms 5832 KB Output is correct
14 Correct 562 ms 7612 KB Output is correct
15 Correct 552 ms 7624 KB Output is correct
16 Correct 567 ms 7672 KB Output is correct
17 Correct 495 ms 416 KB Output is correct
18 Correct 493 ms 468 KB Output is correct
19 Correct 496 ms 468 KB Output is correct
20 Correct 523 ms 600 KB Output is correct
21 Correct 509 ms 700 KB Output is correct
22 Correct 573 ms 7644 KB Output is correct
23 Correct 569 ms 7644 KB Output is correct
24 Correct 546 ms 5400 KB Output is correct
25 Correct 590 ms 7656 KB Output is correct
26 Correct 550 ms 7624 KB Output is correct
27 Correct 912 ms 2348 KB Output is correct
28 Correct 697 ms 1492 KB Output is correct
29 Correct 581 ms 1364 KB Output is correct
30 Correct 580 ms 1364 KB Output is correct
31 Correct 836 ms 2904 KB Output is correct
32 Correct 652 ms 2668 KB Output is correct
33 Correct 648 ms 2644 KB Output is correct
34 Correct 1438 ms 9540 KB Output is correct
35 Correct 1097 ms 9212 KB Output is correct
36 Correct 1044 ms 9660 KB Output is correct
37 Correct 903 ms 9560 KB Output is correct
38 Correct 1210 ms 9616 KB Output is correct
39 Correct 967 ms 7164 KB Output is correct
40 Correct 137 ms 484 KB Output is correct
41 Correct 374 ms 596 KB Output is correct
42 Correct 53 ms 596 KB Output is correct
43 Correct 55 ms 596 KB Output is correct
44 Execution timed out 2069 ms 8880 KB Time limit exceeded
45 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 485 ms 468 KB Output is correct
2 Correct 493 ms 468 KB Output is correct
3 Correct 506 ms 428 KB Output is correct
4 Correct 505 ms 460 KB Output is correct
5 Correct 498 ms 432 KB Output is correct
6 Correct 490 ms 440 KB Output is correct
7 Correct 503 ms 436 KB Output is correct
8 Correct 491 ms 436 KB Output is correct
9 Correct 492 ms 448 KB Output is correct
10 Correct 496 ms 428 KB Output is correct
11 Correct 512 ms 412 KB Output is correct
12 Correct 499 ms 472 KB Output is correct
13 Correct 497 ms 468 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 911 ms 2352 KB Output is correct
19 Correct 718 ms 1492 KB Output is correct
20 Correct 503 ms 596 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 587 ms 1364 KB Output is correct
25 Correct 582 ms 1364 KB Output is correct
26 Correct 468 ms 676 KB Output is correct
27 Correct 403 ms 596 KB Output is correct
28 Correct 327 ms 672 KB Output is correct
29 Correct 213 ms 644 KB Output is correct
30 Correct 139 ms 552 KB Output is correct
31 Correct 373 ms 596 KB Output is correct
32 Correct 870 ms 2952 KB Output is correct
33 Correct 23 ms 596 KB Output is correct
34 Correct 34 ms 652 KB Output is correct
35 Correct 656 ms 2680 KB Output is correct
36 Correct 651 ms 2652 KB Output is correct
37 Correct 53 ms 604 KB Output is correct
38 Correct 56 ms 596 KB Output is correct
39 Correct 505 ms 724 KB Output is correct
40 Correct 499 ms 468 KB Output is correct
41 Correct 485 ms 448 KB Output is correct
42 Correct 499 ms 424 KB Output is correct
43 Correct 486 ms 460 KB Output is correct
44 Correct 494 ms 428 KB Output is correct
45 Correct 496 ms 444 KB Output is correct
46 Correct 492 ms 440 KB Output is correct
47 Correct 505 ms 432 KB Output is correct
48 Correct 496 ms 436 KB Output is correct
49 Correct 488 ms 428 KB Output is correct
50 Correct 557 ms 7624 KB Output is correct
51 Correct 545 ms 4808 KB Output is correct
52 Correct 558 ms 5832 KB Output is correct
53 Correct 562 ms 7612 KB Output is correct
54 Correct 552 ms 7624 KB Output is correct
55 Correct 567 ms 7672 KB Output is correct
56 Correct 495 ms 416 KB Output is correct
57 Correct 493 ms 468 KB Output is correct
58 Correct 496 ms 468 KB Output is correct
59 Correct 523 ms 600 KB Output is correct
60 Correct 509 ms 700 KB Output is correct
61 Correct 573 ms 7644 KB Output is correct
62 Correct 569 ms 7644 KB Output is correct
63 Correct 546 ms 5400 KB Output is correct
64 Correct 590 ms 7656 KB Output is correct
65 Correct 550 ms 7624 KB Output is correct
66 Correct 912 ms 2348 KB Output is correct
67 Correct 697 ms 1492 KB Output is correct
68 Correct 581 ms 1364 KB Output is correct
69 Correct 580 ms 1364 KB Output is correct
70 Correct 836 ms 2904 KB Output is correct
71 Correct 652 ms 2668 KB Output is correct
72 Correct 648 ms 2644 KB Output is correct
73 Correct 1438 ms 9540 KB Output is correct
74 Correct 1097 ms 9212 KB Output is correct
75 Correct 1044 ms 9660 KB Output is correct
76 Correct 903 ms 9560 KB Output is correct
77 Correct 1210 ms 9616 KB Output is correct
78 Correct 967 ms 7164 KB Output is correct
79 Correct 137 ms 484 KB Output is correct
80 Correct 374 ms 596 KB Output is correct
81 Correct 53 ms 596 KB Output is correct
82 Correct 55 ms 596 KB Output is correct
83 Execution timed out 2069 ms 8880 KB Time limit exceeded
84 Halted 0 ms 0 KB -