답안 #549912

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
549912 2022-04-16T20:13:49 Z BalintR Team Contest (JOI22_team) C++17
73 / 100
857 ms 9780 KB
#include <bits/stdc++.h>
using namespace std;

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 = 4005;
int n;
vector<trip> vec;
vi ys;
int mxZPref[MN], mnZ[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);
    }

    UNIQUE(vec);
    UNIQUE(ys);

    ms(mnZ, INF);

    int ans = -1;
    n = SZ(ys);

    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);
                mnZ[yPos] = min(mnZ[yPos], z);
                FOR(k, yPos, n) mxZPref[k] = max(mxZPref[k], z);
            }
            prvX = vec[i][0];
            lst = i;
        }

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

        //dbgArr(mxZPref, n);
        //dbgArr(mnZ, n);

        FOR(j, yPos+1, n) mxSum = max(mxSum, (ys[j] + mxZPref[j-1]) * (mxZPref[j-1] > mnZ[j]) * (mxZPref[j-1] > z));
        //dbg(mxSum);
        if(mxSum) ans = max(ans, mxSum + x);
    }

    cout << ans << '\n';
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 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 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 1 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 320 KB Output is correct
13 Correct 1 ms 340 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 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 324 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 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 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 1 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 320 KB Output is correct
13 Correct 1 ms 340 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 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 324 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 22 ms 468 KB Output is correct
27 Correct 16 ms 456 KB Output is correct
28 Correct 13 ms 460 KB Output is correct
29 Correct 13 ms 468 KB Output is correct
30 Correct 7 ms 332 KB Output is correct
31 Correct 9 ms 340 KB Output is correct
32 Correct 3 ms 340 KB Output is correct
33 Correct 3 ms 468 KB Output is correct
34 Correct 23 ms 468 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 8 ms 468 KB Output is correct
38 Correct 9 ms 496 KB Output is correct
39 Correct 1 ms 324 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 320 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 51 ms 4888 KB Output is correct
12 Correct 30 ms 2816 KB Output is correct
13 Correct 31 ms 3476 KB Output is correct
14 Correct 43 ms 5128 KB Output is correct
15 Correct 43 ms 4796 KB Output is correct
16 Correct 40 ms 4976 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 320 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 51 ms 4888 KB Output is correct
12 Correct 30 ms 2816 KB Output is correct
13 Correct 31 ms 3476 KB Output is correct
14 Correct 43 ms 5128 KB Output is correct
15 Correct 43 ms 4796 KB Output is correct
16 Correct 40 ms 4976 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 280 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 58 ms 5152 KB Output is correct
23 Correct 53 ms 5176 KB Output is correct
24 Correct 39 ms 3100 KB Output is correct
25 Correct 57 ms 5220 KB Output is correct
26 Correct 45 ms 5228 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 320 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 51 ms 4888 KB Output is correct
12 Correct 30 ms 2816 KB Output is correct
13 Correct 31 ms 3476 KB Output is correct
14 Correct 43 ms 5128 KB Output is correct
15 Correct 43 ms 4796 KB Output is correct
16 Correct 40 ms 4976 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 280 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 58 ms 5152 KB Output is correct
23 Correct 53 ms 5176 KB Output is correct
24 Correct 39 ms 3100 KB Output is correct
25 Correct 57 ms 5220 KB Output is correct
26 Correct 45 ms 5228 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 320 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 4 ms 468 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 120 ms 5248 KB Output is correct
35 Correct 113 ms 5324 KB Output is correct
36 Correct 126 ms 5316 KB Output is correct
37 Correct 87 ms 6012 KB Output is correct
38 Correct 48 ms 5432 KB Output is correct
39 Correct 50 ms 2828 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 320 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 51 ms 4888 KB Output is correct
12 Correct 30 ms 2816 KB Output is correct
13 Correct 31 ms 3476 KB Output is correct
14 Correct 43 ms 5128 KB Output is correct
15 Correct 43 ms 4796 KB Output is correct
16 Correct 40 ms 4976 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 280 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 58 ms 5152 KB Output is correct
23 Correct 53 ms 5176 KB Output is correct
24 Correct 39 ms 3100 KB Output is correct
25 Correct 57 ms 5220 KB Output is correct
26 Correct 45 ms 5228 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 320 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 4 ms 468 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 120 ms 5248 KB Output is correct
35 Correct 113 ms 5324 KB Output is correct
36 Correct 126 ms 5316 KB Output is correct
37 Correct 87 ms 6012 KB Output is correct
38 Correct 48 ms 5432 KB Output is correct
39 Correct 50 ms 2828 KB Output is correct
40 Correct 7 ms 468 KB Output is correct
41 Correct 9 ms 488 KB Output is correct
42 Correct 8 ms 340 KB Output is correct
43 Correct 9 ms 460 KB Output is correct
44 Correct 796 ms 6428 KB Output is correct
45 Correct 583 ms 6280 KB Output is correct
46 Correct 857 ms 5884 KB Output is correct
47 Correct 609 ms 6400 KB Output is correct
48 Correct 65 ms 6304 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 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 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 1 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 320 KB Output is correct
13 Correct 1 ms 340 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 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 324 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 22 ms 468 KB Output is correct
27 Correct 16 ms 456 KB Output is correct
28 Correct 13 ms 460 KB Output is correct
29 Correct 13 ms 468 KB Output is correct
30 Correct 7 ms 332 KB Output is correct
31 Correct 9 ms 340 KB Output is correct
32 Correct 3 ms 340 KB Output is correct
33 Correct 3 ms 468 KB Output is correct
34 Correct 23 ms 468 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 8 ms 468 KB Output is correct
38 Correct 9 ms 496 KB Output is correct
39 Correct 1 ms 324 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 340 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 0 ms 340 KB Output is correct
46 Correct 1 ms 324 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 0 ms 320 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 51 ms 4888 KB Output is correct
51 Correct 30 ms 2816 KB Output is correct
52 Correct 31 ms 3476 KB Output is correct
53 Correct 43 ms 5128 KB Output is correct
54 Correct 43 ms 4796 KB Output is correct
55 Correct 40 ms 4976 KB Output is correct
56 Correct 0 ms 340 KB Output is correct
57 Correct 1 ms 280 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 332 KB Output is correct
61 Correct 58 ms 5152 KB Output is correct
62 Correct 53 ms 5176 KB Output is correct
63 Correct 39 ms 3100 KB Output is correct
64 Correct 57 ms 5220 KB Output is correct
65 Correct 45 ms 5228 KB Output is correct
66 Correct 1 ms 340 KB Output is correct
67 Correct 0 ms 340 KB Output is correct
68 Correct 1 ms 320 KB Output is correct
69 Correct 1 ms 340 KB Output is correct
70 Correct 4 ms 468 KB Output is correct
71 Correct 1 ms 332 KB Output is correct
72 Correct 1 ms 340 KB Output is correct
73 Correct 120 ms 5248 KB Output is correct
74 Correct 113 ms 5324 KB Output is correct
75 Correct 126 ms 5316 KB Output is correct
76 Correct 87 ms 6012 KB Output is correct
77 Correct 48 ms 5432 KB Output is correct
78 Correct 50 ms 2828 KB Output is correct
79 Correct 7 ms 468 KB Output is correct
80 Correct 9 ms 488 KB Output is correct
81 Correct 8 ms 340 KB Output is correct
82 Correct 9 ms 460 KB Output is correct
83 Correct 796 ms 6428 KB Output is correct
84 Correct 583 ms 6280 KB Output is correct
85 Correct 857 ms 5884 KB Output is correct
86 Correct 609 ms 6400 KB Output is correct
87 Correct 65 ms 6304 KB Output is correct
88 Runtime error 71 ms 9780 KB Execution killed with signal 11
89 Halted 0 ms 0 KB -