Submission #514349

#TimeUsernameProblemLanguageResultExecution timeMemory
514349Theo830Table Tennis (info1cup20_tabletennis)C++17
9 / 100
20 ms2756 KiB
#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 bool check(vll a){ ll sum = a[0] + a.back(); ll n = a.size(); f(j,0,n){ if(sum != (a[j] + a[n - j - 1])){ return false; } } return true; } int main(void){ ios_base::sync_with_stdio(0); cin.tie(0); ll n,k; cin>>n>>k; ll arr[n+k]; f(i,0,n+k){ cin>>arr[i]; } assert(n + k <= 18); vll ans; f(i,0,1LL<<(n+k)){ vll a; f(j,0,n+k){ if(i & (1LL<<j)){ a.pb(arr[j]); } } if((ll)a.size() == n){ if(check(a)){ ans = a; break; } else{ cout<<"checked"; } } } for(auto x:ans){ cout<<x<<" "; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...