oj.uz

Submission #423623

# Submission time Handle Problem Language Result Execution time Memory
423623 2021-06-11T10:34:14 Z errorgorn Table Tennis (info1cup20_tabletennis) C++17
87 / 100
 3000 ms 111448 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ii pair<ll,ll>
#define fi first
#define se second
#define endl '\n'

#define puf push_front
#define pof pop_front
#define pub push_back
#define pob pop_back

#define rep(x,s,e) for (auto x=s-(s>e);x!=e-(s>e);s<e?x++:x--)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int) (x).size()

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n,k;
int arr[160005];
unordered_map<int,int> m;

int main(){
	cin.tie(0);
	cout.tie(0);
	cin.sync_with_stdio(false);
	
	cin>>n>>k;
	rep(x,0,n+k) cin>>arr[x];
	
	int l=n,r=n+k+k;
	rep(x,0,n+k){
		l--,r--;
		
		if (r<x) break;
		
		rep(y,max(x+1,l),min(r,n+k)+1){
			//cout<<x<<" "<<y<<endl;
			m[arr[x]+arr[y]]++;
		}
	}
	
	int val;
	for (auto &it:m){
		if (it.se>=n/2) val=it.fi;
	}
	
	vector<int> ans;
	
	r=n+k-1;
	rep(x,0,n+k){
		while (arr[x]+arr[r]>val) r--;
		if (arr[x]+arr[r]==val){
			ans.pub(arr[x]);
			ans.pub(arr[r]);
			r--;
			
			if (sz(ans)==n) break;
		}
	}
	
	sort(all(ans));
	
	for (auto &it:ans) cout<<it<<" "; cout<<endl;
}

Compilation message

tabletennis.cpp: In function 'int main()':
tabletennis.cpp:66:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   66 |  for (auto &it:ans) cout<<it<<" "; cout<<endl;
      |  ^~~
tabletennis.cpp:66:36: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   66 |  for (auto &it:ans) cout<<it<<" "; cout<<endl;
      |                                    ^~~~
tabletennis.cpp:54:23: warning: 'val' may be used uninitialized in this function [-Wmaybe-uninitialized]
   54 |   while (arr[x]+arr[r]>val) r--;
      |          ~~~~~~~~~~~~~^~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 788 KB Output is correct
2 Correct 49 ms 3600 KB Output is correct
3 Correct 55 ms 3652 KB Output is correct
4 Correct 50 ms 3620 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 2996 KB Output is correct
2 Correct 49 ms 3408 KB Output is correct
3 Correct 54 ms 3128 KB Output is correct
4 Correct 50 ms 3444 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 588 KB Output is correct
2 Correct 3 ms 844 KB Output is correct
3 Correct 2 ms 844 KB Output is correct
4 Correct 2 ms 844 KB Output is correct
5 Correct 2 ms 844 KB Output is correct

Subtask #5
9.0 / 9.0

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

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 6 ms 1704 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 2 ms 332 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 394 ms 12668 KB Output is correct
3 Correct 174 ms 12444 KB Output is correct
4 Correct 123 ms 3180 KB Output is correct
5 Correct 155 ms 10272 KB Output is correct
6 Correct 109 ms 3132 KB Output is correct
7 Correct 104 ms 3336 KB Output is correct
8 Correct 103 ms 3144 KB Output is correct

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 4988 KB Output is correct
2 Execution timed out 3059 ms 111448 KB Time limit exceeded
3 Halted 0 ms 0 KB -