oj.uz

Submission #692475

# Submission time Handle Problem Language Result Execution time Memory
692475 2023-02-01T13:56:06 Z Ahmed_Solyman Table Tennis (info1cup20_tabletennis) C++14
0 / 100
 3000 ms 163784 KB 
#include <bits/stdc++.h>
#include <ext/rope>
 
using namespace std;
using namespace __gnu_cxx;
#pragma GCC optimize("-Ofast")
#pragma GCC optimize("-O1")
//-------------------------------------------------------------//
typedef long long ll;
typedef unsigned long long ull;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define PI acos(-1)
#define lb lower_bound
#define ub upper_bound
#define endl '\n'
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define sum_to(n) (n*(n+1))/2
#define pb push_back
#define pf push_front
#define sz size()
#define fil(arr,x) memset(arr,x,sizeof(arr))
const ll mod=1e9+7;
int dx[8]={0,1,0,-1,1,1,-1,-1};
int dy[8]={1,0,-1,0,1,-1,-1,1};
//-------------------------------------------------------------//
ll lcm(ll a,ll b)
{
    return (max(a,b)/__gcd(a,b))*min(a,b);
}
void person_bool(bool x)
{
    cout<<(x?"YES":"NO")<<endl;
}
int main()
{
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    fast
    int n,k;cin>>n>>k;
    vector<int>arr(n+k);
    map<int,bool>vis;
    for(auto &i:arr){
    	cin>>i;
    	vis[i]=1;
    }
    for(int i=0;i<=k;i++){
    	for(int j=n-1;j<n+k;j++){
    		if(i==j)continue;
    		int s=arr[i]+arr[j];
    		int cnt=0;
    		for(int g=n+k;g>(n+k)/2;g--){
    			cnt+=vis[s-arr[g]]*2;
    		}
    		if(cnt>=n){
    			cnt=0;
    			for(int g=n+k;g>(n+k)/2;g--){
    				if(cnt==n){
    					return 0;
    				}
    				if(vis[s-arr[g]]){
		    			cnt+=2;
		    			cout<<arr[g]<<" "<<s-arr[g]<<" ";
		    		}
	    		}
    			return 0;
    		}
    	}
    }
    return 0;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 596 KB Output not sorted
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 1612 KB Output not sorted
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 182 ms 29644 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 383 ms 26988 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #6
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 468 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 468 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

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