oj.uz

Submission #735068

# Submission time Handle Problem Language Result Execution time Memory
735068 2023-05-03T13:00:48 Z NintsiChkhaidze Table Tennis (info1cup20_tabletennis) C++17
72 / 100
 3000 ms 23032 KB 
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define s second
#define int long long
using namespace std;

const int N = 2e5+5,inf = 1e9;
int a[N],n,k;
map <int,int> mp;
vector <int> v;
void check(int sum){
	mp.clear();
	for (int i= 1; i <= n+k;i++)
		mp[a[i]]++;
	
	v.clear();
	for (int i = 1; i <= n + k; i++){
		if (!mp[a[i]]) continue;
		mp[a[i]]--;
		if (mp[sum - a[i]] > 0) {
			v.pb(a[i]);
			v.pb(sum - a[i]);
			mp[sum - a[i]]--;
			continue;
		}
		mp[a[i]]++;
	}
	
	if (v.size() == n){
		sort(v.begin(),v.end());
		for (int x: v) cout<<x<<" ";
		cout<<endl;
		exit(0);
	}
	
}
signed main (){
	ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
	
	cin>>n>>k;
	
	for (int i = 1; i <= n+k;i++)
		cin>>a[i];
	
	for (int i = 1; i <= k+1; i++){
		int c=0;
		for (int j = n + k; j > i; j--){
			++c;
			if (c > k+1) break;
			check(a[i] + a[j]);
		}
	}
}
/*
4 7
1 3 4 5 6 8 9 100 200 431 1234
*/

Compilation message

tabletennis.cpp: In function 'void check(long long int)':
tabletennis.cpp:30:15: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   30 |  if (v.size() == n){
      |      ~~~~~~~~~^~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 2164 KB Output is correct
2 Correct 256 ms 21684 KB Output is correct
3 Correct 198 ms 21680 KB Output is correct
4 Correct 242 ms 21652 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 430 ms 21676 KB Output is correct
2 Correct 250 ms 21724 KB Output is correct
3 Correct 640 ms 23032 KB Output is correct
4 Correct 259 ms 21672 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 340 KB Output is correct
2 Correct 464 ms 340 KB Output is correct
3 Correct 6 ms 340 KB Output is correct
4 Correct 231 ms 340 KB Output is correct
5 Correct 5 ms 340 KB Output is correct

Subtask #5
9.0 / 9.0

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

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 181 ms 596 KB Output is correct
3 Correct 14 ms 608 KB Output is correct
4 Correct 99 ms 600 KB Output is correct
5 Correct 15 ms 612 KB Output is correct
6 Correct 59 ms 596 KB Output is correct

Subtask #7
0 / 15.0

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

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 340 KB Output is correct
2 Execution timed out 3089 ms 20296 KB Time limit exceeded
3 Halted 0 ms 0 KB -