oj.uz

Submission #227734

# Submission time Handle Problem Language Result Execution time Memory
227734 2020-04-28T15:43:23 Z blacktulip Table Tennis (info1cup20_tabletennis) C++17
9 / 100
 3000 ms 567900 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 = 4000005;
const lo mod = 1000000007;

int n,m,b[li],a[li],k,flag,t,sum,say;
int cev;
string s;
map<int,int> mpp1,mpp;
vector<int> v[li];

main(void){
	scanf("%lld %lld",&n,&k);
	FOR scanf("%lld",&a[i]);
	FOR{
		for(int j=i+1;j<=n;j++){
			mpp[a[i]+a[j]]++;
			if(mpp1[a[i]+a[j]]==0)mpp1[a[i]+a[j]]=++say;
			v[mpp1[a[i]+a[j]]].pb(a[i]);
			v[mpp1[a[i]+a[j]]].pb(a[j]);
			if(mpp[a[i]+a[j]]==n/2){sum=a[i]+a[j];break;}
		}
		if(sum)break;
	}
	if(sum){
		sort(v[mpp1[sum]].begin(),v[mpp1[sum]].end());
		for(int i=0;i<n;i++){
			printf("%lld ",v[mpp1[sum]][i]);
		}
	}
	else{for(int i=1;i<=n;i++){printf("-1 ");}return 0;}
	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:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  FOR scanf("%lld",&a[i]);
      ~~~~~^~~~~~~~~~~~~~

Subtask #1
0 / 11.0

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

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3105 ms 257124 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 3110 ms 521364 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 94328 KB Output is correct
2 Incorrect 58 ms 94840 KB Output not subsequence of input
3 Halted 0 ms 0 KB -

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 94200 KB Output is correct
2 Correct 54 ms 94208 KB Output is correct
3 Correct 55 ms 94200 KB Output is correct

Subtask #6
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 94200 KB Output is correct
2 Incorrect 760 ms 140616 KB Output not subsequence of input
3 Halted 0 ms 0 KB -

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 94200 KB Output is correct
2 Execution timed out 3113 ms 512124 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 94200 KB Output is correct
2 Execution timed out 3116 ms 567900 KB Time limit exceeded
3 Halted 0 ms 0 KB -