oj.uz

답안 #795041

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
795041 2023-07-27T05:32:09 Z vjudge1 Team Contest (JOI22_team) C++17
18 / 100
 73 ms 6412 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;
    for(i =1; i <= n; i++)
        cin>>a[i][1]>>a[i][2]>>a[i][3] ;
    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 <= 20; i++){
        for(j = 1; j <= 20; j++){
            for(x = 1; x <= 20; 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";
}

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:41: warning: unused variable 'l' [-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
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Incorrect 1 ms 340 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Incorrect 1 ms 340 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 456 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 64 ms 5332 KB Output is correct
12 Correct 43 ms 4116 KB Output is correct
13 Correct 66 ms 5012 KB Output is correct
14 Correct 73 ms 6036 KB Output is correct
15 Correct 62 ms 6024 KB Output is correct
16 Correct 73 ms 6016 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 456 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 64 ms 5332 KB Output is correct
12 Correct 43 ms 4116 KB Output is correct
13 Correct 66 ms 5012 KB Output is correct
14 Correct 73 ms 6036 KB Output is correct
15 Correct 62 ms 6024 KB Output is correct
16 Correct 73 ms 6016 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 2 ms 596 KB Output is correct
22 Correct 58 ms 6412 KB Output is correct
23 Correct 57 ms 6096 KB Output is correct
24 Correct 42 ms 4704 KB Output is correct
25 Correct 62 ms 6412 KB Output is correct
26 Correct 54 ms 6200 KB Output is correct

Subtask #5
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 456 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 64 ms 5332 KB Output is correct
12 Correct 43 ms 4116 KB Output is correct
13 Correct 66 ms 5012 KB Output is correct
14 Correct 73 ms 6036 KB Output is correct
15 Correct 62 ms 6024 KB Output is correct
16 Correct 73 ms 6016 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 2 ms 596 KB Output is correct
22 Correct 58 ms 6412 KB Output is correct
23 Correct 57 ms 6096 KB Output is correct
24 Correct 42 ms 4704 KB Output is correct
25 Correct 62 ms 6412 KB Output is correct
26 Correct 54 ms 6200 KB Output is correct
27 Incorrect 2 ms 2260 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 456 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 64 ms 5332 KB Output is correct
12 Correct 43 ms 4116 KB Output is correct
13 Correct 66 ms 5012 KB Output is correct
14 Correct 73 ms 6036 KB Output is correct
15 Correct 62 ms 6024 KB Output is correct
16 Correct 73 ms 6016 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 2 ms 596 KB Output is correct
22 Correct 58 ms 6412 KB Output is correct
23 Correct 57 ms 6096 KB Output is correct
24 Correct 42 ms 4704 KB Output is correct
25 Correct 62 ms 6412 KB Output is correct
26 Correct 54 ms 6200 KB Output is correct
27 Incorrect 2 ms 2260 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Incorrect 1 ms 340 KB Output isn't correct
15 Halted 0 ms 0 KB -