Submission #674453

#TimeUsernameProblemLanguageResultExecution timeMemory
674453QwertyPiTable Tennis (info1cup20_tabletennis)C++14
0 / 100
3081 ms1048576 KiB
#include <bits/stdc++.h>

using namespace std;

int n, k; 
int a[150401];

void gen(int x){
	vector<int> Fr, Ba;
	int l = 0, r = n + k - 1;
	while(l < r){
		if(a[l] + a[r] == x) { Fr.push_back(l); Ba.push_back(r); l++; r--; }
		else if(a[l] + a[r] > x) r--;
		else l++;
	}
	reverse(Ba.begin(), Ba.end());
	for(auto i : Fr) cout << i + 1 << ' ';
	for(auto i : Ba) cout << i + 1 << ' ';
}

int main(){
	cin >> n >> k;
	for(int i = 0; i < n + k; i++){
		cin >> a[i];
	}
	vector<int> v;
	for(int i = 0; i < n + k; i++){
		for(int j = max(i + 1, n + k - 1 - i - k); j <= min(n + k - 1, n + k - 1 + i + k); j++){
			v.push_back(a[i] + a[j]);
		}
	}
	sort(v.begin(), v.end());
	int c = 0, pv = -1;
	for(auto i : v){
		if(i == pv) c++;
		else c = 1, pv = i;
		if(c == n / 2){
			gen(i);
			return 0;
		}
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...