oj.uz

Submission #365744

# Submission time Handle Problem Language Result Execution time Memory
365744 2021-02-12T09:52:35 Z amunduzbaev Table Tennis (info1cup20_tabletennis) C++14
87 / 100
 3000 ms 12652 KB 
/** made by amunduzbaev **/
#include <bits/stdc++.h>
using namespace std;
 
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define NeedForSpeed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vv vector
#define int long long
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii; 
typedef pair<ll, ll> pll; 
typedef vector<ll> vll;
typedef vector<int> vii;
typedef vector<pll> vpll;
typedef vector<pii> vpii;
typedef pair<int, pii> ipii;
typedef pair<pii, int> piii;
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}
 
const int N = 2e5+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
 
#define MULTI 0	
 
int n, m, k, ans, res, a[N];

/*

4 2
1 2 3 4 8 20

4 2
1 2 5 7 8 100

6 2
1 3 4 5 6 7 8 11

6 2
1 2 3 5 7 8 9 15

4 2
100 200 1 2 3 4

*/

bool check(int s){
	srand(time(NULL));
	set<int> ss;
	for(int i=0;i<m;i++) ss.insert(a[i]); 
	map<int, int> used;
	for(int i=0;i<m;i++){
		if(used.count(a[i]) || a[i] >= s) continue;
		auto x = ss.find(s - a[i]);
		if(x != ss.end() && *x != a[i]){
			used[*x] = 1, used[a[i]] = 1;
			ss.erase(x);
			ss.erase(a[i]);
		}
	}
	if(sz(used) == n){
		for(auto x:used) cout<<x.ff<<" ";
		cout<<"\n";
		return 1;
	}
	return 0;
}

void solve(int t_case){
	srand(time(NULL));
	cin>>n>>k;
	m = n+k;
	for(int i=0;i<m;i++) cin>>a[i];
	sort(a, a+m);
	//if(check(7, 4)) { print(4, 7); return; }
	
	if(n >= 18000 && k >= 15){
		int i = rand()%m;
		while(1){
			int ri = m-i-1;
			if(check(a[i] + a[ri])) return;
			
			for(int j=1;j<k;j++){
				if(check(a[i] + a[ri-j])) return;
				if(check(a[i] + a[ri+j])) return;
			}
			
			i = rand()%m;
		}
	} else {
		map<int, int> mm;
		for(int i=0;i<=k;i++){
			for(int j=1;j<=k-i+1;j++){
				if(mm[a[i] + a[m-j]]) continue;
				mm[a[i] + a[m-j]] = 1;
				if(check(a[i] + a[m-j])) return;
			}
		}
	}
}

signed main(){
	NeedForSpeed
	if(!MULTI) {
		solve(1);
	} else {
		int t; cin>>t;
		for(int t_case = 1; t_case <= t; t_case++) solve(t_case);
	}
	return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 620 KB Output is correct
2 Correct 2 ms 620 KB Output is correct
3 Correct 2 ms 620 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 2028 KB Output is correct
2 Correct 205 ms 12460 KB Output is correct
3 Correct 172 ms 12524 KB Output is correct
4 Correct 167 ms 12524 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 302 ms 12544 KB Output is correct
2 Correct 202 ms 12524 KB Output is correct
3 Correct 339 ms 12524 KB Output is correct
4 Correct 209 ms 12524 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 97 ms 620 KB Output is correct
3 Correct 4 ms 364 KB Output is correct
4 Correct 67 ms 620 KB Output is correct
5 Correct 2 ms 364 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 55 ms 620 KB Output is correct
3 Correct 6 ms 620 KB Output is correct
4 Correct 33 ms 620 KB Output is correct
5 Correct 8 ms 620 KB Output is correct
6 Correct 27 ms 620 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 855 ms 12464 KB Output is correct
3 Correct 1090 ms 12652 KB Output is correct
4 Correct 131 ms 12524 KB Output is correct
5 Correct 455 ms 12524 KB Output is correct
6 Correct 1943 ms 12468 KB Output is correct
7 Correct 284 ms 12528 KB Output is correct
8 Correct 134 ms 12524 KB Output is correct

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 364 KB Output is correct
2 Execution timed out 3055 ms 8644 KB Time limit exceeded
3 Halted 0 ms 0 KB -