답안 #795140

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
795140	2023-07-27T06:58:59 Z	vjudge1	Team Contest (JOI22_team)	C++14	26 / 100	118 ms	3884 KB

team

#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std ;
const int N = 15e4 ;
bool flag1, flag2 = 0 ;
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 ;
        if(x[i] > 20 || y[i] > 20 || z[i] > 20)flag2 = 1 ;
        s.insert({x[i], {y[i], z[i]}}) ;
    }
    if(!flag2)
    {
        for(auto i : s)
            v.push_back(i) ;
        for(int i = 1 ; i <= 20 ; i++)
            for(int j = 1 ; j <= 20 ; j++)
                for(int q = 1 ; q <= 20 ; q++)
                {
                    bool fl1 = 0, fl2 = 0, fl3 = 0 ;
                    for(auto now : v)
                    {
                        if(now.fi == i && now.se.fi < j && now.se.se < q)fl1 = 1 ;
                        if(now.fi < i && now.se.fi == j && now.se.se < q)fl2 = 1 ;
                        if(now.fi < i && now.se.fi < j && now.se.se == q)fl3 = 1 ;
                    }
//                    if(i == 5 && j == 4 && q == 4)
//                        cout << fl1 << ' ' << fl2 << ' ' << fl3 << '\n' ;
                    if(fl1 && fl2 && fl3)
                        ans = max(ans, i + j + q) ;
                }
        cout << ans ;
        return 0 ;
    }
    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:64: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]
   64 |         for(int i = 0 ; i < v.size() ; i++)
      |                         ~~^~~~~~~~~~
team.cpp:65: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]
   65 |             for(int j = 0 ; j < v.size() ; j++)
      |                             ~~^~~~~~~~~~
team.cpp:69: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]
   69 |                 for(int q = 0 ; q < v.size() ; q++)
      |                                 ~~^~~~~~~~~~

Subtask #1

8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	0 ms	332 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	212 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	212 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	108 ms	352 KB	Output is correct
15	Correct	47 ms	348 KB	Output is correct
16	Correct	75 ms	348 KB	Output is correct
17	Correct	93 ms	340 KB	Output is correct
18	Correct	86 ms	352 KB	Output is correct
19	Correct	106 ms	340 KB	Output is correct
20	Correct	3 ms	364 KB	Output is correct
21	Correct	78 ms	356 KB	Output is correct
22	Correct	76 ms	340 KB	Output is correct
23	Correct	76 ms	340 KB	Output is correct
24	Correct	81 ms	348 KB	Output is correct
25	Correct	80 ms	348 KB	Output is correct

Subtask #2

0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	0 ms	332 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	212 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	212 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	108 ms	352 KB	Output is correct
15	Correct	47 ms	348 KB	Output is correct
16	Correct	75 ms	348 KB	Output is correct
17	Correct	93 ms	340 KB	Output is correct
18	Correct	86 ms	352 KB	Output is correct
19	Correct	106 ms	340 KB	Output is correct
20	Correct	3 ms	364 KB	Output is correct
21	Correct	78 ms	356 KB	Output is correct
22	Correct	76 ms	340 KB	Output is correct
23	Correct	76 ms	340 KB	Output is correct
24	Correct	81 ms	348 KB	Output is correct
25	Correct	80 ms	348 KB	Output is correct
26	Incorrect	2 ms	672 KB	Output isn't correct
27	Halted	0 ms	0 KB	-

Subtask #3

9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	328 KB	Output is correct
3	Correct	1 ms	328 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	340 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 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	30 ms	2964 KB	Output is correct
12	Correct	16 ms	2004 KB	Output is correct
13	Correct	18 ms	2388 KB	Output is correct
14	Correct	26 ms	2900 KB	Output is correct
15	Correct	20 ms	2840 KB	Output is correct
16	Correct	18 ms	2828 KB	Output is correct

Subtask #4

9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	328 KB	Output is correct
3	Correct	1 ms	328 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	340 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 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	30 ms	2964 KB	Output is correct
12	Correct	16 ms	2004 KB	Output is correct
13	Correct	18 ms	2388 KB	Output is correct
14	Correct	26 ms	2900 KB	Output is correct
15	Correct	20 ms	2840 KB	Output is correct
16	Correct	18 ms	2828 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	0 ms	328 KB	Output is correct
20	Correct	3 ms	340 KB	Output is correct
21	Correct	20 ms	540 KB	Output is correct
22	Correct	118 ms	3884 KB	Output is correct
23	Correct	43 ms	3036 KB	Output is correct
24	Correct	33 ms	2388 KB	Output is correct
25	Correct	39 ms	3292 KB	Output is correct
26	Correct	22 ms	3024 KB	Output is correct

Subtask #5

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	328 KB	Output is correct
3	Correct	1 ms	328 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	340 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 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	30 ms	2964 KB	Output is correct
12	Correct	16 ms	2004 KB	Output is correct
13	Correct	18 ms	2388 KB	Output is correct
14	Correct	26 ms	2900 KB	Output is correct
15	Correct	20 ms	2840 KB	Output is correct
16	Correct	18 ms	2828 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	0 ms	328 KB	Output is correct
20	Correct	3 ms	340 KB	Output is correct
21	Correct	20 ms	540 KB	Output is correct
22	Correct	118 ms	3884 KB	Output is correct
23	Correct	43 ms	3036 KB	Output is correct
24	Correct	33 ms	2388 KB	Output is correct
25	Correct	39 ms	3292 KB	Output is correct
26	Correct	22 ms	3024 KB	Output is correct
27	Correct	86 ms	348 KB	Output is correct
28	Correct	107 ms	348 KB	Output is correct
29	Correct	81 ms	348 KB	Output is correct
30	Correct	81 ms	348 KB	Output is correct
31	Correct	2 ms	596 KB	Output is correct
32	Incorrect	1 ms	340 KB	Output isn't correct
33	Halted	0 ms	0 KB	-

Subtask #6

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	328 KB	Output is correct
3	Correct	1 ms	328 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	340 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 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	30 ms	2964 KB	Output is correct
12	Correct	16 ms	2004 KB	Output is correct
13	Correct	18 ms	2388 KB	Output is correct
14	Correct	26 ms	2900 KB	Output is correct
15	Correct	20 ms	2840 KB	Output is correct
16	Correct	18 ms	2828 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	0 ms	328 KB	Output is correct
20	Correct	3 ms	340 KB	Output is correct
21	Correct	20 ms	540 KB	Output is correct
22	Correct	118 ms	3884 KB	Output is correct
23	Correct	43 ms	3036 KB	Output is correct
24	Correct	33 ms	2388 KB	Output is correct
25	Correct	39 ms	3292 KB	Output is correct
26	Correct	22 ms	3024 KB	Output is correct
27	Correct	86 ms	348 KB	Output is correct
28	Correct	107 ms	348 KB	Output is correct
29	Correct	81 ms	348 KB	Output is correct
30	Correct	81 ms	348 KB	Output is correct
31	Correct	2 ms	596 KB	Output is correct
32	Incorrect	1 ms	340 KB	Output isn't correct
33	Halted	0 ms	0 KB	-

Subtask #7

0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	0 ms	332 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	212 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	212 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	108 ms	352 KB	Output is correct
15	Correct	47 ms	348 KB	Output is correct
16	Correct	75 ms	348 KB	Output is correct
17	Correct	93 ms	340 KB	Output is correct
18	Correct	86 ms	352 KB	Output is correct
19	Correct	106 ms	340 KB	Output is correct
20	Correct	3 ms	364 KB	Output is correct
21	Correct	78 ms	356 KB	Output is correct
22	Correct	76 ms	340 KB	Output is correct
23	Correct	76 ms	340 KB	Output is correct
24	Correct	81 ms	348 KB	Output is correct
25	Correct	80 ms	348 KB	Output is correct
26	Incorrect	2 ms	672 KB	Output isn't correct
27	Halted	0 ms	0 KB	-