oj.uz

답안 #1004076

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1004076 2024-06-21T04:38:02 Z De3b0o Team Contest (JOI22_team) C++14
37 / 100
 2000 ms 130644 KB 
#include<bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define in insert
#define pb push_back
#define ppb pop_back()
#define d3 ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define cans cout << ans << "\n";
#define yes cout << "Yes" << "\n";
#define no cout << "No" << "\n";
#define pll pair<ll,ll>
#define lin cout << "\n";
#define sqr 340
#define mod 1000000007
#define mid ((l+r)/2)
#define lc (2*x)
#define rc (2*x+1)

using namespace std;

ll n;
ll X[150009];
ll Y[150009];
ll Z[150009];
ll ox[150009];
ll oy[150009];
ll oz[150009];

ll mx[4009][4009];

int main()
{
    d3
    cin >> n;
    set<ll> s1 , s2 , s3;
    map<ll,ll> mp1 , mp2 , mp3;
    map<pair<pll,ll>,ll> mp;
    int i = 0;
    while(n--)
    {
        ll x , y , z;
        cin >> x >> y >> z;
        if(mp[{{x,y},z}])
            continue;
        X[i]=x;
        Y[i]=y;
        Z[i]=z;
        s1.in(X[i]);
        s2.in(Y[i]);
        s3.in(Z[i]);
        i++;
    }
    n=i;
    ll t = 0;
    for(auto it : s1)
    {
        mp1[it]=t;
        ox[t]=it;
        t++;
    }
    t=0;
    for(auto it : s2)
    {
        mp2[it]=t;
        oy[t]=it;
        t++;
    }
    t=0;
    for(auto it : s3)
    {
        mp3[it]=t;
        oz[t]=it;
        t++;
    }
    for(int i = 0 ; n>i ; i++)
    {
        X[i]=mp1[X[i]];
        Y[i]=mp2[Y[i]];
        Z[i]=mp3[Z[i]];
        mx[X[i]][Y[i]]=max(mx[X[i]][Y[i]],Z[i]);
    }
    for(int i = 1 ; 4009 > i ; i++)
        mx[i][0]=max(mx[i][0],mx[i-1][0]);
    for(int i = 1 ; 4009 > i ; i++)
        mx[0][i]=max(mx[0][i],mx[0][i-1]);
    for(int i = 1 ; 4009>i ; i++)
        for(int j = 1 ; 4009>j ; j++)
            mx[i][j]=max(mx[i][j],max(mx[i-1][j],mx[i][j-1]));
    ll ans = -1;
    for(int i = 0 ; n>i ; i++)
    {
        for(int j = 0 ; n>j ; j++)
        {
            if(i==j)
                continue;
            if(X[i]>X[j]&&Y[j]>Y[i])
            {
                if(max(Z[i],Z[j])>=mx[X[i]-1][Y[j]-1])
                    continue;
                ans=max(ans,ox[X[i]]+oy[Y[j]]+oz[mx[X[i]-1][Y[j]-1]]);
            }
        }
    }
    cans
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 126036 KB Output is correct
2 Correct 57 ms 126132 KB Output is correct
3 Correct 50 ms 126032 KB Output is correct
4 Correct 56 ms 126032 KB Output is correct
5 Correct 55 ms 126288 KB Output is correct
6 Correct 59 ms 126032 KB Output is correct
7 Correct 53 ms 126044 KB Output is correct
8 Correct 57 ms 126036 KB Output is correct
9 Correct 55 ms 126036 KB Output is correct
10 Correct 51 ms 126036 KB Output is correct
11 Correct 50 ms 126036 KB Output is correct
12 Correct 50 ms 126032 KB Output is correct
13 Correct 51 ms 126244 KB Output is correct
14 Correct 58 ms 126160 KB Output is correct
15 Correct 54 ms 126288 KB Output is correct
16 Correct 53 ms 126292 KB Output is correct
17 Correct 55 ms 126292 KB Output is correct
18 Correct 53 ms 126292 KB Output is correct
19 Correct 58 ms 126292 KB Output is correct
20 Correct 63 ms 126296 KB Output is correct
21 Correct 57 ms 126288 KB Output is correct
22 Correct 58 ms 126160 KB Output is correct
23 Correct 58 ms 126032 KB Output is correct
24 Correct 57 ms 126292 KB Output is correct
25 Correct 57 ms 126292 KB Output is correct

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 126036 KB Output is correct
2 Correct 57 ms 126132 KB Output is correct
3 Correct 50 ms 126032 KB Output is correct
4 Correct 56 ms 126032 KB Output is correct
5 Correct 55 ms 126288 KB Output is correct
6 Correct 59 ms 126032 KB Output is correct
7 Correct 53 ms 126044 KB Output is correct
8 Correct 57 ms 126036 KB Output is correct
9 Correct 55 ms 126036 KB Output is correct
10 Correct 51 ms 126036 KB Output is correct
11 Correct 50 ms 126036 KB Output is correct
12 Correct 50 ms 126032 KB Output is correct
13 Correct 51 ms 126244 KB Output is correct
14 Correct 58 ms 126160 KB Output is correct
15 Correct 54 ms 126288 KB Output is correct
16 Correct 53 ms 126292 KB Output is correct
17 Correct 55 ms 126292 KB Output is correct
18 Correct 53 ms 126292 KB Output is correct
19 Correct 58 ms 126292 KB Output is correct
20 Correct 63 ms 126296 KB Output is correct
21 Correct 57 ms 126288 KB Output is correct
22 Correct 58 ms 126160 KB Output is correct
23 Correct 58 ms 126032 KB Output is correct
24 Correct 57 ms 126292 KB Output is correct
25 Correct 57 ms 126292 KB Output is correct
26 Correct 144 ms 128164 KB Output is correct
27 Correct 129 ms 127380 KB Output is correct
28 Correct 123 ms 127360 KB Output is correct
29 Correct 128 ms 127192 KB Output is correct
30 Correct 86 ms 127056 KB Output is correct
31 Correct 143 ms 126876 KB Output is correct
32 Correct 110 ms 126776 KB Output is correct
33 Correct 73 ms 127060 KB Output is correct
34 Correct 107 ms 127964 KB Output is correct
35 Correct 54 ms 126360 KB Output is correct
36 Correct 57 ms 126288 KB Output is correct
37 Correct 71 ms 127056 KB Output is correct
38 Correct 68 ms 127084 KB Output is correct
39 Correct 71 ms 126396 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 126032 KB Output is correct
2 Correct 52 ms 126040 KB Output is correct
3 Correct 54 ms 126036 KB Output is correct
4 Correct 55 ms 126036 KB Output is correct
5 Correct 54 ms 126188 KB Output is correct
6 Correct 61 ms 126036 KB Output is correct
7 Correct 55 ms 126036 KB Output is correct
8 Correct 55 ms 126132 KB Output is correct
9 Correct 52 ms 126300 KB Output is correct
10 Correct 56 ms 126140 KB Output is correct
11 Execution timed out 2072 ms 130644 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 126032 KB Output is correct
2 Correct 52 ms 126040 KB Output is correct
3 Correct 54 ms 126036 KB Output is correct
4 Correct 55 ms 126036 KB Output is correct
5 Correct 54 ms 126188 KB Output is correct
6 Correct 61 ms 126036 KB Output is correct
7 Correct 55 ms 126036 KB Output is correct
8 Correct 55 ms 126132 KB Output is correct
9 Correct 52 ms 126300 KB Output is correct
10 Correct 56 ms 126140 KB Output is correct
11 Execution timed out 2072 ms 130644 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 126032 KB Output is correct
2 Correct 52 ms 126040 KB Output is correct
3 Correct 54 ms 126036 KB Output is correct
4 Correct 55 ms 126036 KB Output is correct
5 Correct 54 ms 126188 KB Output is correct
6 Correct 61 ms 126036 KB Output is correct
7 Correct 55 ms 126036 KB Output is correct
8 Correct 55 ms 126132 KB Output is correct
9 Correct 52 ms 126300 KB Output is correct
10 Correct 56 ms 126140 KB Output is correct
11 Execution timed out 2072 ms 130644 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 126032 KB Output is correct
2 Correct 52 ms 126040 KB Output is correct
3 Correct 54 ms 126036 KB Output is correct
4 Correct 55 ms 126036 KB Output is correct
5 Correct 54 ms 126188 KB Output is correct
6 Correct 61 ms 126036 KB Output is correct
7 Correct 55 ms 126036 KB Output is correct
8 Correct 55 ms 126132 KB Output is correct
9 Correct 52 ms 126300 KB Output is correct
10 Correct 56 ms 126140 KB Output is correct
11 Execution timed out 2072 ms 130644 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 126036 KB Output is correct
2 Correct 57 ms 126132 KB Output is correct
3 Correct 50 ms 126032 KB Output is correct
4 Correct 56 ms 126032 KB Output is correct
5 Correct 55 ms 126288 KB Output is correct
6 Correct 59 ms 126032 KB Output is correct
7 Correct 53 ms 126044 KB Output is correct
8 Correct 57 ms 126036 KB Output is correct
9 Correct 55 ms 126036 KB Output is correct
10 Correct 51 ms 126036 KB Output is correct
11 Correct 50 ms 126036 KB Output is correct
12 Correct 50 ms 126032 KB Output is correct
13 Correct 51 ms 126244 KB Output is correct
14 Correct 58 ms 126160 KB Output is correct
15 Correct 54 ms 126288 KB Output is correct
16 Correct 53 ms 126292 KB Output is correct
17 Correct 55 ms 126292 KB Output is correct
18 Correct 53 ms 126292 KB Output is correct
19 Correct 58 ms 126292 KB Output is correct
20 Correct 63 ms 126296 KB Output is correct
21 Correct 57 ms 126288 KB Output is correct
22 Correct 58 ms 126160 KB Output is correct
23 Correct 58 ms 126032 KB Output is correct
24 Correct 57 ms 126292 KB Output is correct
25 Correct 57 ms 126292 KB Output is correct
26 Correct 144 ms 128164 KB Output is correct
27 Correct 129 ms 127380 KB Output is correct
28 Correct 123 ms 127360 KB Output is correct
29 Correct 128 ms 127192 KB Output is correct
30 Correct 86 ms 127056 KB Output is correct
31 Correct 143 ms 126876 KB Output is correct
32 Correct 110 ms 126776 KB Output is correct
33 Correct 73 ms 127060 KB Output is correct
34 Correct 107 ms 127964 KB Output is correct
35 Correct 54 ms 126360 KB Output is correct
36 Correct 57 ms 126288 KB Output is correct
37 Correct 71 ms 127056 KB Output is correct
38 Correct 68 ms 127084 KB Output is correct
39 Correct 71 ms 126396 KB Output is correct
40 Correct 58 ms 126032 KB Output is correct
41 Correct 52 ms 126040 KB Output is correct
42 Correct 54 ms 126036 KB Output is correct
43 Correct 55 ms 126036 KB Output is correct
44 Correct 54 ms 126188 KB Output is correct
45 Correct 61 ms 126036 KB Output is correct
46 Correct 55 ms 126036 KB Output is correct
47 Correct 55 ms 126132 KB Output is correct
48 Correct 52 ms 126300 KB Output is correct
49 Correct 56 ms 126140 KB Output is correct
50 Execution timed out 2072 ms 130644 KB Time limit exceeded
51 Halted 0 ms 0 KB -