oj.uz

Submission #987904

# Submission time Handle Problem Language Result Execution time Memory
987904 2024-05-23T19:00:51 Z Antekb Team Contest (JOI22_team) C++17
100 / 100
 1106 ms 24152 KB 
#include<bits/stdc++.h>
 
#pragma GCC optimize("Ofast")
//#pragma GCC optimize("trapv")
 
#define st first
#define nd second
#define pb push_back
#define eb emplace_back
#define pp(x) pop_back(x)
#define mp(a, b) make_pair(a, b)
#define all(x) (x).begin(), (x).end()
#define rev(x) reverse(all(x))
#define sor(x) sort(all(x))
#define sz(x) (int)(x).size()
#define rsz(x) resize(x)
 
using namespace std;
 
///~~~~~~~~~~~~~~~~~~~~~~~~~~
 
template <typename H, typename T> 
ostream& operator<<(ostream& os, pair<H, T> m){
	return os <<"("<< m.st<<", "<<m.nd<<")";
}
template <typename H> 
ostream& operator<<(ostream& os, vector<H> V){
	os<<"{";
	for(int i=0; i<V.size(); i++){
		if(i)os<<" ";
		os<<V[i];
	}
	os<<"}";
	return os;
}
 
void debug(){cerr<<"\n";}
template <typename H, typename... T>
void debug(H h, T... t) {cerr<<h; if (sizeof...(t)) cerr << ", "; debug(t...);}
#define deb(x...) cerr<<#x<<" = ";debug(x);
//#define deb(x...) ;
 
///~~~~~~~~~~~~~~~~~~~~~~~~~
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii > vii;
typedef vector<ll> vl;
typedef vector<pll> vll;
typedef string str;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

 
#define BOOST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
 
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const int N=1<<20, INF=1e9+5, mod2=1e9+7, mod=998244353;

struct modint{
	int n=0;
	modint(){}
	modint(ll x){
		n=x%mod;
		if(n<0)n+=mod;
	}
	operator int(){
		return n;
	}
	modint operator+(modint a){a.n = n+a.n; if(a.n>=mod)a.n-=mod;return a;}
	modint operator+=(modint a){return (*this)=(*this)+a;}
	modint operator-(modint a){a.n = n-a.n; if(a.n<0)a.n+=mod;return a;}
	modint operator-=(modint a){return (*this)=(*this)-a;}
	modint operator*(modint a){a.n = (n*1ll*a.n)%mod; return a;}
	modint operator*=(modint a){return (*this)=(*this)*a;}
	modint por(const ll &m)const{
		modint a(1);
		if(m==0)return a;
		if(m==1)return (*this);
		a=por(m/2);
		a*=a;
		return a*(por(m&1));
	}
	modint odw(){
		return por((ll)mod-2);
	}
	modint operator/(modint a){return (*this)*a.odw();}
	modint operator/=(modint a){return (*this)=(*this)/a;}
	bool operator==(modint a){return a.n==n;}
	friend ostream& operator<<(ostream& os, modint m) {
		return os << m.n; 
	}
};
modint fact[N], fact2[N];
typedef vector<modint> vm;
void factinit(){
    fact[0]=1;
    for(int i=1; i<N; i++){
        fact[i]=(fact[i-1]*modint(i))%mod;
    }
    fact2[N-1]=fact[N-1].odw();
    for(int i=N-2; i>=0; i--){
    	fact2[i]=(fact2[i+1]*modint(i+1))%mod;
    }
}
modint npok(int _n, int _k){
    return fact[_n]*fact2[_k]*fact2[_n-_k];
}
int X[N], Y[N], Z[N];
vi Vx, Vy, Vz;
int solve(vi &typ){
	int n=typ.size();
	int a=n-1, b=n-1, c=n-1;
	while(a>=0 && typ[Vx[a]]!=0)a--;
	while(b>=0 && typ[Vy[b]]!=1)b--;
	while(c>=0 && typ[Vz[c]]!=2)c--;
	while(a>=0 && b>=0 && c>=0){
		bool to_break=1;
		while(a>=0 && (typ[Vx[a]]!=0  || Y[Vx[a]]>=Y[Vy[b]] || Z[Vx[a]]>=Z[Vz[c]]))a--, to_break=0;
		if(a==-1)break;
		while(b>=0 && (typ[Vy[b]]!=1  || X[Vy[b]]>=X[Vx[a]] || Z[Vy[b]]>=Z[Vz[c]]))b--, to_break=0;
		if(b==-1)break;
		while(c>=0 && (typ[Vz[c]]!=2  || Y[Vz[c]]>=Y[Vy[b]] || X[Vz[c]]>=X[Vx[a]]))c--, to_break=0;
		if(c==-1)break;
		if(to_break)break;	
	}
	if(a>=0 && b>=0 && c>=0)return X[Vx[a]]+Y[Vy[b]]+Z[Vz[c]];
	return -1;
}
int main(){
	//factinit();
	BOOST;
	int n;
	cin>>n;
	for(int i=0; i<n; i++){
		cin>>X[i]>>Y[i]>>Z[i];
	}
	
	Vx.resize(n);
	iota(all(Vx), 0);
	Vy.resize(n);
	iota(all(Vy), 0);
	Vz.resize(n);
	iota(all(Vz), 0);
	sort(all(Vx), [](int a ,int b){return X[a]<X[b];});
	sort(all(Vy), [](int a ,int b){return Y[a]<Y[b];});
	sort(all(Vz), [](int a ,int b){return Z[a]<Z[b];});
	int ans=-1;
	vi typ(n);
	for(int i=0; i<200; i++){
		for(int &j:typ)j=rng()%3;
		ans=max(ans, solve(typ));
	}
	cout<<ans<<"\n";
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14428 KB Output is correct
2 Correct 7 ms 14528 KB Output is correct
3 Correct 7 ms 14428 KB Output is correct
4 Correct 7 ms 14428 KB Output is correct
5 Correct 6 ms 14428 KB Output is correct
6 Correct 6 ms 14428 KB Output is correct
7 Correct 6 ms 14428 KB Output is correct
8 Correct 7 ms 14424 KB Output is correct
9 Correct 7 ms 14424 KB Output is correct
10 Correct 7 ms 14520 KB Output is correct
11 Correct 6 ms 14424 KB Output is correct
12 Correct 6 ms 14424 KB Output is correct
13 Correct 6 ms 14424 KB Output is correct
14 Correct 7 ms 14648 KB Output is correct
15 Correct 8 ms 14428 KB Output is correct
16 Correct 7 ms 14428 KB Output is correct
17 Correct 8 ms 14428 KB Output is correct
18 Correct 7 ms 14852 KB Output is correct
19 Correct 7 ms 14648 KB Output is correct
20 Correct 8 ms 14680 KB Output is correct
21 Correct 7 ms 14652 KB Output is correct
22 Correct 8 ms 14428 KB Output is correct
23 Correct 7 ms 14424 KB Output is correct
24 Correct 8 ms 14424 KB Output is correct
25 Correct 8 ms 14624 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14428 KB Output is correct
2 Correct 7 ms 14528 KB Output is correct
3 Correct 7 ms 14428 KB Output is correct
4 Correct 7 ms 14428 KB Output is correct
5 Correct 6 ms 14428 KB Output is correct
6 Correct 6 ms 14428 KB Output is correct
7 Correct 6 ms 14428 KB Output is correct
8 Correct 7 ms 14424 KB Output is correct
9 Correct 7 ms 14424 KB Output is correct
10 Correct 7 ms 14520 KB Output is correct
11 Correct 6 ms 14424 KB Output is correct
12 Correct 6 ms 14424 KB Output is correct
13 Correct 6 ms 14424 KB Output is correct
14 Correct 7 ms 14648 KB Output is correct
15 Correct 8 ms 14428 KB Output is correct
16 Correct 7 ms 14428 KB Output is correct
17 Correct 8 ms 14428 KB Output is correct
18 Correct 7 ms 14852 KB Output is correct
19 Correct 7 ms 14648 KB Output is correct
20 Correct 8 ms 14680 KB Output is correct
21 Correct 7 ms 14652 KB Output is correct
22 Correct 8 ms 14428 KB Output is correct
23 Correct 7 ms 14424 KB Output is correct
24 Correct 8 ms 14424 KB Output is correct
25 Correct 8 ms 14624 KB Output is correct
26 Correct 14 ms 14684 KB Output is correct
27 Correct 17 ms 14684 KB Output is correct
28 Correct 20 ms 14684 KB Output is correct
29 Correct 31 ms 14684 KB Output is correct
30 Correct 18 ms 14680 KB Output is correct
31 Correct 16 ms 14684 KB Output is correct
32 Correct 26 ms 14684 KB Output is correct
33 Correct 17 ms 14680 KB Output is correct
34 Correct 26 ms 14684 KB Output is correct
35 Correct 10 ms 14428 KB Output is correct
36 Correct 11 ms 14608 KB Output is correct
37 Correct 25 ms 14684 KB Output is correct
38 Correct 26 ms 14684 KB Output is correct
39 Correct 10 ms 14680 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14428 KB Output is correct
2 Correct 6 ms 14608 KB Output is correct
3 Correct 6 ms 14428 KB Output is correct
4 Correct 7 ms 14428 KB Output is correct
5 Correct 7 ms 14428 KB Output is correct
6 Correct 6 ms 14428 KB Output is correct
7 Correct 6 ms 14428 KB Output is correct
8 Correct 6 ms 14424 KB Output is correct
9 Correct 7 ms 14428 KB Output is correct
10 Correct 6 ms 14520 KB Output is correct
11 Correct 261 ms 21684 KB Output is correct
12 Correct 408 ms 19024 KB Output is correct
13 Correct 351 ms 19536 KB Output is correct
14 Correct 552 ms 20052 KB Output is correct
15 Correct 421 ms 20048 KB Output is correct
16 Correct 391 ms 21696 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14428 KB Output is correct
2 Correct 6 ms 14608 KB Output is correct
3 Correct 6 ms 14428 KB Output is correct
4 Correct 7 ms 14428 KB Output is correct
5 Correct 7 ms 14428 KB Output is correct
6 Correct 6 ms 14428 KB Output is correct
7 Correct 6 ms 14428 KB Output is correct
8 Correct 6 ms 14424 KB Output is correct
9 Correct 7 ms 14428 KB Output is correct
10 Correct 6 ms 14520 KB Output is correct
11 Correct 261 ms 21684 KB Output is correct
12 Correct 408 ms 19024 KB Output is correct
13 Correct 351 ms 19536 KB Output is correct
14 Correct 552 ms 20052 KB Output is correct
15 Correct 421 ms 20048 KB Output is correct
16 Correct 391 ms 21696 KB Output is correct
17 Correct 7 ms 14424 KB Output is correct
18 Correct 6 ms 14428 KB Output is correct
19 Correct 6 ms 14428 KB Output is correct
20 Correct 8 ms 14428 KB Output is correct
21 Correct 10 ms 14936 KB Output is correct
22 Correct 265 ms 20052 KB Output is correct
23 Correct 358 ms 19960 KB Output is correct
24 Correct 456 ms 20888 KB Output is correct
25 Correct 752 ms 21860 KB Output is correct
26 Correct 435 ms 20052 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14428 KB Output is correct
2 Correct 6 ms 14608 KB Output is correct
3 Correct 6 ms 14428 KB Output is correct
4 Correct 7 ms 14428 KB Output is correct
5 Correct 7 ms 14428 KB Output is correct
6 Correct 6 ms 14428 KB Output is correct
7 Correct 6 ms 14428 KB Output is correct
8 Correct 6 ms 14424 KB Output is correct
9 Correct 7 ms 14428 KB Output is correct
10 Correct 6 ms 14520 KB Output is correct
11 Correct 261 ms 21684 KB Output is correct
12 Correct 408 ms 19024 KB Output is correct
13 Correct 351 ms 19536 KB Output is correct
14 Correct 552 ms 20052 KB Output is correct
15 Correct 421 ms 20048 KB Output is correct
16 Correct 391 ms 21696 KB Output is correct
17 Correct 7 ms 14424 KB Output is correct
18 Correct 6 ms 14428 KB Output is correct
19 Correct 6 ms 14428 KB Output is correct
20 Correct 8 ms 14428 KB Output is correct
21 Correct 10 ms 14936 KB Output is correct
22 Correct 265 ms 20052 KB Output is correct
23 Correct 358 ms 19960 KB Output is correct
24 Correct 456 ms 20888 KB Output is correct
25 Correct 752 ms 21860 KB Output is correct
26 Correct 435 ms 20052 KB Output is correct
27 Correct 7 ms 14680 KB Output is correct
28 Correct 7 ms 14424 KB Output is correct
29 Correct 9 ms 14520 KB Output is correct
30 Correct 9 ms 14424 KB Output is correct
31 Correct 25 ms 14684 KB Output is correct
32 Correct 10 ms 14428 KB Output is correct
33 Correct 10 ms 14668 KB Output is correct
34 Correct 264 ms 18168 KB Output is correct
35 Correct 429 ms 16148 KB Output is correct
36 Correct 485 ms 18416 KB Output is correct
37 Correct 832 ms 18312 KB Output is correct
38 Correct 431 ms 16464 KB Output is correct
39 Correct 239 ms 16772 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14428 KB Output is correct
2 Correct 6 ms 14608 KB Output is correct
3 Correct 6 ms 14428 KB Output is correct
4 Correct 7 ms 14428 KB Output is correct
5 Correct 7 ms 14428 KB Output is correct
6 Correct 6 ms 14428 KB Output is correct
7 Correct 6 ms 14428 KB Output is correct
8 Correct 6 ms 14424 KB Output is correct
9 Correct 7 ms 14428 KB Output is correct
10 Correct 6 ms 14520 KB Output is correct
11 Correct 261 ms 21684 KB Output is correct
12 Correct 408 ms 19024 KB Output is correct
13 Correct 351 ms 19536 KB Output is correct
14 Correct 552 ms 20052 KB Output is correct
15 Correct 421 ms 20048 KB Output is correct
16 Correct 391 ms 21696 KB Output is correct
17 Correct 7 ms 14424 KB Output is correct
18 Correct 6 ms 14428 KB Output is correct
19 Correct 6 ms 14428 KB Output is correct
20 Correct 8 ms 14428 KB Output is correct
21 Correct 10 ms 14936 KB Output is correct
22 Correct 265 ms 20052 KB Output is correct
23 Correct 358 ms 19960 KB Output is correct
24 Correct 456 ms 20888 KB Output is correct
25 Correct 752 ms 21860 KB Output is correct
26 Correct 435 ms 20052 KB Output is correct
27 Correct 7 ms 14680 KB Output is correct
28 Correct 7 ms 14424 KB Output is correct
29 Correct 9 ms 14520 KB Output is correct
30 Correct 9 ms 14424 KB Output is correct
31 Correct 25 ms 14684 KB Output is correct
32 Correct 10 ms 14428 KB Output is correct
33 Correct 10 ms 14668 KB Output is correct
34 Correct 264 ms 18168 KB Output is correct
35 Correct 429 ms 16148 KB Output is correct
36 Correct 485 ms 18416 KB Output is correct
37 Correct 832 ms 18312 KB Output is correct
38 Correct 431 ms 16464 KB Output is correct
39 Correct 239 ms 16772 KB Output is correct
40 Correct 17 ms 12636 KB Output is correct
41 Correct 16 ms 14680 KB Output is correct
42 Correct 25 ms 14684 KB Output is correct
43 Correct 26 ms 14932 KB Output is correct
44 Correct 290 ms 19996 KB Output is correct
45 Correct 779 ms 19956 KB Output is correct
46 Correct 679 ms 19952 KB Output is correct
47 Correct 908 ms 21588 KB Output is correct
48 Correct 441 ms 21328 KB Output is correct

Subtask #7
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14428 KB Output is correct
2 Correct 7 ms 14528 KB Output is correct
3 Correct 7 ms 14428 KB Output is correct
4 Correct 7 ms 14428 KB Output is correct
5 Correct 6 ms 14428 KB Output is correct
6 Correct 6 ms 14428 KB Output is correct
7 Correct 6 ms 14428 KB Output is correct
8 Correct 7 ms 14424 KB Output is correct
9 Correct 7 ms 14424 KB Output is correct
10 Correct 7 ms 14520 KB Output is correct
11 Correct 6 ms 14424 KB Output is correct
12 Correct 6 ms 14424 KB Output is correct
13 Correct 6 ms 14424 KB Output is correct
14 Correct 7 ms 14648 KB Output is correct
15 Correct 8 ms 14428 KB Output is correct
16 Correct 7 ms 14428 KB Output is correct
17 Correct 8 ms 14428 KB Output is correct
18 Correct 7 ms 14852 KB Output is correct
19 Correct 7 ms 14648 KB Output is correct
20 Correct 8 ms 14680 KB Output is correct
21 Correct 7 ms 14652 KB Output is correct
22 Correct 8 ms 14428 KB Output is correct
23 Correct 7 ms 14424 KB Output is correct
24 Correct 8 ms 14424 KB Output is correct
25 Correct 8 ms 14624 KB Output is correct
26 Correct 14 ms 14684 KB Output is correct
27 Correct 17 ms 14684 KB Output is correct
28 Correct 20 ms 14684 KB Output is correct
29 Correct 31 ms 14684 KB Output is correct
30 Correct 18 ms 14680 KB Output is correct
31 Correct 16 ms 14684 KB Output is correct
32 Correct 26 ms 14684 KB Output is correct
33 Correct 17 ms 14680 KB Output is correct
34 Correct 26 ms 14684 KB Output is correct
35 Correct 10 ms 14428 KB Output is correct
36 Correct 11 ms 14608 KB Output is correct
37 Correct 25 ms 14684 KB Output is correct
38 Correct 26 ms 14684 KB Output is correct
39 Correct 10 ms 14680 KB Output is correct
40 Correct 6 ms 14428 KB Output is correct
41 Correct 6 ms 14608 KB Output is correct
42 Correct 6 ms 14428 KB Output is correct
43 Correct 7 ms 14428 KB Output is correct
44 Correct 7 ms 14428 KB Output is correct
45 Correct 6 ms 14428 KB Output is correct
46 Correct 6 ms 14428 KB Output is correct
47 Correct 6 ms 14424 KB Output is correct
48 Correct 7 ms 14428 KB Output is correct
49 Correct 6 ms 14520 KB Output is correct
50 Correct 261 ms 21684 KB Output is correct
51 Correct 408 ms 19024 KB Output is correct
52 Correct 351 ms 19536 KB Output is correct
53 Correct 552 ms 20052 KB Output is correct
54 Correct 421 ms 20048 KB Output is correct
55 Correct 391 ms 21696 KB Output is correct
56 Correct 7 ms 14424 KB Output is correct
57 Correct 6 ms 14428 KB Output is correct
58 Correct 6 ms 14428 KB Output is correct
59 Correct 8 ms 14428 KB Output is correct
60 Correct 10 ms 14936 KB Output is correct
61 Correct 265 ms 20052 KB Output is correct
62 Correct 358 ms 19960 KB Output is correct
63 Correct 456 ms 20888 KB Output is correct
64 Correct 752 ms 21860 KB Output is correct
65 Correct 435 ms 20052 KB Output is correct
66 Correct 7 ms 14680 KB Output is correct
67 Correct 7 ms 14424 KB Output is correct
68 Correct 9 ms 14520 KB Output is correct
69 Correct 9 ms 14424 KB Output is correct
70 Correct 25 ms 14684 KB Output is correct
71 Correct 10 ms 14428 KB Output is correct
72 Correct 10 ms 14668 KB Output is correct
73 Correct 264 ms 18168 KB Output is correct
74 Correct 429 ms 16148 KB Output is correct
75 Correct 485 ms 18416 KB Output is correct
76 Correct 832 ms 18312 KB Output is correct
77 Correct 431 ms 16464 KB Output is correct
78 Correct 239 ms 16772 KB Output is correct
79 Correct 17 ms 12636 KB Output is correct
80 Correct 16 ms 14680 KB Output is correct
81 Correct 25 ms 14684 KB Output is correct
82 Correct 26 ms 14932 KB Output is correct
83 Correct 290 ms 19996 KB Output is correct
84 Correct 779 ms 19956 KB Output is correct
85 Correct 679 ms 19952 KB Output is correct
86 Correct 908 ms 21588 KB Output is correct
87 Correct 441 ms 21328 KB Output is correct
88 Correct 304 ms 20564 KB Output is correct
89 Correct 706 ms 20728 KB Output is correct
90 Correct 374 ms 23992 KB Output is correct
91 Correct 1106 ms 24152 KB Output is correct
92 Correct 489 ms 23064 KB Output is correct
93 Correct 847 ms 23224 KB Output is correct
94 Correct 1022 ms 21588 KB Output is correct
95 Correct 453 ms 22100 KB Output is correct
96 Correct 828 ms 23920 KB Output is correct
97 Correct 403 ms 22356 KB Output is correct
98 Correct 719 ms 21584 KB Output is correct
99 Correct 794 ms 21588 KB Output is correct