oj.uz

답안 #592475

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
592475 2022-07-09T08:46:57 Z AA_Surely Team Contest (JOI22_team) C++17
35 / 100
 1293 ms 16212 KB 
#include <bits/stdc++.h>

#define FOR(i,x,n) 	for(LL i=x; i<n; i++)
#define F0R(i,n) 	FOR(i,0,n)
#define ROF(i,x,n) 	for(LL i=n-1; i>=x; i--)
#define R0F(i,n) 	ROF(i,0,n)

#define WTF 		cout << "WTF" << endl

#define IOS 		ios::sync_with_stdio(false); cin.tie(0)
#define F 			first
#define S	 		second
#define pb 			push_back

#define ALL(x) 		x.begin(), x.end()
#define RALL(x) 	x.rbegin(), x.rend()

using namespace std;
typedef long long 		LL;

typedef pair<int, int> 	PII;
typedef pair<LL, LL> 	PLL;

typedef vector<int> 	VI;
typedef vector<LL> 		VLL;
typedef vector<PII> 	VPII;
typedef vector<PLL> 	VPLL;

const int N = 2e5 + 7;
const int ALPHA = 27;
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
const int LOG = 22;

LL n;
LL a[N], b[N], c[N];
VPLL g[3][310];

void init() {
    cin >> n;
    F0R(i, n) cin >> a[i] >> b[i] >> c[i];
    return;
}

int main() {
    IOS;
    init();

    LL sum = -1;
    if(n <= 300) {
        F0R(j, n) F0R(i, n) F0R(k, n) {
            if(a[j] > max(a[i], a[k]) && b[i] > max(b[j], b[k]) && c[k] > max(c[j], c[i])) {
                sum = max(sum, a[j] + b[i] + c[k]);
            }
        }

        cout << sum;
        return 0;
    } 
    
    else {
        F0R(i, n) {
            g[0][a[i]].pb({b[i], c[i]});
            g[1][b[i]].pb({a[i], c[i]});
            g[2][c[i]].pb({a[i], b[i]});
        }

        F0R(j, 3) {
            F0R(x, 301) {
                sort(ALL(g[j][x]));
                FOR(i, 1, g[j][x].size())
                    g[j][x][i].S = min(g[j][x][i].S, g[j][x][i - 1].S);

                g[j][x].resize(unique(ALL(g[j][x])) - g[j][x].begin());							
            }			
        }

        FOR(i, 1, 301) {
            FOR(j, 1, 301) {
                FOR(k, 1, 301) {
                    LL l = 0, r = ((LL)g[0][i].size()) - 1, ans = -1, ans2 = -1, ans3 = -1;

                    while(l <= r) {
                        LL m = (l + r) >> 1;
                        if(g[0][i][m].F < j) {
                            ans = m;
                            l = m + 1;
                        } 
                        
                        else r = m - 1;
                    }

                    if(ans == -1) continue;
                    l = 0, r = ((LL)g[1][j].size()) - 1;

                    while(l <= r) {
                        LL m = (l + r) >> 1;
                        if(g[1][j][m].F < i) {
                            ans2 = m;
                            l = m + 1;
                        } 
                        
                        else r = m - 1;
                    }

                    if(ans2 == -1) continue;
                    l = 0, r = ((LL)g[2][k].size()) - 1;
                    while(l <= r) {
                        LL m = (l + r) >> 1;

                        if(g[2][k][m].F < i) {
                            ans3 = m;
                            l = m + 1;
                        } 
                        else r = m - 1;
                    }

                    if(ans3 == -1) continue;

                    if(g[0][i][ans].S < k && g[1][j][ans2].S < k && g[2][k][ans3].S < j) {

                        sum = max(sum, i + j + k);
                    }
                }
            }
        }

        cout << sum;
    }
}

Compilation message

team.cpp: In function 'int main()':
team.cpp:3:34: warning: comparison of integer expressions of different signedness: 'LL' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    3 | #define FOR(i,x,n)  for(LL i=x; i<n; i++)
......
   71 |                 FOR(i, 1, g[j][x].size())
      |                     ~~~~~~~~~~~~~~~~~~~~
team.cpp:71:17: note: in expansion of macro 'FOR'
   71 |                 FOR(i, 1, g[j][x].size())
      |                 ^~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 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 340 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 50 ms 380 KB Output is correct
15 Correct 20 ms 340 KB Output is correct
16 Correct 34 ms 356 KB Output is correct
17 Correct 49 ms 340 KB Output is correct
18 Correct 52 ms 340 KB Output is correct
19 Correct 49 ms 348 KB Output is correct
20 Correct 42 ms 360 KB Output is correct
21 Correct 26 ms 388 KB Output is correct
22 Correct 31 ms 360 KB Output is correct
23 Correct 20 ms 340 KB Output is correct
24 Correct 25 ms 340 KB Output is correct
25 Correct 26 ms 340 KB Output is correct

Subtask #2
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 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 340 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 50 ms 380 KB Output is correct
15 Correct 20 ms 340 KB Output is correct
16 Correct 34 ms 356 KB Output is correct
17 Correct 49 ms 340 KB Output is correct
18 Correct 52 ms 340 KB Output is correct
19 Correct 49 ms 348 KB Output is correct
20 Correct 42 ms 360 KB Output is correct
21 Correct 26 ms 388 KB Output is correct
22 Correct 31 ms 360 KB Output is correct
23 Correct 20 ms 340 KB Output is correct
24 Correct 25 ms 340 KB Output is correct
25 Correct 26 ms 340 KB Output is correct
26 Runtime error 2 ms 804 KB Execution killed with signal 11
27 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 352 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 74 ms 11984 KB Output is correct
12 Correct 52 ms 8856 KB Output is correct
13 Correct 61 ms 10116 KB Output is correct
14 Correct 79 ms 14036 KB Output is correct
15 Correct 67 ms 12924 KB Output is correct
16 Correct 62 ms 13252 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 352 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 74 ms 11984 KB Output is correct
12 Correct 52 ms 8856 KB Output is correct
13 Correct 61 ms 10116 KB Output is correct
14 Correct 79 ms 14036 KB Output is correct
15 Correct 67 ms 12924 KB Output is correct
16 Correct 62 ms 13252 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 356 KB Output is correct
20 Correct 37 ms 352 KB Output is correct
21 Correct 29 ms 468 KB Output is correct
22 Correct 92 ms 13140 KB Output is correct
23 Correct 90 ms 12440 KB Output is correct
24 Correct 68 ms 10252 KB Output is correct
25 Correct 89 ms 13832 KB Output is correct
26 Correct 71 ms 12520 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 352 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 74 ms 11984 KB Output is correct
12 Correct 52 ms 8856 KB Output is correct
13 Correct 61 ms 10116 KB Output is correct
14 Correct 79 ms 14036 KB Output is correct
15 Correct 67 ms 12924 KB Output is correct
16 Correct 62 ms 13252 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 356 KB Output is correct
20 Correct 37 ms 352 KB Output is correct
21 Correct 29 ms 468 KB Output is correct
22 Correct 92 ms 13140 KB Output is correct
23 Correct 90 ms 12440 KB Output is correct
24 Correct 68 ms 10252 KB Output is correct
25 Correct 89 ms 13832 KB Output is correct
26 Correct 71 ms 12520 KB Output is correct
27 Correct 47 ms 360 KB Output is correct
28 Correct 49 ms 356 KB Output is correct
29 Correct 29 ms 352 KB Output is correct
30 Correct 25 ms 340 KB Output is correct
31 Correct 328 ms 768 KB Output is correct
32 Correct 74 ms 444 KB Output is correct
33 Correct 71 ms 444 KB Output is correct
34 Correct 1282 ms 13660 KB Output is correct
35 Correct 1293 ms 15620 KB Output is correct
36 Correct 1264 ms 16212 KB Output is correct
37 Correct 924 ms 15200 KB Output is correct
38 Correct 99 ms 13352 KB Output is correct
39 Correct 49 ms 9764 KB Output is correct

Subtask #6
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 352 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 74 ms 11984 KB Output is correct
12 Correct 52 ms 8856 KB Output is correct
13 Correct 61 ms 10116 KB Output is correct
14 Correct 79 ms 14036 KB Output is correct
15 Correct 67 ms 12924 KB Output is correct
16 Correct 62 ms 13252 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 356 KB Output is correct
20 Correct 37 ms 352 KB Output is correct
21 Correct 29 ms 468 KB Output is correct
22 Correct 92 ms 13140 KB Output is correct
23 Correct 90 ms 12440 KB Output is correct
24 Correct 68 ms 10252 KB Output is correct
25 Correct 89 ms 13832 KB Output is correct
26 Correct 71 ms 12520 KB Output is correct
27 Correct 47 ms 360 KB Output is correct
28 Correct 49 ms 356 KB Output is correct
29 Correct 29 ms 352 KB Output is correct
30 Correct 25 ms 340 KB Output is correct
31 Correct 328 ms 768 KB Output is correct
32 Correct 74 ms 444 KB Output is correct
33 Correct 71 ms 444 KB Output is correct
34 Correct 1282 ms 13660 KB Output is correct
35 Correct 1293 ms 15620 KB Output is correct
36 Correct 1264 ms 16212 KB Output is correct
37 Correct 924 ms 15200 KB Output is correct
38 Correct 99 ms 13352 KB Output is correct
39 Correct 49 ms 9764 KB Output is correct
40 Runtime error 2 ms 596 KB Execution killed with signal 11
41 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 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 340 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 50 ms 380 KB Output is correct
15 Correct 20 ms 340 KB Output is correct
16 Correct 34 ms 356 KB Output is correct
17 Correct 49 ms 340 KB Output is correct
18 Correct 52 ms 340 KB Output is correct
19 Correct 49 ms 348 KB Output is correct
20 Correct 42 ms 360 KB Output is correct
21 Correct 26 ms 388 KB Output is correct
22 Correct 31 ms 360 KB Output is correct
23 Correct 20 ms 340 KB Output is correct
24 Correct 25 ms 340 KB Output is correct
25 Correct 26 ms 340 KB Output is correct
26 Runtime error 2 ms 804 KB Execution killed with signal 11
27 Halted 0 ms 0 KB -