oj.uz

Submission #227791

# Submission time Handle Problem Language Result Execution time Memory
227791 2020-04-28T19:57:23 Z blacktulip Table Tennis (info1cup20_tabletennis) C++17
49 / 100
 3000 ms 507104 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long lo;
typedef pair< lo,lo > PII;
 
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define int long long
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
 
const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;
 
int n,m,b[li],a[li],k,flag,t,sum;
int cev;
string s;
map<int,int> mpp;
vector<int> v;
 
main(void){
	scanf("%lld %lld",&n,&k);
	for(int i=1;i<=n+k;i++)scanf("%lld",&a[i]);
	for(int i=1;i<=n+k;i++){
		for(int j=i+1;j<=n+k;j++){
			mpp[a[i]+a[j]]++;
			if(mpp[a[i]+a[j]]==n/2){sum=a[i]+a[j];break;}
		}
		if(sum)break;
	}
	int bas=1;
	int son=n+k;
	while(bas<=n/2){
		flag=0;
		for(int i=son;i>=1;i--){
			if(a[bas]+a[i]==sum){flag=1;v.pb(a[bas]);v.pb(a[i]);son=i-1;bas++;break;}
		}
		if(!flag){bas++;n+=2;}
	}
	sort(v.begin(),v.end());
	for(int i=0;i<(int)v.size();i++){
		printf("%lld ",v[i]);
	}
	return 0;
}

Compilation message

tabletennis.cpp:32:10: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(void){
          ^
tabletennis.cpp: In function 'int main()':
tabletennis.cpp:33:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld %lld",&n,&k);
  ~~~~~^~~~~~~~~~~~~~~~~~~
tabletennis.cpp:34:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=n+k;i++)scanf("%lld",&a[i]);
                         ~~~~~^~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 558 ms 48508 KB Output is correct
2 Correct 149 ms 760 KB Output is correct
3 Correct 686 ms 66876 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3082 ms 2168 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3096 ms 462524 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 512 KB Output is correct
2 Correct 8 ms 1280 KB Output is correct
3 Correct 6 ms 640 KB Output is correct
4 Correct 7 ms 1024 KB Output is correct
5 Correct 6 ms 640 KB Output is correct

Subtask #5
9.0 / 9.0

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

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 196 ms 2808 KB Output is correct
3 Correct 1373 ms 87288 KB Output is correct
4 Correct 1004 ms 68344 KB Output is correct
5 Correct 157 ms 1916 KB Output is correct
6 Correct 184 ms 1376 KB Output is correct

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Execution timed out 3106 ms 357648 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 640 KB Output is correct
2 Execution timed out 3103 ms 507104 KB Time limit exceeded
3 Halted 0 ms 0 KB -