oj.uz

Submission #423622

# Submission time Handle Problem Language Result Execution time Memory
423622 2021-06-11T10:33:51 Z jamezzz Table Tennis (info1cup20_tabletennis) C++17
49 / 100
 3000 ms 10004 KB 
#include <bits/stdc++.h>
using namespace std;

#define sf scanf
#define pf printf
#define pb emplace_back
#define all(x) x.begin(),x.end()

int n,k,v;
vector<int> s,ans;
unordered_map<int,bool> mp;

int main(){
	sf("%d%d",&n,&k);
	n+=k;
	for(int i=0;i<n;++i){
		sf("%d",&v);
		s.push_back(v);
	}
	sort(all(s));
	int res=0;
	for(int i=0;i<=k;++i){
		for(int j=n-(k-i)-1;j<n;++j){
			mp.clear();
			for(int l=i+1;l<j;++l)mp[s[l]]=1;
			int t=s[i]+s[j],take=1;
			for(int l=i+1;l<j;++l){
				if(!mp[s[l]])continue;
				if(mp.count(t-s[l])){
					++take;
					mp[s[l]]=0;
					mp[t-s[l]]=0;
				}
				if(take==(n-k)/2)break;
			}
			if(take==(n-k)/2){ res=t; break; }
		}
		if(res!=0)break;
	}
	mp.clear();
	for(int i=0;i<n;++i)mp[s[i]]=1;
	for(int i=0;i<n;++i){
		if(ans.size()==n-k)break;
		if(!mp[s[i]])continue;
		if(mp.count(res-s[i])){
			ans.pb(s[i]);
			ans.pb(res-s[i]);
			mp[s[i]]=0;
			mp[res-s[i]]=0;
		}
	}
	sort(all(ans));
	for(int x:ans)pf("%d ",x);
	pf("\n");
}

Compilation message

tabletennis.cpp: In function 'int main()':
tabletennis.cpp:43:16: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   43 |   if(ans.size()==n-k)break;
      |      ~~~~~~~~~~^~~~~
tabletennis.cpp:14:4: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |  sf("%d%d",&n,&k);
      |    ^
tabletennis.cpp:17:5: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |   sf("%d",&v);
      |     ^

Subtask #1
11.0 / 11.0

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

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 1560 KB Output not subsequence of input
2 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 293 ms 10004 KB Output is correct
2 Correct 139 ms 9972 KB Output is correct
3 Correct 386 ms 9996 KB Output is correct
4 Correct 126 ms 10004 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 61 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 42 ms 324 KB Output is correct
5 Correct 1 ms 204 KB Output is correct

Subtask #5
9.0 / 9.0

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

Subtask #6
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 41 ms 372 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 33 ms 376 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Incorrect 14 ms 332 KB Output not subsequence of input

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Execution timed out 3066 ms 6844 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Execution timed out 3073 ms 6812 KB Time limit exceeded
3 Halted 0 ms 0 KB -