Submission #686295

#TimeUsernameProblemLanguageResultExecution timeMemory
686295Alihan_8Table Tennis (info1cup20_tabletennis)C++17
49 / 100
3090 ms1492 KiB
#include <bits/stdc++.h> // include <ext/pb_ds/assoc_container.hpp> // include <ext/pb_ds/tree_policy.hpp> // using namespace __gnu_pbds; using namespace std; #define all(x) x.begin(), x.end() #define pb push_back // define ordered_set tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update> #define mpr make pair #define ln '\n' void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);} #define int long long signed main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int n, k; cin >> n >> k; vector <int> p(n+k); for ( auto &i: p ) cin >> i; sort(all(p)); vector <int> res; auto ok = [&](int sum){ int l = 0, r = n+k-1, cnt = 0; while ( cnt < n and l < r ){ if ( p[l]+p[r] == sum ){ if ( (int)res.size() < n ){ res.pb(p[l]), res.pb(p[r]); } l++, r--; } else if ( p[l]+p[r] < sum ) l++; else r--; } if ( (int)res.size() < n ){ res.clear(); return false; } return true; }; for ( int i = 0; i < n+k; i++ ){ for ( int j = i+1; j < n+k; j++ ){ if ( ok(p[i]+p[j]) ){ sort(all(res)); for ( auto i: res ) cout << i << ' '; return 0; } } } assert(false); cout << '\n'; }

Compilation message (stderr)

tabletennis.cpp: In function 'void IO(std::string)':
tabletennis.cpp:11:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
tabletennis.cpp:11:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#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...