oj.uz

답안 #1043752

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1043752 2024-08-04T16:15:14 Z Minbaev Just Long Neckties (JOI20_ho_t1) C++17
0 / 100
 881 ms 344 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
 
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("Ofast,unroll-loops")
 
using namespace std;
using namespace __gnu_pbds;
 
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define f first
#define s second
#define int long long
#define ll long long
#define pii pair<int,int>
#define ar array
 
template<class T>bool umax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>bool umin(T &a,T b){if(b<a){a=b;return true;}return false;}
 
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
 tree_order_statistics_node_update> ordered_set;
 
const int inf = 1e17 + 7;
const int mod = 1e9 + 7;
const int N = 3e5 + 5;
const int md = 998244353;
 
int binpow(int a, int b){
	if(b == 0)return 1;
	if(b % 2 == 0){
		int c = binpow(a,b/2);
		return (c*c)%mod;
	}
	return (binpow(a,b-1)*a)%mod;
}
 
int divi(int a, int b){
	return (a*(binpow(b,mod-2)))%mod;
}
 
int n,m,k;
 
void solve(){
	
	cin >> n;
	vector<int>v(n+1), vs(n);
	for(auto &to:v)cin >> to;
	for(auto &to:vs)cin >> to;
	
	sort(all(vs));
	sort(all(v));
	
	for(int i = 0;i<=n;i++){
		vector<int>g;
		for(int j = 0;j<=n;j++)
			if(j != i)g.pb(v[j]);
		int ans = inf;
		do{
			int mx = 0;
			for(int j = 0;j<n;j++){
				umax(mx, g[j] - vs[j]);
			}
			umin(ans, mx);
			
		}while(next_permutation(all(g)));
		cout << ans << " ";
	}
	
}
/*
 
*/
 signed main()
{
//	freopen("seq.in", "r", stdin);
//  freopen("seq.out", "w", stdout);
	ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
	int tt=1;//cin>>tt;
	while(tt--)solve();
 
}

Subtask #1
0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 881 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 881 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 881 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -