oj.uz

Submission #892273

# Submission time Handle Problem Language Result Execution time Memory
892273 2023-12-25T06:20:20 Z vjudge1 Team Contest (JOI22_team) C++17
55 / 100
 2000 ms 19892 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 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 = 2e8 + 10, maxn =200005, inf = 2e9, MXN = 1e8 + 2;

int a[N];
int n;
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));
}

main(){
	iostream::sync_with_stdio(false);	
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n;
    cin >> n;
    node *root = new node();
	vector <pair <int, pair <int,int > > > vp(n);
	map <pair <int,int>, int> mp, mn;
	set<pair <int, pair <int,int > > > st;
	for(int i = 0; i < n; i++){
		cin >> vp[i].ff >> vp[i].ss.ff >> vp[i].ss.ss;
		st.insert(vp[i]);
		mp[{vp[i].ff, vp[i].ss.ff}] = max(mp[{vp[i].ff, vp[i].ss.ff}], vp[i].ss.ss);
		if(!mn.count({vp[i].ff, vp[i].ss.ff})){
			mn[{vp[i].ff, vp[i].ss.ff}] = vp[i].ss.ss;
		}else{
			mn[{vp[i].ff, vp[i].ss.ff}] = min(mn[{vp[i].ff, vp[i].ss.ff}], vp[i].ss.ss);
		}
	}
	vp.clear();
	for(auto x : st){
		if(mp[{x.ff, x.ss.ff}] != x.ss.ss &&  mn[{x.ff, x.ss.ff}] != x.ss.ss)continue;
		vp.pb(x);
	}
	n = vp.size();
	sort(all(vp));
	int ans = -1;
	int pivot = 0;
	for(int i = 0; i < n; i++){
		while(pivot < i && vp[pivot].ff != vp[i].ff){
			update(root, vp[pivot].ss.ff, vp[pivot].ss.ss);
			pivot++;
		} 
		int sum = vp[i].ff;
		for(int l  = 0; l < pivot; l++){
			if(vp[i].ss.ff >= vp[l].ss.ff)continue;
			int x = get(root, 1,  vp[l].ss.ff - 1);
			if(x <= max(vp[i].ss.ss, vp[l].ss.ss))continue;
			ans = max(ans, sum + vp[l].ss.ff + x);
		}
	}
	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:65:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   65 | main(){
      | ^~~~
team.cpp: In function 'void fp(std::string)':
team.cpp:14:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
team.cpp:14:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 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 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 4 ms 604 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 2 ms 600 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 0 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 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 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 4 ms 604 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 2 ms 600 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 0 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 814 ms 3396 KB Output is correct
27 Correct 594 ms 2472 KB Output is correct
28 Correct 503 ms 2384 KB Output is correct
29 Correct 306 ms 2056 KB Output is correct
30 Correct 163 ms 1092 KB Output is correct
31 Correct 393 ms 1116 KB Output is correct
32 Correct 271 ms 1116 KB Output is correct
33 Correct 73 ms 856 KB Output is correct
34 Correct 13 ms 3160 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 6 ms 1176 KB Output is correct
38 Correct 8 ms 1116 KB Output is correct
39 Correct 14 ms 604 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 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 31 ms 2252 KB Output is correct
12 Correct 19 ms 1628 KB Output is correct
13 Correct 21 ms 1884 KB Output is correct
14 Correct 29 ms 2252 KB Output is correct
15 Correct 23 ms 2140 KB Output is correct
16 Correct 19 ms 2248 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 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 31 ms 2252 KB Output is correct
12 Correct 19 ms 1628 KB Output is correct
13 Correct 21 ms 1884 KB Output is correct
14 Correct 29 ms 2252 KB Output is correct
15 Correct 23 ms 2140 KB Output is correct
16 Correct 19 ms 2248 KB Output is correct
17 Correct 1 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 1 ms 348 KB Output is correct
21 Correct 14 ms 604 KB Output is correct
22 Correct 85 ms 2904 KB Output is correct
23 Correct 54 ms 2136 KB Output is correct
24 Correct 44 ms 1624 KB Output is correct
25 Correct 59 ms 2328 KB Output is correct
26 Correct 26 ms 2136 KB Output is correct

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 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 31 ms 2252 KB Output is correct
12 Correct 19 ms 1628 KB Output is correct
13 Correct 21 ms 1884 KB Output is correct
14 Correct 29 ms 2252 KB Output is correct
15 Correct 23 ms 2140 KB Output is correct
16 Correct 19 ms 2248 KB Output is correct
17 Correct 1 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 1 ms 348 KB Output is correct
21 Correct 14 ms 604 KB Output is correct
22 Correct 85 ms 2904 KB Output is correct
23 Correct 54 ms 2136 KB Output is correct
24 Correct 44 ms 1624 KB Output is correct
25 Correct 59 ms 2328 KB Output is correct
26 Correct 26 ms 2136 KB Output is correct
27 Correct 2 ms 348 KB Output is correct
28 Correct 3 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 278 ms 1116 KB Output is correct
32 Correct 1 ms 600 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Execution timed out 2092 ms 19892 KB Time limit exceeded
35 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 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 31 ms 2252 KB Output is correct
12 Correct 19 ms 1628 KB Output is correct
13 Correct 21 ms 1884 KB Output is correct
14 Correct 29 ms 2252 KB Output is correct
15 Correct 23 ms 2140 KB Output is correct
16 Correct 19 ms 2248 KB Output is correct
17 Correct 1 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 1 ms 348 KB Output is correct
21 Correct 14 ms 604 KB Output is correct
22 Correct 85 ms 2904 KB Output is correct
23 Correct 54 ms 2136 KB Output is correct
24 Correct 44 ms 1624 KB Output is correct
25 Correct 59 ms 2328 KB Output is correct
26 Correct 26 ms 2136 KB Output is correct
27 Correct 2 ms 348 KB Output is correct
28 Correct 3 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 278 ms 1116 KB Output is correct
32 Correct 1 ms 600 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Execution timed out 2092 ms 19892 KB Time limit exceeded
35 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 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 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 4 ms 604 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 2 ms 600 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 0 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 814 ms 3396 KB Output is correct
27 Correct 594 ms 2472 KB Output is correct
28 Correct 503 ms 2384 KB Output is correct
29 Correct 306 ms 2056 KB Output is correct
30 Correct 163 ms 1092 KB Output is correct
31 Correct 393 ms 1116 KB Output is correct
32 Correct 271 ms 1116 KB Output is correct
33 Correct 73 ms 856 KB Output is correct
34 Correct 13 ms 3160 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 6 ms 1176 KB Output is correct
38 Correct 8 ms 1116 KB Output is correct
39 Correct 14 ms 604 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 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 344 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 31 ms 2252 KB Output is correct
51 Correct 19 ms 1628 KB Output is correct
52 Correct 21 ms 1884 KB Output is correct
53 Correct 29 ms 2252 KB Output is correct
54 Correct 23 ms 2140 KB Output is correct
55 Correct 19 ms 2248 KB Output is correct
56 Correct 1 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 1 ms 348 KB Output is correct
60 Correct 14 ms 604 KB Output is correct
61 Correct 85 ms 2904 KB Output is correct
62 Correct 54 ms 2136 KB Output is correct
63 Correct 44 ms 1624 KB Output is correct
64 Correct 59 ms 2328 KB Output is correct
65 Correct 26 ms 2136 KB Output is correct
66 Correct 2 ms 348 KB Output is correct
67 Correct 3 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 278 ms 1116 KB Output is correct
71 Correct 1 ms 600 KB Output is correct
72 Correct 1 ms 604 KB Output is correct
73 Execution timed out 2092 ms 19892 KB Time limit exceeded
74 Halted 0 ms 0 KB -