oj.uz

답안 #550292

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
550292 2022-04-17T19:55:34 Z BalintR Team Contest (JOI22_team) C++17
36 / 100
 145 ms 5404 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize "Ofast"
#pragma GCC target "avx2,avx2"

typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef complex<double> cmplx;
template <typename T> using minPq = priority_queue<T, vector<T>, greater<T>>;
#define boost() cin.sync_with_stdio(0); cin.tie(0)
#define ms(a, x) memset(a, x, sizeof(a))
#define pb push_back
#define fs first
#define sn second
#define ALL(v) (v).begin(), (v).end()
#define SZ(v) ((int) (v).size())
#define lbv(v, x) (lower_bound((v).begin(), (v).end(), x) - (v).begin())
#define ubv(v, x) (upper_bound((v).begin(), (v).end(), x) - (v).begin())
template <typename T> inline void UNIQUE(vector<T> &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1);
#define FR(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define FORR(i, a, b) for(int i = (a); i >= (b); i--)
#define dbg(x) {cout << #x << ' ' << x << endl;}
#define dbgArr(arr, n) {cout << #arr; FR(_i, n) cout << ' ' << arr[_i]; cout << endl;}

typedef array<int, 3> trip;

const int MN = 150005;
int n;
vector<trip> vec;
vi ys, zs;
int mxZPref[MN], mxYPref[MN], mnYSuf[MN], mxAnsSuf[MN];

int main(){
    boost();
    cin >> n;
    FR(i, n){
        int a, b, c;
        cin >> a >> b >> c;
        vec.pb({a, b, c});
        ys.pb(b);
        zs.pb(c);
    }

    UNIQUE(vec);
    UNIQUE(ys);
    UNIQUE(zs);
    n = SZ(ys);

    int ans = -1;
    int lst = 0, prvX = vec[0][0];
    ms(mnYSuf, INF);

    FR(i, SZ(vec)){
        if(vec[i][0] != prvX){
            FOR(j, lst, i){
                auto [x, y, z] = vec[j];
                int yPos = lbv(ys, y);
                int zPos = lbv(zs, z);

                int mz = 0;
                for(int k = yPos; k; k -= k & -k) mz = max(mz, mxZPref[k]);
                if(mz > z) for(int k = MN-yPos-1; k < MN; k += k & -k) mxAnsSuf[k] = max(mxAnsSuf[k], y + mz);
                for(int k = zPos+1; k < MN; k += k & -k) mxYPref[k] = max(mxYPref[k], y);
                for(int k = MN-zPos-1; k < MN; k += k & -k) mnYSuf[k] = min(mnYSuf[k], y);

                int mxY = 0;
                for(int k = zPos; k; k -= k & -k) mxY = max(mxY, mxYPref[k]);
                if(mxY > y){
                    int yp1 = lbv(ys, mxY);
                    for(int k = MN-yp1-1; k < MN; k += k & -k) mxAnsSuf[k] = max(mxAnsSuf[k], mxY + z);
                }
                for(int k = yPos+1; k < MN; k += k & -k) mxZPref[k] = max(mxZPref[k], z);
            }

            prvX = vec[i][0];
            lst = i;
        }

        auto [x, y, z] = vec[i];
        int yPos = lbv(ys, y);
        int zPos = lbv(zs, z);

        int mnY = INF;
        for(int j = MN-zPos-2; j; j -= j & -j) mnY = min(mnY, mnYSuf[j]);

        int mxSum = 0;
        for(int j = MN-1-max(yPos+1, mnY); j > 0; j -= j & -j) mxSum = max(mxSum, mxAnsSuf[j]);
        if(mxSum) ans = max(ans, mxSum + x);
    }

    cout << ans << '\n';
}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 29.0

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

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 852 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 1000 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 852 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 49 ms 5356 KB Output is correct
12 Correct 31 ms 3388 KB Output is correct
13 Correct 36 ms 3740 KB Output is correct
14 Correct 54 ms 5288 KB Output is correct
15 Correct 44 ms 5232 KB Output is correct
16 Correct 52 ms 5180 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 852 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 1000 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 852 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 49 ms 5356 KB Output is correct
12 Correct 31 ms 3388 KB Output is correct
13 Correct 36 ms 3740 KB Output is correct
14 Correct 54 ms 5288 KB Output is correct
15 Correct 44 ms 5232 KB Output is correct
16 Correct 52 ms 5180 KB Output is correct
17 Correct 1 ms 852 KB Output is correct
18 Correct 1 ms 852 KB Output is correct
19 Correct 1 ms 980 KB Output is correct
20 Correct 1 ms 980 KB Output is correct
21 Correct 2 ms 980 KB Output is correct
22 Correct 61 ms 5268 KB Output is correct
23 Correct 53 ms 5180 KB Output is correct
24 Correct 40 ms 3452 KB Output is correct
25 Correct 55 ms 5168 KB Output is correct
26 Correct 45 ms 5276 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 852 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 1000 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 852 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 49 ms 5356 KB Output is correct
12 Correct 31 ms 3388 KB Output is correct
13 Correct 36 ms 3740 KB Output is correct
14 Correct 54 ms 5288 KB Output is correct
15 Correct 44 ms 5232 KB Output is correct
16 Correct 52 ms 5180 KB Output is correct
17 Correct 1 ms 852 KB Output is correct
18 Correct 1 ms 852 KB Output is correct
19 Correct 1 ms 980 KB Output is correct
20 Correct 1 ms 980 KB Output is correct
21 Correct 2 ms 980 KB Output is correct
22 Correct 61 ms 5268 KB Output is correct
23 Correct 53 ms 5180 KB Output is correct
24 Correct 40 ms 3452 KB Output is correct
25 Correct 55 ms 5168 KB Output is correct
26 Correct 45 ms 5276 KB Output is correct
27 Correct 1 ms 980 KB Output is correct
28 Correct 1 ms 980 KB Output is correct
29 Correct 1 ms 980 KB Output is correct
30 Correct 1 ms 980 KB Output is correct
31 Correct 4 ms 1108 KB Output is correct
32 Correct 1 ms 980 KB Output is correct
33 Correct 2 ms 980 KB Output is correct
34 Correct 104 ms 5152 KB Output is correct
35 Correct 92 ms 5012 KB Output is correct
36 Correct 122 ms 5228 KB Output is correct
37 Correct 91 ms 5248 KB Output is correct
38 Correct 51 ms 5192 KB Output is correct
39 Correct 33 ms 3156 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 852 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 1000 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 852 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 49 ms 5356 KB Output is correct
12 Correct 31 ms 3388 KB Output is correct
13 Correct 36 ms 3740 KB Output is correct
14 Correct 54 ms 5288 KB Output is correct
15 Correct 44 ms 5232 KB Output is correct
16 Correct 52 ms 5180 KB Output is correct
17 Correct 1 ms 852 KB Output is correct
18 Correct 1 ms 852 KB Output is correct
19 Correct 1 ms 980 KB Output is correct
20 Correct 1 ms 980 KB Output is correct
21 Correct 2 ms 980 KB Output is correct
22 Correct 61 ms 5268 KB Output is correct
23 Correct 53 ms 5180 KB Output is correct
24 Correct 40 ms 3452 KB Output is correct
25 Correct 55 ms 5168 KB Output is correct
26 Correct 45 ms 5276 KB Output is correct
27 Correct 1 ms 980 KB Output is correct
28 Correct 1 ms 980 KB Output is correct
29 Correct 1 ms 980 KB Output is correct
30 Correct 1 ms 980 KB Output is correct
31 Correct 4 ms 1108 KB Output is correct
32 Correct 1 ms 980 KB Output is correct
33 Correct 2 ms 980 KB Output is correct
34 Correct 104 ms 5152 KB Output is correct
35 Correct 92 ms 5012 KB Output is correct
36 Correct 122 ms 5228 KB Output is correct
37 Correct 91 ms 5248 KB Output is correct
38 Correct 51 ms 5192 KB Output is correct
39 Correct 33 ms 3156 KB Output is correct
40 Correct 4 ms 980 KB Output is correct
41 Correct 4 ms 1108 KB Output is correct
42 Correct 3 ms 1108 KB Output is correct
43 Correct 4 ms 1108 KB Output is correct
44 Correct 145 ms 5324 KB Output is correct
45 Correct 140 ms 5404 KB Output is correct
46 Correct 121 ms 5288 KB Output is correct
47 Correct 124 ms 5196 KB Output is correct
48 Correct 64 ms 5228 KB Output is correct

Subtask #7
0 / 27.0

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