oj.uz

답안 #549937

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
549937 2022-04-16T21:31:17 Z BalintR Team Contest (JOI22_team) C++17
73 / 100
 2000 ms 43904 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;}

template<typename T, int MSZ>
struct SegTree {
    T data[MSZ*2];
    int sz = MSZ;
    static constexpr T unit = 0;

    inline T merge(T t1, T t2){
        return max(t1, t2);
    }

    void build(){
        for (int i = sz-1; i > 0; --i){
            data[i] = merge(data[i*2], data[i*2+1]);
        }
    }

    void update(int p, T v){
        p += sz;
        data[p] = max(data[p], v);
        for (; p >>= 1;){
            data[p] = merge(data[p*2], data[p*2+1]);
        }
    }

    // Query range [l, r)
    T query(int l, int r){
        T resL = unit, resR = unit;
        for (l += sz, r += sz; l < r; l >>= 1, r >>= 1) {
            if(l&1) resL = merge(resL, data[l++]);
            if(r&1) resR = merge(data[--r], resR);
        }
        return merge(resL, resR);
    }

    // Access the last layer of the segment tree
    inline T& operator[](int i){
        return data[i + sz];
    }
};

typedef array<int, 3> trip;

const int MN = 150005;
int n;
vector<trip> vec;
vi ys, zs;
SegTree<int, MN> mxZPref, mxYPref;
int mxZ[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];

    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 = mxZPref.query(0, yPos);
                if(mz > z) mxZ[yPos] = max(mxZ[yPos], mz);
                mxYPref.update(zPos, y);
                mxYPref[zPos] = max(mxYPref[zPos], y);

                int mxY = mxYPref.query(0, zPos);
                if(mxY > y){
                    int yp1 = lbv(ys, mxY);
                    mxZ[yp1] = max(mxZ[yp1], z);
                }
                mxZPref.update(yPos, z);
            }

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

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

        FOR(j, yPos+1, n) mxSum = max(mxSum, (ys[j] + mxZ[j]) * (mxZ[j] > z));
        if(mxSum) ans = max(ans, mxSum + x);
    }

    if(ans == -1) vi vec(1e7, 1234);

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

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 15 ms 39408 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 15 ms 39460 KB Output is correct
6 Correct 15 ms 39508 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 17 ms 39360 KB Output is correct
9 Correct 15 ms 39508 KB Output is correct
10 Correct 15 ms 39496 KB Output is correct
11 Correct 16 ms 39392 KB Output is correct
12 Correct 16 ms 39380 KB Output is correct
13 Correct 16 ms 39508 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 16 ms 39552 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 19 ms 39444 KB Output is correct
21 Correct 17 ms 39508 KB Output is correct
22 Correct 18 ms 39560 KB Output is correct
23 Correct 17 ms 39508 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 15 ms 39408 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 15 ms 39460 KB Output is correct
6 Correct 15 ms 39508 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 17 ms 39360 KB Output is correct
9 Correct 15 ms 39508 KB Output is correct
10 Correct 15 ms 39496 KB Output is correct
11 Correct 16 ms 39392 KB Output is correct
12 Correct 16 ms 39380 KB Output is correct
13 Correct 16 ms 39508 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 16 ms 39552 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 19 ms 39444 KB Output is correct
21 Correct 17 ms 39508 KB Output is correct
22 Correct 18 ms 39560 KB Output is correct
23 Correct 17 ms 39508 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 6 ms 596 KB Output is correct
27 Correct 5 ms 468 KB Output is correct
28 Correct 5 ms 468 KB Output is correct
29 Correct 19 ms 39636 KB Output is correct
30 Correct 4 ms 468 KB Output is correct
31 Correct 4 ms 468 KB Output is correct
32 Correct 19 ms 39636 KB Output is correct
33 Correct 17 ms 39624 KB Output is correct
34 Correct 20 ms 39664 KB Output is correct
35 Correct 1 ms 424 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 4 ms 456 KB Output is correct
38 Correct 4 ms 468 KB Output is correct
39 Correct 2 ms 340 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 17 ms 39508 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 17 ms 39440 KB Output is correct
6 Correct 16 ms 39508 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 16 ms 39372 KB Output is correct
9 Correct 17 ms 39508 KB Output is correct
10 Correct 16 ms 39488 KB Output is correct
11 Correct 49 ms 4732 KB Output is correct
12 Correct 30 ms 2812 KB Output is correct
13 Correct 34 ms 3220 KB Output is correct
14 Correct 60 ms 43820 KB Output is correct
15 Correct 56 ms 43732 KB Output is correct
16 Correct 55 ms 43672 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 17 ms 39508 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 17 ms 39440 KB Output is correct
6 Correct 16 ms 39508 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 16 ms 39372 KB Output is correct
9 Correct 17 ms 39508 KB Output is correct
10 Correct 16 ms 39488 KB Output is correct
11 Correct 49 ms 4732 KB Output is correct
12 Correct 30 ms 2812 KB Output is correct
13 Correct 34 ms 3220 KB Output is correct
14 Correct 60 ms 43820 KB Output is correct
15 Correct 56 ms 43732 KB Output is correct
16 Correct 55 ms 43672 KB Output is correct
17 Correct 15 ms 39380 KB Output is correct
18 Correct 15 ms 39484 KB Output is correct
19 Correct 15 ms 39524 KB Output is correct
20 Correct 16 ms 39508 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 57 ms 4712 KB Output is correct
23 Correct 54 ms 4732 KB Output is correct
24 Correct 38 ms 2928 KB Output is correct
25 Correct 75 ms 43736 KB Output is correct
26 Correct 69 ms 43756 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 17 ms 39508 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 17 ms 39440 KB Output is correct
6 Correct 16 ms 39508 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 16 ms 39372 KB Output is correct
9 Correct 17 ms 39508 KB Output is correct
10 Correct 16 ms 39488 KB Output is correct
11 Correct 49 ms 4732 KB Output is correct
12 Correct 30 ms 2812 KB Output is correct
13 Correct 34 ms 3220 KB Output is correct
14 Correct 60 ms 43820 KB Output is correct
15 Correct 56 ms 43732 KB Output is correct
16 Correct 55 ms 43672 KB Output is correct
17 Correct 15 ms 39380 KB Output is correct
18 Correct 15 ms 39484 KB Output is correct
19 Correct 15 ms 39524 KB Output is correct
20 Correct 16 ms 39508 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 57 ms 4712 KB Output is correct
23 Correct 54 ms 4732 KB Output is correct
24 Correct 38 ms 2928 KB Output is correct
25 Correct 75 ms 43736 KB Output is correct
26 Correct 69 ms 43756 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 19 ms 39672 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 109 ms 4760 KB Output is correct
35 Correct 88 ms 4732 KB Output is correct
36 Correct 98 ms 4720 KB Output is correct
37 Correct 100 ms 43748 KB Output is correct
38 Correct 64 ms 43768 KB Output is correct
39 Correct 46 ms 41712 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 17 ms 39508 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 17 ms 39440 KB Output is correct
6 Correct 16 ms 39508 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 16 ms 39372 KB Output is correct
9 Correct 17 ms 39508 KB Output is correct
10 Correct 16 ms 39488 KB Output is correct
11 Correct 49 ms 4732 KB Output is correct
12 Correct 30 ms 2812 KB Output is correct
13 Correct 34 ms 3220 KB Output is correct
14 Correct 60 ms 43820 KB Output is correct
15 Correct 56 ms 43732 KB Output is correct
16 Correct 55 ms 43672 KB Output is correct
17 Correct 15 ms 39380 KB Output is correct
18 Correct 15 ms 39484 KB Output is correct
19 Correct 15 ms 39524 KB Output is correct
20 Correct 16 ms 39508 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 57 ms 4712 KB Output is correct
23 Correct 54 ms 4732 KB Output is correct
24 Correct 38 ms 2928 KB Output is correct
25 Correct 75 ms 43736 KB Output is correct
26 Correct 69 ms 43756 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 19 ms 39672 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 109 ms 4760 KB Output is correct
35 Correct 88 ms 4732 KB Output is correct
36 Correct 98 ms 4720 KB Output is correct
37 Correct 100 ms 43748 KB Output is correct
38 Correct 64 ms 43768 KB Output is correct
39 Correct 46 ms 41712 KB Output is correct
40 Correct 5 ms 468 KB Output is correct
41 Correct 4 ms 468 KB Output is correct
42 Correct 3 ms 468 KB Output is correct
43 Correct 4 ms 468 KB Output is correct
44 Correct 227 ms 4900 KB Output is correct
45 Correct 164 ms 4724 KB Output is correct
46 Correct 197 ms 4844 KB Output is correct
47 Correct 183 ms 43904 KB Output is correct
48 Correct 78 ms 43812 KB Output is correct

Subtask #7
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 15 ms 39408 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 15 ms 39460 KB Output is correct
6 Correct 15 ms 39508 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 17 ms 39360 KB Output is correct
9 Correct 15 ms 39508 KB Output is correct
10 Correct 15 ms 39496 KB Output is correct
11 Correct 16 ms 39392 KB Output is correct
12 Correct 16 ms 39380 KB Output is correct
13 Correct 16 ms 39508 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 16 ms 39552 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 19 ms 39444 KB Output is correct
21 Correct 17 ms 39508 KB Output is correct
22 Correct 18 ms 39560 KB Output is correct
23 Correct 17 ms 39508 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 6 ms 596 KB Output is correct
27 Correct 5 ms 468 KB Output is correct
28 Correct 5 ms 468 KB Output is correct
29 Correct 19 ms 39636 KB Output is correct
30 Correct 4 ms 468 KB Output is correct
31 Correct 4 ms 468 KB Output is correct
32 Correct 19 ms 39636 KB Output is correct
33 Correct 17 ms 39624 KB Output is correct
34 Correct 20 ms 39664 KB Output is correct
35 Correct 1 ms 424 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 4 ms 456 KB Output is correct
38 Correct 4 ms 468 KB Output is correct
39 Correct 2 ms 340 KB Output is correct
40 Correct 0 ms 340 KB Output is correct
41 Correct 0 ms 340 KB Output is correct
42 Correct 17 ms 39508 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 17 ms 39440 KB Output is correct
45 Correct 16 ms 39508 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 16 ms 39372 KB Output is correct
48 Correct 17 ms 39508 KB Output is correct
49 Correct 16 ms 39488 KB Output is correct
50 Correct 49 ms 4732 KB Output is correct
51 Correct 30 ms 2812 KB Output is correct
52 Correct 34 ms 3220 KB Output is correct
53 Correct 60 ms 43820 KB Output is correct
54 Correct 56 ms 43732 KB Output is correct
55 Correct 55 ms 43672 KB Output is correct
56 Correct 15 ms 39380 KB Output is correct
57 Correct 15 ms 39484 KB Output is correct
58 Correct 15 ms 39524 KB Output is correct
59 Correct 16 ms 39508 KB Output is correct
60 Correct 1 ms 468 KB Output is correct
61 Correct 57 ms 4712 KB Output is correct
62 Correct 54 ms 4732 KB Output is correct
63 Correct 38 ms 2928 KB Output is correct
64 Correct 75 ms 43736 KB Output is correct
65 Correct 69 ms 43756 KB Output is correct
66 Correct 1 ms 340 KB Output is correct
67 Correct 1 ms 340 KB Output is correct
68 Correct 1 ms 340 KB Output is correct
69 Correct 1 ms 340 KB Output is correct
70 Correct 19 ms 39672 KB Output is correct
71 Correct 1 ms 340 KB Output is correct
72 Correct 1 ms 340 KB Output is correct
73 Correct 109 ms 4760 KB Output is correct
74 Correct 88 ms 4732 KB Output is correct
75 Correct 98 ms 4720 KB Output is correct
76 Correct 100 ms 43748 KB Output is correct
77 Correct 64 ms 43768 KB Output is correct
78 Correct 46 ms 41712 KB Output is correct
79 Correct 5 ms 468 KB Output is correct
80 Correct 4 ms 468 KB Output is correct
81 Correct 3 ms 468 KB Output is correct
82 Correct 4 ms 468 KB Output is correct
83 Correct 227 ms 4900 KB Output is correct
84 Correct 164 ms 4724 KB Output is correct
85 Correct 197 ms 4844 KB Output is correct
86 Correct 183 ms 43904 KB Output is correct
87 Correct 78 ms 43812 KB Output is correct
88 Execution timed out 2083 ms 7544 KB Time limit exceeded
89 Halted 0 ms 0 KB -