oj.uz

답안 #860138

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
860138 2023-10-11T18:42:36 Z ThylOne Table Tennis (info1cup20_tabletennis) C++14
100 / 100
 101 ms 4940 KB 
//####################
//Binome_Equilibres
//####################
#include<bits/stdc++.h>

using namespace std;
int n,k;
vector<int> nums;
bool possible(int start,int end,int K){
	int target = nums[start]+nums[end];
	vector<int> S,E;
	S.push_back(nums[start]);
	E.push_back(nums[end]);
	
	start++;
	end--;
	while(start<end && K>=0){
		int sum = nums[start]+nums[end];
		if(sum>target){
			K--;
			end--;
		}else if(sum<target){
			K--;
			start++;
		}else{
			S.push_back(nums[start]);
			E.push_back(nums[end]);
			start++;
			end--;
		}
	}
	if(K<0)return false;
	while(n!=(int(S.size()+E.size()))){
		S.erase(S.begin());
		E.erase(E.begin());
	}
	for(int v:S)cout<<v<<' ';
	reverse(E.begin(),E.end());
	for(int v:E)cout<<v<<' ';
	cout<<'\n';
	return true;
}
signed main(){
	cin>>n>>k;
	nums.resize(n+k);
	for(int i=0;i<n+k;i++){
		cin>>nums[i];
	}
	
	for(int i=0;i<=k;i++){
		int taked = i;
		for(int j=n+k-1;j>=0 && taked<=k;j--){
			if(possible(i,j,k-taked)){
				return 0;
			}
			taked++;
		}
	}
	return 0;
};

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 448 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 860 KB Output is correct
2 Correct 65 ms 4552 KB Output is correct
3 Correct 51 ms 4564 KB Output is correct
4 Correct 51 ms 4548 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 4548 KB Output is correct
2 Correct 52 ms 4712 KB Output is correct
3 Correct 51 ms 4548 KB Output is correct
4 Correct 51 ms 4552 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 440 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct

Subtask #6
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct

Subtask #7
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 52 ms 4552 KB Output is correct
3 Correct 51 ms 4548 KB Output is correct
4 Correct 51 ms 4608 KB Output is correct
5 Correct 52 ms 4940 KB Output is correct
6 Correct 51 ms 4704 KB Output is correct
7 Correct 55 ms 4552 KB Output is correct
8 Correct 51 ms 4608 KB Output is correct

Subtask #8
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 70 ms 4552 KB Output is correct
3 Correct 52 ms 4548 KB Output is correct
4 Correct 66 ms 4696 KB Output is correct
5 Correct 55 ms 4456 KB Output is correct
6 Correct 55 ms 4580 KB Output is correct
7 Correct 101 ms 4620 KB Output is correct
8 Correct 51 ms 4552 KB Output is correct