Submission #685897

#	Time	Username	Problem	Language	Result	Execution time	Memory
685897		Alihan_8	Table Tennis (info1cup20_tabletennis)	C++17	0 / 100	32 ms	4296 KiB

tabletennis

#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;
    int cnt = accumulate(all(p), 0ll);
    int res = -1;
    for ( int i = 0; i < n+k; i++ ){
        int cur = (cnt-p[i]), team = n/2;
        if ( cur%team ) continue;
        res = i+1;
    }
    vector <int> ans;
    for ( int i = 1; i <= n+k; i++ ){
        if ( i != res ) ans.pb(p[i-1]);
    }
    sort(all(ans));
    for ( auto i: ans ) cout << i << ' ';

    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);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 11
• Subtask 2: 0 / 9
• Subtask 3: 0 / 14
• Subtask 4: 0 / 15
• Subtask 5: 0 / 9
• Subtask 6: 0 / 14
• Subtask 7: 0 / 15
• Subtask 8: 0 / 13