oj.uz

답안 #892603

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
892603 2023-12-25T15:08:04 Z smartmonky Team Contest (JOI22_team) C++14
100 / 100
 350 ms 109276 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
 
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
#define rnd(l, r) uniform_int_distribution<int>(l, r)(rng)
 
using namespace std;

void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);} 
int pow(int a,int b,int m){int ans=1;while(b){if(b&1){ans=(ans*a)%m;}b>>=1;a=(a*a)%m;}return ans;}
int binpow(int a,int b){int ans=1;while(b){if(b&1){ans=(ans*a);}b>>=1;a=(a*a);}return ans;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
const int N = 1e5, maxn =200005, inf = 2e9, MXN = 1e8 + 2;

struct node{
    int mn;
    node *l, *r;
    node(){
        mn = -1e9;
        l = nullptr;
        r = nullptr;
    }
};
void update(node *&p, int pos, int val, int tl = 1, int tr = MXN){
    if(p == nullptr){
        p = new node();
    }
    if(tl == tr){
        p -> mn = max(p -> mn, val);
        return;
    }
    int mid = (tl + tr) >> 1;
    if(pos > mid)
        update(p -> r, pos, val, mid + 1, tr);
    else
        update(p -> l, pos, val, tl, mid);
    int left = -1e9;
    if(p -> l != nullptr)
        left = p -> l -> mn;
    int right = -1e9;
    if(p -> r != nullptr)
        right = p -> r -> mn;
    p -> mn = max(left, right);
}
int get(node *p, int l, int r, int tl = 1, int tr = MXN){
	if(p == nullptr){
		return -1e9;
    }
    if(tl > r || tr < l || l > r)
        return -1e9;
    if(tl >= l && tr <= r)
        return p -> mn;
    int mid = (tl + tr) >> 1;
    return max(get(p -> r, l, r, mid + 1, tr), get(p -> l, l, r, tl, mid));
}
int n;

void solve(vector <pair <int, pair <int,int > > > vp, int &ans){
	vector <pair <int,int > > pref(n);
	int pivot = 0;
	node *root = new node();
	for(int i = 0; i < n; i++){;
		while(pivot < i && vp[pivot].ff != vp[i].ff){
			pref[pivot] = {-inf, -inf};
			if(pivot)pref[pivot] = pref[pivot - 1];
			update(root, vp[pivot].ss.ff, vp[pivot].ss.ss);
			int x = get(root, 1, vp[pivot].ss.ff - 1);
			if(x > vp[pivot].ss.ss)
				pref[pivot] = max(pref[pivot], {vp[pivot].ss.ff, x});
			pivot++;
		}
		if(pivot > 0){
			if(pref[pivot - 1].ff > vp[i].ss.ff && pref[pivot - 1].ss > vp[i].ss.ss){
				ans = max(vp[i].ff + pref[pivot - 1].ff + pref[pivot - 1].ss , ans);
			}
		}
	}
}
main(){
	iostream::sync_with_stdio(false);	
    cin.tie(nullptr);
    cout.tie(nullptr);
    cin >> n;
	vector <pair <int, pair <int,int > > > vp(n);
	for(int i = 0; i < n; i++){
		cin >> vp[i].ff >> vp[i].ss.ff >> vp[i].ss.ss;
	}
	sort(all(vp));
	int ans = -1;
	solve(vp, ans);
	
	for(int i = 0; i < n; i++){
		swap(vp[i].ss.ff, vp[i].ss.ss);
	}
	solve(vp, ans);
	cout <<  ans << endl;
}
/*
 * Before implementing the problem:
	
	Do I understand the problem correctly?
	Which places are tricky? What do I need to remember to implement them correctly?
	Which place is the heaviest by implementation? Can I do it simpler?
	Which place is the slowest? Where do I need to be careful about constant factors and where I can choose slower but simpler implementation?
	----------------------------------
	If not AC:
 
	Did you remember to do everything to handle the tricky places you thought about before?
	Is the solution correct?
	Do I understand the problem correctly?
	----------------------------------
	If you have a test on which the solution gives wrong answer:
 
	Is the solution doing what it was supposed to do?
	Is the problem in the code or in the idea?
*/

Compilation message

team.cpp:86:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   86 | main(){
      | ^~~~
team.cpp: In function 'void fp(std::string)':
team.cpp:15:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
team.cpp:15:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 11 ms 4444 KB Output is correct
27 Correct 8 ms 3160 KB Output is correct
28 Correct 7 ms 2908 KB Output is correct
29 Correct 7 ms 2396 KB Output is correct
30 Correct 3 ms 856 KB Output is correct
31 Correct 4 ms 856 KB Output is correct
32 Correct 3 ms 604 KB Output is correct
33 Correct 2 ms 700 KB Output is correct
34 Correct 8 ms 4444 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 3 ms 860 KB Output is correct
38 Correct 4 ms 860 KB Output is correct
39 Correct 2 ms 348 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 352 KB Output is correct
4 Correct 0 ms 352 KB Output is correct
5 Correct 0 ms 356 KB Output is correct
6 Correct 0 ms 356 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 352 KB Output is correct
9 Correct 0 ms 356 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 80 ms 9848 KB Output is correct
12 Correct 54 ms 6680 KB Output is correct
13 Correct 52 ms 8280 KB Output is correct
14 Correct 72 ms 9816 KB Output is correct
15 Correct 44 ms 9848 KB Output is correct
16 Correct 24 ms 9840 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 352 KB Output is correct
4 Correct 0 ms 352 KB Output is correct
5 Correct 0 ms 356 KB Output is correct
6 Correct 0 ms 356 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 352 KB Output is correct
9 Correct 0 ms 356 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 80 ms 9848 KB Output is correct
12 Correct 54 ms 6680 KB Output is correct
13 Correct 52 ms 8280 KB Output is correct
14 Correct 72 ms 9816 KB Output is correct
15 Correct 44 ms 9848 KB Output is correct
16 Correct 24 ms 9840 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 96 ms 9840 KB Output is correct
23 Correct 90 ms 9552 KB Output is correct
24 Correct 69 ms 7260 KB Output is correct
25 Correct 90 ms 9808 KB Output is correct
26 Correct 42 ms 9820 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 352 KB Output is correct
4 Correct 0 ms 352 KB Output is correct
5 Correct 0 ms 356 KB Output is correct
6 Correct 0 ms 356 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 352 KB Output is correct
9 Correct 0 ms 356 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 80 ms 9848 KB Output is correct
12 Correct 54 ms 6680 KB Output is correct
13 Correct 52 ms 8280 KB Output is correct
14 Correct 72 ms 9816 KB Output is correct
15 Correct 44 ms 9848 KB Output is correct
16 Correct 24 ms 9840 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 96 ms 9840 KB Output is correct
23 Correct 90 ms 9552 KB Output is correct
24 Correct 69 ms 7260 KB Output is correct
25 Correct 90 ms 9808 KB Output is correct
26 Correct 42 ms 9820 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 3 ms 552 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 111 ms 9424 KB Output is correct
35 Correct 99 ms 8856 KB Output is correct
36 Correct 107 ms 9880 KB Output is correct
37 Correct 104 ms 9632 KB Output is correct
38 Correct 54 ms 9664 KB Output is correct
39 Correct 21 ms 6036 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 352 KB Output is correct
4 Correct 0 ms 352 KB Output is correct
5 Correct 0 ms 356 KB Output is correct
6 Correct 0 ms 356 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 352 KB Output is correct
9 Correct 0 ms 356 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 80 ms 9848 KB Output is correct
12 Correct 54 ms 6680 KB Output is correct
13 Correct 52 ms 8280 KB Output is correct
14 Correct 72 ms 9816 KB Output is correct
15 Correct 44 ms 9848 KB Output is correct
16 Correct 24 ms 9840 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 96 ms 9840 KB Output is correct
23 Correct 90 ms 9552 KB Output is correct
24 Correct 69 ms 7260 KB Output is correct
25 Correct 90 ms 9808 KB Output is correct
26 Correct 42 ms 9820 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 3 ms 552 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 111 ms 9424 KB Output is correct
35 Correct 99 ms 8856 KB Output is correct
36 Correct 107 ms 9880 KB Output is correct
37 Correct 104 ms 9632 KB Output is correct
38 Correct 54 ms 9664 KB Output is correct
39 Correct 21 ms 6036 KB Output is correct
40 Correct 3 ms 860 KB Output is correct
41 Correct 4 ms 860 KB Output is correct
42 Correct 3 ms 856 KB Output is correct
43 Correct 5 ms 860 KB Output is correct
44 Correct 132 ms 10596 KB Output is correct
45 Correct 124 ms 10092 KB Output is correct
46 Correct 127 ms 10340 KB Output is correct
47 Correct 145 ms 10348 KB Output is correct
48 Correct 53 ms 9628 KB Output is correct

Subtask #7
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 11 ms 4444 KB Output is correct
27 Correct 8 ms 3160 KB Output is correct
28 Correct 7 ms 2908 KB Output is correct
29 Correct 7 ms 2396 KB Output is correct
30 Correct 3 ms 856 KB Output is correct
31 Correct 4 ms 856 KB Output is correct
32 Correct 3 ms 604 KB Output is correct
33 Correct 2 ms 700 KB Output is correct
34 Correct 8 ms 4444 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 3 ms 860 KB Output is correct
38 Correct 4 ms 860 KB Output is correct
39 Correct 2 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 352 KB Output is correct
43 Correct 0 ms 352 KB Output is correct
44 Correct 0 ms 356 KB Output is correct
45 Correct 0 ms 356 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 0 ms 352 KB Output is correct
48 Correct 0 ms 356 KB Output is correct
49 Correct 1 ms 344 KB Output is correct
50 Correct 80 ms 9848 KB Output is correct
51 Correct 54 ms 6680 KB Output is correct
52 Correct 52 ms 8280 KB Output is correct
53 Correct 72 ms 9816 KB Output is correct
54 Correct 44 ms 9848 KB Output is correct
55 Correct 24 ms 9840 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 2 ms 348 KB Output is correct
61 Correct 96 ms 9840 KB Output is correct
62 Correct 90 ms 9552 KB Output is correct
63 Correct 69 ms 7260 KB Output is correct
64 Correct 90 ms 9808 KB Output is correct
65 Correct 42 ms 9820 KB Output is correct
66 Correct 1 ms 344 KB Output is correct
67 Correct 0 ms 348 KB Output is correct
68 Correct 0 ms 348 KB Output is correct
69 Correct 1 ms 348 KB Output is correct
70 Correct 3 ms 552 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 1 ms 348 KB Output is correct
73 Correct 111 ms 9424 KB Output is correct
74 Correct 99 ms 8856 KB Output is correct
75 Correct 107 ms 9880 KB Output is correct
76 Correct 104 ms 9632 KB Output is correct
77 Correct 54 ms 9664 KB Output is correct
78 Correct 21 ms 6036 KB Output is correct
79 Correct 3 ms 860 KB Output is correct
80 Correct 4 ms 860 KB Output is correct
81 Correct 3 ms 856 KB Output is correct
82 Correct 5 ms 860 KB Output is correct
83 Correct 132 ms 10596 KB Output is correct
84 Correct 124 ms 10092 KB Output is correct
85 Correct 127 ms 10340 KB Output is correct
86 Correct 145 ms 10348 KB Output is correct
87 Correct 53 ms 9628 KB Output is correct
88 Correct 350 ms 109276 KB Output is correct
89 Correct 287 ms 69032 KB Output is correct
90 Correct 329 ms 75412 KB Output is correct
91 Correct 245 ms 59584 KB Output is correct
92 Correct 153 ms 13416 KB Output is correct
93 Correct 189 ms 23696 KB Output is correct
94 Correct 152 ms 17468 KB Output is correct
95 Correct 62 ms 9836 KB Output is correct
96 Correct 236 ms 109100 KB Output is correct
97 Correct 37 ms 9840 KB Output is correct
98 Correct 124 ms 15976 KB Output is correct
99 Correct 123 ms 15976 KB Output is correct