Submission #366013

#	Time	Username	Problem	Language	Result	Execution time	Memory
366013		keta_tsimakuridze	Table Tennis (info1cup20_tabletennis)	C++14	0 / 100	408 ms	1644 KiB

tabletennis

#include<bits/stdc++.h>
#define f first
#define s second
using namespace std;
const int N=2e5+5,mod=1e9+7;
int t,n,k,F;
vector<int >v,ans;
int a[N];
int  main(){
	cin>>n>>k;
	for(int i=1;i<=n+k;i++){
		cin>>a[i];
	} for(int i=1;i<=n;i++)
	cout<<134<<endl;
	/*
	for(int f=0;f<=k;f++){
		for(int s=0;s<=k-f;s++){
			int lft=k-s-f;
			v.clear();
			int l=f+1;
			int r=n+k-s;
			int sum=a[l]+a[r];
			while(l<r) {
				if(a[l]+a[r]==sum) v.push_back(a[l]),v.push_back(a[r]),l++,r--;
				else if(a[l]+a[r]>sum) r--,lft--;
				else l++,lft--;
				if(!lft) break;
			}
			if(v.size()>=n) {
				for(int i=0;i<n;i++){
					ans.push_back(v[i]);
				}
				sort(ans.begin(),ans.end());
				for(int i=0;i<n;i++){
					cout<<ans[i]<<" ";
				}
				F=1;
				return 0;
			}
		}
	}
	return 0; */

}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 9
• Subtask 3: 0 / 14
• Subtask 4: 0 / 15
• Subtask 5: 0 / 9
• Subtask 6: 0 / 14
• Subtask 7: 0 / 15
• Subtask 8: 0 / 13