oj.uz

Submission #987901

# Submission time Handle Problem Language Result Execution time Memory
987901 2024-05-23T18:59:36 Z Antekb Team Contest (JOI22_team) C++17
44 / 100
 722 ms 21940 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<150; 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 6 ms 14428 KB Output is correct
3 Correct 7 ms 14428 KB Output is correct
4 Correct 6 ms 14428 KB Output is correct
5 Correct 6 ms 14608 KB Output is correct
6 Correct 7 ms 14428 KB Output is correct
7 Correct 7 ms 14492 KB Output is correct
8 Correct 7 ms 14428 KB Output is correct
9 Correct 7 ms 14428 KB Output is correct
10 Correct 7 ms 14428 KB Output is correct
11 Correct 6 ms 14428 KB Output is correct
12 Correct 6 ms 14428 KB Output is correct
13 Correct 6 ms 14424 KB Output is correct
14 Correct 7 ms 14428 KB Output is correct
15 Correct 7 ms 14428 KB Output is correct
16 Correct 7 ms 14428 KB Output is correct
17 Correct 8 ms 14424 KB Output is correct
18 Correct 10 ms 14680 KB Output is correct
19 Correct 9 ms 14428 KB Output is correct
20 Correct 7 ms 14428 KB Output is correct
21 Correct 7 ms 12380 KB Output is correct
22 Correct 8 ms 14428 KB Output is correct
23 Correct 7 ms 14424 KB Output is correct
24 Correct 7 ms 12380 KB Output is correct
25 Correct 8 ms 12380 KB Output is correct

Subtask #2
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14428 KB Output is correct
2 Correct 6 ms 14428 KB Output is correct
3 Correct 7 ms 14428 KB Output is correct
4 Correct 6 ms 14428 KB Output is correct
5 Correct 6 ms 14608 KB Output is correct
6 Correct 7 ms 14428 KB Output is correct
7 Correct 7 ms 14492 KB Output is correct
8 Correct 7 ms 14428 KB Output is correct
9 Correct 7 ms 14428 KB Output is correct
10 Correct 7 ms 14428 KB Output is correct
11 Correct 6 ms 14428 KB Output is correct
12 Correct 6 ms 14428 KB Output is correct
13 Correct 6 ms 14424 KB Output is correct
14 Correct 7 ms 14428 KB Output is correct
15 Correct 7 ms 14428 KB Output is correct
16 Correct 7 ms 14428 KB Output is correct
17 Correct 8 ms 14424 KB Output is correct
18 Correct 10 ms 14680 KB Output is correct
19 Correct 9 ms 14428 KB Output is correct
20 Correct 7 ms 14428 KB Output is correct
21 Correct 7 ms 12380 KB Output is correct
22 Correct 8 ms 14428 KB Output is correct
23 Correct 7 ms 14424 KB Output is correct
24 Correct 7 ms 12380 KB Output is correct
25 Correct 8 ms 12380 KB Output is correct
26 Incorrect 12 ms 12636 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12380 KB Output is correct
2 Correct 6 ms 12380 KB Output is correct
3 Correct 6 ms 12380 KB Output is correct
4 Correct 6 ms 14428 KB Output is correct
5 Correct 8 ms 14580 KB Output is correct
6 Correct 6 ms 12380 KB Output is correct
7 Correct 6 ms 14424 KB Output is correct
8 Correct 6 ms 12380 KB Output is correct
9 Correct 6 ms 14424 KB Output is correct
10 Correct 7 ms 14428 KB Output is correct
11 Correct 205 ms 16548 KB Output is correct
12 Correct 328 ms 17056 KB Output is correct
13 Correct 282 ms 17552 KB Output is correct
14 Correct 419 ms 18256 KB Output is correct
15 Correct 325 ms 18416 KB Output is correct
16 Correct 309 ms 16540 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12380 KB Output is correct
2 Correct 6 ms 12380 KB Output is correct
3 Correct 6 ms 12380 KB Output is correct
4 Correct 6 ms 14428 KB Output is correct
5 Correct 8 ms 14580 KB Output is correct
6 Correct 6 ms 12380 KB Output is correct
7 Correct 6 ms 14424 KB Output is correct
8 Correct 6 ms 12380 KB Output is correct
9 Correct 6 ms 14424 KB Output is correct
10 Correct 7 ms 14428 KB Output is correct
11 Correct 205 ms 16548 KB Output is correct
12 Correct 328 ms 17056 KB Output is correct
13 Correct 282 ms 17552 KB Output is correct
14 Correct 419 ms 18256 KB Output is correct
15 Correct 325 ms 18416 KB Output is correct
16 Correct 309 ms 16540 KB Output is correct
17 Correct 6 ms 14428 KB Output is correct
18 Correct 6 ms 14428 KB Output is correct
19 Correct 6 ms 12376 KB Output is correct
20 Correct 7 ms 12608 KB Output is correct
21 Correct 9 ms 12636 KB Output is correct
22 Correct 224 ms 18612 KB Output is correct
23 Correct 280 ms 16208 KB Output is correct
24 Correct 368 ms 17296 KB Output is correct
25 Correct 588 ms 18412 KB Output is correct
26 Correct 359 ms 18412 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12380 KB Output is correct
2 Correct 6 ms 12380 KB Output is correct
3 Correct 6 ms 12380 KB Output is correct
4 Correct 6 ms 14428 KB Output is correct
5 Correct 8 ms 14580 KB Output is correct
6 Correct 6 ms 12380 KB Output is correct
7 Correct 6 ms 14424 KB Output is correct
8 Correct 6 ms 12380 KB Output is correct
9 Correct 6 ms 14424 KB Output is correct
10 Correct 7 ms 14428 KB Output is correct
11 Correct 205 ms 16548 KB Output is correct
12 Correct 328 ms 17056 KB Output is correct
13 Correct 282 ms 17552 KB Output is correct
14 Correct 419 ms 18256 KB Output is correct
15 Correct 325 ms 18416 KB Output is correct
16 Correct 309 ms 16540 KB Output is correct
17 Correct 6 ms 14428 KB Output is correct
18 Correct 6 ms 14428 KB Output is correct
19 Correct 6 ms 12376 KB Output is correct
20 Correct 7 ms 12608 KB Output is correct
21 Correct 9 ms 12636 KB Output is correct
22 Correct 224 ms 18612 KB Output is correct
23 Correct 280 ms 16208 KB Output is correct
24 Correct 368 ms 17296 KB Output is correct
25 Correct 588 ms 18412 KB Output is correct
26 Correct 359 ms 18412 KB Output is correct
27 Correct 12 ms 14428 KB Output is correct
28 Correct 9 ms 14428 KB Output is correct
29 Correct 8 ms 12380 KB Output is correct
30 Correct 9 ms 12380 KB Output is correct
31 Correct 21 ms 12704 KB Output is correct
32 Correct 9 ms 12636 KB Output is correct
33 Correct 10 ms 14428 KB Output is correct
34 Correct 211 ms 16352 KB Output is correct
35 Correct 343 ms 18256 KB Output is correct
36 Correct 379 ms 18516 KB Output is correct
37 Correct 635 ms 16516 KB Output is correct
38 Correct 333 ms 16456 KB Output is correct
39 Correct 180 ms 16772 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12380 KB Output is correct
2 Correct 6 ms 12380 KB Output is correct
3 Correct 6 ms 12380 KB Output is correct
4 Correct 6 ms 14428 KB Output is correct
5 Correct 8 ms 14580 KB Output is correct
6 Correct 6 ms 12380 KB Output is correct
7 Correct 6 ms 14424 KB Output is correct
8 Correct 6 ms 12380 KB Output is correct
9 Correct 6 ms 14424 KB Output is correct
10 Correct 7 ms 14428 KB Output is correct
11 Correct 205 ms 16548 KB Output is correct
12 Correct 328 ms 17056 KB Output is correct
13 Correct 282 ms 17552 KB Output is correct
14 Correct 419 ms 18256 KB Output is correct
15 Correct 325 ms 18416 KB Output is correct
16 Correct 309 ms 16540 KB Output is correct
17 Correct 6 ms 14428 KB Output is correct
18 Correct 6 ms 14428 KB Output is correct
19 Correct 6 ms 12376 KB Output is correct
20 Correct 7 ms 12608 KB Output is correct
21 Correct 9 ms 12636 KB Output is correct
22 Correct 224 ms 18612 KB Output is correct
23 Correct 280 ms 16208 KB Output is correct
24 Correct 368 ms 17296 KB Output is correct
25 Correct 588 ms 18412 KB Output is correct
26 Correct 359 ms 18412 KB Output is correct
27 Correct 12 ms 14428 KB Output is correct
28 Correct 9 ms 14428 KB Output is correct
29 Correct 8 ms 12380 KB Output is correct
30 Correct 9 ms 12380 KB Output is correct
31 Correct 21 ms 12704 KB Output is correct
32 Correct 9 ms 12636 KB Output is correct
33 Correct 10 ms 14428 KB Output is correct
34 Correct 211 ms 16352 KB Output is correct
35 Correct 343 ms 18256 KB Output is correct
36 Correct 379 ms 18516 KB Output is correct
37 Correct 635 ms 16516 KB Output is correct
38 Correct 333 ms 16456 KB Output is correct
39 Correct 180 ms 16772 KB Output is correct
40 Correct 17 ms 14680 KB Output is correct
41 Correct 14 ms 12636 KB Output is correct
42 Correct 23 ms 14680 KB Output is correct
43 Correct 21 ms 14684 KB Output is correct
44 Correct 237 ms 21940 KB Output is correct
45 Correct 634 ms 20052 KB Output is correct
46 Correct 543 ms 20060 KB Output is correct
47 Correct 722 ms 21696 KB Output is correct
48 Correct 349 ms 20052 KB Output is correct

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14428 KB Output is correct
2 Correct 6 ms 14428 KB Output is correct
3 Correct 7 ms 14428 KB Output is correct
4 Correct 6 ms 14428 KB Output is correct
5 Correct 6 ms 14608 KB Output is correct
6 Correct 7 ms 14428 KB Output is correct
7 Correct 7 ms 14492 KB Output is correct
8 Correct 7 ms 14428 KB Output is correct
9 Correct 7 ms 14428 KB Output is correct
10 Correct 7 ms 14428 KB Output is correct
11 Correct 6 ms 14428 KB Output is correct
12 Correct 6 ms 14428 KB Output is correct
13 Correct 6 ms 14424 KB Output is correct
14 Correct 7 ms 14428 KB Output is correct
15 Correct 7 ms 14428 KB Output is correct
16 Correct 7 ms 14428 KB Output is correct
17 Correct 8 ms 14424 KB Output is correct
18 Correct 10 ms 14680 KB Output is correct
19 Correct 9 ms 14428 KB Output is correct
20 Correct 7 ms 14428 KB Output is correct
21 Correct 7 ms 12380 KB Output is correct
22 Correct 8 ms 14428 KB Output is correct
23 Correct 7 ms 14424 KB Output is correct
24 Correct 7 ms 12380 KB Output is correct
25 Correct 8 ms 12380 KB Output is correct
26 Incorrect 12 ms 12636 KB Output isn't correct
27 Halted 0 ms 0 KB -