oj.uz

Submission #423636

# Submission time Handle Problem Language Result Execution time Memory
423636 2021-06-11T10:42:57 Z errorgorn Table Tennis (info1cup20_tabletennis) C++17
87 / 100
 3000 ms 417556 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];
vector<int> v[12345678];

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;
			v[(arr[x]+arr[y])%12345678].pub(arr[x]+arr[y]);
		}
	}
	
	int val;
	
	rep(x,0,12345678){
		sort(all(v[x]));
		while (!v[x].empty()){
			int temp=v[x].back();
			int cnt=0;
			while (!v[x].empty() && v[x].back()==temp){
				v[x].pob();
				cnt++;
			}
			
			if (cnt>=n/2){
				val=temp;
				break;
			}
		}
	}
	
	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:80:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   80 |  for (auto &it:ans) cout<<it<<" "; cout<<endl;
      |  ^~~
tabletennis.cpp:80:36: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   80 |  for (auto &it:ans) cout<<it<<" "; cout<<endl;
      |                                    ^~~~
tabletennis.cpp:69:3: warning: 'val' may be used uninitialized in this function [-Wmaybe-uninitialized]
   69 |   if (arr[x]+arr[r]==val){
      |   ^~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 290212 KB Output is correct
2 Correct 194 ms 290400 KB Output is correct
3 Correct 188 ms 290192 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 192 ms 290804 KB Output is correct
2 Correct 237 ms 294584 KB Output is correct
3 Correct 239 ms 294504 KB Output is correct
4 Correct 239 ms 294440 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 245 ms 294748 KB Output is correct
2 Correct 241 ms 295100 KB Output is correct
3 Correct 237 ms 294908 KB Output is correct
4 Correct 238 ms 295152 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 191 ms 290496 KB Output is correct
2 Correct 219 ms 290616 KB Output is correct
3 Correct 191 ms 290516 KB Output is correct
4 Correct 190 ms 290572 KB Output is correct
5 Correct 197 ms 290628 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 184 ms 290112 KB Output is correct
2 Correct 187 ms 290336 KB Output is correct
3 Correct 188 ms 290244 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 185 ms 290228 KB Output is correct
2 Correct 184 ms 290428 KB Output is correct
3 Correct 213 ms 291312 KB Output is correct
4 Correct 193 ms 290740 KB Output is correct
5 Correct 190 ms 290440 KB Output is correct
6 Correct 185 ms 290496 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 186 ms 290324 KB Output is correct
2 Correct 634 ms 316272 KB Output is correct
3 Correct 410 ms 313596 KB Output is correct
4 Correct 338 ms 308556 KB Output is correct
5 Correct 403 ms 313464 KB Output is correct
6 Correct 337 ms 306376 KB Output is correct
7 Correct 328 ms 308516 KB Output is correct
8 Correct 334 ms 307768 KB Output is correct

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 234 ms 293084 KB Output is correct
2 Execution timed out 3087 ms 417556 KB Time limit exceeded
3 Halted 0 ms 0 KB -