oj.uz

Submission #514454

# Submission time Handle Problem Language Result Execution time Memory
514454 2022-01-18T08:00:24 Z Theo830 Table Tennis (info1cup20_tabletennis) C++17
72 / 100
 3000 ms 172132 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ii,ll>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
int main(void){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll n,k;
    cin>>n>>k;
    ll arr[n+k];
    vll ans[2];
    map<ll,bool>ex;
    f(i,0,n+k){
        cin>>arr[i];
        ex[arr[i]] = 1;
    }
    map<ll,ll>mp;
    ll sum = 0;
    f(i,0,n+k){
        f(j,max(i+1,n-i-2*k-10),min(n+k,n-i+2*k+10)){
            mp[arr[i] + arr[j]] += 2;
            if(mp[arr[i]+arr[j]] >= n){
                sum = arr[i] + arr[j];
                break;
            }
        }
    }
    f(i,0,n+k){
        if(ex[sum - arr[i]]){
            ans[0].pb(arr[i]);
            ans[1].pb(sum - arr[i]);
        }
        if(ans[0].size() == n/2){
            break;
        }
    }
    for(auto x:ans[0]){
        cout<<x<<" ";
    }
    reverse(all(ans[1]));
    for(auto x:ans[1]){
        cout<<x<<" ";
    }
}

Compilation message

tabletennis.cpp: In function 'int main()':
tabletennis.cpp:53:26: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   53 |         if(ans[0].size() == n/2){
      |            ~~~~~~~~~~~~~~^~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2124 KB Output is correct
2 Correct 664 ms 20568 KB Output is correct
3 Correct 641 ms 20652 KB Output is correct
4 Correct 650 ms 20640 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 13764 KB Output is correct
2 Correct 286 ms 19192 KB Output is correct
3 Correct 113 ms 13912 KB Output is correct
4 Correct 276 ms 19248 KB Output is correct

Subtask #4
15.0 / 15.0

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

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 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 6 ms 532 KB Output is correct
3 Correct 35 ms 5832 KB Output is correct
4 Correct 9 ms 1612 KB Output is correct
5 Correct 4 ms 460 KB Output is correct
6 Correct 5 ms 460 KB Output is correct

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Execution timed out 3097 ms 35932 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 5956 KB Output is correct
2 Execution timed out 3079 ms 172132 KB Time limit exceeded
3 Halted 0 ms 0 KB -