oj.uz

Submission #795305

# Submission time Handle Problem Language Result Execution time Memory
795305 2023-07-27T08:15:56 Z vjudge1 Team Contest (JOI22_team) C++14
18 / 100
 150 ms 125956 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std ;
const int N = 15e4 ;
bool flag1, flag2, flag3 ;
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 ;
        if(x[i] > 4000 || y[i] > 4000 || z[i] > 4000)flag3 = 1 ;
        s.insert({x[i], {y[i], z[i]}}) ;
    }
    if(n <= 4000)
    {
        set<int> s ;
        int mx[n + 1][n + 1] = {}, num[n + 1][n + 1] = {}, kol = 0 ;
        map<int, int> mp, ob ;
        for(int i = 1 ; i <= n ; i++)
        {
            s.insert(x[i]) ;
            s.insert(y[i]) ;
        }
        for(int i : s)
            kol++, mp[i] = kol ;
        for(int i = 1 ; i <= n ; i++)
        {
            ob[mp[x[i]]] = x[i] ;
            ob[mp[y[i]]] = y[i] ;
            x[i] = mp[x[i]] ;
            y[i] = mp[y[i]] ;
            num[x[i]][y[i]] = z[i] ;
        }
        for(int i = 1 ; i <= n ; i++)
        {
            int now = 0 ;
            for(int j = 1 ; j <= n ; j++)
            {
                now = max(now, num[i][j]) ;
                mx[i][j] = max(now, mx[i - 1][j]) ;
            }
        }
//        for(int i = 1 ; i <= n ; i++)
//        {
//            for(int j = 1 ; j <= n ; j++)
//                cout << num[i][j] << ' ' ;
//            cout << '\n' ;
//        }
        for(int i = 1 ; i <= n ; i++)
            for(int j = 1 ; j <= n ; j++)
            {
                if(i == j || x[i] <= x[j] || y[j] <= y[i] || mx[x[i] - 1][y[j] - 1] <= max(z[i], z[j]))
                    continue ;
                ans = max(ans, ob[x[i]] + ob[y[j]] + mx[x[i] - 1][y[j] - 1]) ;
            }
        cout << ans << '\n' ;
        return 0 ;
    }
    if(!flag3)
    {
    }
    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(fl1 && fl2 && fl3)
                        ans = max(ans, 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 ;
    }
    return 0 ;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 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 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Runtime error 3 ms 2164 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 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 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Runtime error 3 ms 2164 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 26 ms 2004 KB Output is correct
12 Correct 18 ms 1408 KB Output is correct
13 Correct 18 ms 1756 KB Output is correct
14 Correct 31 ms 2004 KB Output is correct
15 Correct 21 ms 2004 KB Output is correct
16 Correct 18 ms 1984 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 26 ms 2004 KB Output is correct
12 Correct 18 ms 1408 KB Output is correct
13 Correct 18 ms 1756 KB Output is correct
14 Correct 31 ms 2004 KB Output is correct
15 Correct 21 ms 2004 KB Output is correct
16 Correct 18 ms 1984 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 980 KB Output is correct
21 Correct 58 ms 31792 KB Output is correct
22 Correct 110 ms 2756 KB Output is correct
23 Correct 50 ms 2172 KB Output is correct
24 Correct 31 ms 1628 KB Output is correct
25 Correct 47 ms 2368 KB Output is correct
26 Correct 22 ms 2004 KB Output is correct

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 26 ms 2004 KB Output is correct
12 Correct 18 ms 1408 KB Output is correct
13 Correct 18 ms 1756 KB Output is correct
14 Correct 31 ms 2004 KB Output is correct
15 Correct 21 ms 2004 KB Output is correct
16 Correct 18 ms 1984 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 980 KB Output is correct
21 Correct 58 ms 31792 KB Output is correct
22 Correct 110 ms 2756 KB Output is correct
23 Correct 50 ms 2172 KB Output is correct
24 Correct 31 ms 1628 KB Output is correct
25 Correct 47 ms 2368 KB Output is correct
26 Correct 22 ms 2004 KB Output is correct
27 Correct 2 ms 980 KB Output is correct
28 Correct 2 ms 980 KB Output is correct
29 Correct 1 ms 980 KB Output is correct
30 Correct 1 ms 1064 KB Output is correct
31 Correct 150 ms 125956 KB Output is correct
32 Correct 5 ms 6776 KB Output is correct
33 Correct 5 ms 6740 KB Output is correct
34 Incorrect 68 ms 10856 KB Output isn't correct
35 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 26 ms 2004 KB Output is correct
12 Correct 18 ms 1408 KB Output is correct
13 Correct 18 ms 1756 KB Output is correct
14 Correct 31 ms 2004 KB Output is correct
15 Correct 21 ms 2004 KB Output is correct
16 Correct 18 ms 1984 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 980 KB Output is correct
21 Correct 58 ms 31792 KB Output is correct
22 Correct 110 ms 2756 KB Output is correct
23 Correct 50 ms 2172 KB Output is correct
24 Correct 31 ms 1628 KB Output is correct
25 Correct 47 ms 2368 KB Output is correct
26 Correct 22 ms 2004 KB Output is correct
27 Correct 2 ms 980 KB Output is correct
28 Correct 2 ms 980 KB Output is correct
29 Correct 1 ms 980 KB Output is correct
30 Correct 1 ms 1064 KB Output is correct
31 Correct 150 ms 125956 KB Output is correct
32 Correct 5 ms 6776 KB Output is correct
33 Correct 5 ms 6740 KB Output is correct
34 Incorrect 68 ms 10856 KB Output isn't correct
35 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 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 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Runtime error 3 ms 2164 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -