oj.uz

Submission #795049

# Submission time Handle Problem Language Result Execution time Memory
795049 2023-07-27T05:41:19 Z vjudge1 Team Contest (JOI22_team) C++14
17 / 100
 112 ms 2036 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std ;
const int N = 15e4 ;
bool flag1 ;
int n, ans = -1, x[N + 1], y[N + 1], z[N + 1] ;
set<pair<int, pair<int, int>>> s ;
vector<pair<int, pair<int, int>>> v ;
int func(int i, int j, int q)
{
    if(x[i] > x[j] && x[i] > x[q] && y[j] > y[i] && y[j] > y[q] && z[i] < z[q] && z[j] < z[q])
        return x[i] + y[j] + z[q] ;
    else
        return -1 ;
}
int func1(int i, int j, int q)
{
    if(v[i].fi > v[j].fi && v[i].fi > v[q].fi && v[j].se.fi > v[i].se.fi && v[j].se.fi > v[q].se.fi && v[i].se.se < v[q].se.se && v[j].se.se < v[q].se.se)
        return v[i].fi + v[j].se.fi + v[q].se.se ;
    else
        return -1 ;
}
signed main()
{
    ios_base::sync_with_stdio( 0 ) ;
    cin.tie( 0 ) ;
    cout.tie( 0 ) ;
    cin >> n ;
    for(int i = 1 ; i <= n ; i++)
    {
        cin >> x[i] >> y[i] >> z[i] ;
        if(x[i] > 5 || y[i] > 5 || z[i] > 5)flag1 = 1 ;
        s.insert({x[i], {y[i], z[i]}}) ;
    }
    if(!flag1)
    {
        for(auto i : s)
            v.push_back(i) ;
        for(int i = 0 ; i < v.size() ; i++)
            for(int j = 0 ; j < v.size() ; j++)
            {
                if(i == j)
                    continue ;
                for(int q = 0 ; q < v.size() ; q++)
                {
                    if(i == q || q == j)
                        continue ;
                    ans = max(ans, func1(i, j, q)) ;
                }
            }
        cout << ans ;
        return 0 ;
    }
    if(n <= 300)
    {
        for(int i = 1 ; i <= n ; i++)
            for(int j = 1 ; j <= n ; j++)
            {
                if(i == j)
                    continue ;
                for(int q = 1 ; q <= n ; q++)
                {
                    if(j == q || i == q)
                        continue ;
                    ans = max(ans, func(i, j, q)) ;
                }
            }
        cout << ans << '\n' ;
        return 0 ;
    }
    if(n <= 4000)
    {
        cout << ans << '\n' ;
        return 0 ;
    }
    return 0 ;
}

Compilation message

team.cpp: In function 'int main()':
team.cpp:40:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |         for(int i = 0 ; i < v.size() ; i++)
      |                         ~~^~~~~~~~~~
team.cpp:41:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |             for(int j = 0 ; j < v.size() ; j++)
      |                             ~~^~~~~~~~~~
team.cpp:45:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |                 for(int q = 0 ; q < v.size() ; q++)
      |                                 ~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 112 ms 344 KB Output is correct
15 Correct 48 ms 348 KB Output is correct
16 Correct 73 ms 348 KB Output is correct
17 Correct 92 ms 340 KB Output is correct
18 Correct 86 ms 344 KB Output is correct
19 Correct 102 ms 348 KB Output is correct
20 Correct 88 ms 344 KB Output is correct
21 Correct 76 ms 340 KB Output is correct
22 Correct 74 ms 344 KB Output is correct
23 Correct 89 ms 340 KB Output is correct
24 Correct 78 ms 352 KB Output is correct
25 Correct 84 ms 340 KB Output is correct

Subtask #2
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 112 ms 344 KB Output is correct
15 Correct 48 ms 348 KB Output is correct
16 Correct 73 ms 348 KB Output is correct
17 Correct 92 ms 340 KB Output is correct
18 Correct 86 ms 344 KB Output is correct
19 Correct 102 ms 348 KB Output is correct
20 Correct 88 ms 344 KB Output is correct
21 Correct 76 ms 340 KB Output is correct
22 Correct 74 ms 344 KB Output is correct
23 Correct 89 ms 340 KB Output is correct
24 Correct 78 ms 352 KB Output is correct
25 Correct 84 ms 340 KB Output is correct
26 Incorrect 2 ms 732 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 43 ms 1984 KB Output is correct
12 Correct 16 ms 1404 KB Output is correct
13 Correct 19 ms 1668 KB Output is correct
14 Correct 23 ms 2036 KB Output is correct
15 Correct 20 ms 2020 KB Output is correct
16 Correct 18 ms 2004 KB Output is correct

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 43 ms 1984 KB Output is correct
12 Correct 16 ms 1404 KB Output is correct
13 Correct 19 ms 1668 KB Output is correct
14 Correct 23 ms 2036 KB Output is correct
15 Correct 20 ms 2020 KB Output is correct
16 Correct 18 ms 2004 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 90 ms 344 KB Output is correct
21 Incorrect 1 ms 468 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 43 ms 1984 KB Output is correct
12 Correct 16 ms 1404 KB Output is correct
13 Correct 19 ms 1668 KB Output is correct
14 Correct 23 ms 2036 KB Output is correct
15 Correct 20 ms 2020 KB Output is correct
16 Correct 18 ms 2004 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 90 ms 344 KB Output is correct
21 Incorrect 1 ms 468 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 43 ms 1984 KB Output is correct
12 Correct 16 ms 1404 KB Output is correct
13 Correct 19 ms 1668 KB Output is correct
14 Correct 23 ms 2036 KB Output is correct
15 Correct 20 ms 2020 KB Output is correct
16 Correct 18 ms 2004 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 90 ms 344 KB Output is correct
21 Incorrect 1 ms 468 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 112 ms 344 KB Output is correct
15 Correct 48 ms 348 KB Output is correct
16 Correct 73 ms 348 KB Output is correct
17 Correct 92 ms 340 KB Output is correct
18 Correct 86 ms 344 KB Output is correct
19 Correct 102 ms 348 KB Output is correct
20 Correct 88 ms 344 KB Output is correct
21 Correct 76 ms 340 KB Output is correct
22 Correct 74 ms 344 KB Output is correct
23 Correct 89 ms 340 KB Output is correct
24 Correct 78 ms 352 KB Output is correct
25 Correct 84 ms 340 KB Output is correct
26 Incorrect 2 ms 732 KB Output isn't correct
27 Halted 0 ms 0 KB -