oj.uz

Submission #686334

# Submission time Handle Problem Language Result Execution time Memory
686334 2023-01-25T08:05:21 Z Alihan_8 Table Tennis (info1cup20_tabletennis) C++17
100 / 100
 140 ms 5580 KB 
#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(n);
    auto ok = [&](int sum){
        int l = 0, r = n+k-1, it = 0;
        while ( it < n and l < r and (r-l+1)+it >= n ){
            if ( p[l]+p[r] == sum ){
                res[it++] = p[l];
                res[it++] = p[r];
                l++, r--;
            }
            else if ( p[l]+p[r] < sum ) l++;
            else r--;
        }
        return it == n;
    };
    for ( int i = 0; i <= k; i++ ){
        for ( int j = n-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

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
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 724 KB Output is correct
2 Correct 32 ms 4120 KB Output is correct
3 Correct 31 ms 4156 KB Output is correct
4 Correct 34 ms 4180 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 4044 KB Output is correct
2 Correct 32 ms 4076 KB Output is correct
3 Correct 32 ms 4128 KB Output is correct
4 Correct 38 ms 4128 KB Output is correct

Subtask #4
15.0 / 15.0

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

Subtask #5
9.0 / 9.0

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

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 36 ms 4172 KB Output is correct
3 Correct 31 ms 4044 KB Output is correct
4 Correct 31 ms 4064 KB Output is correct
5 Correct 36 ms 4064 KB Output is correct
6 Correct 39 ms 4068 KB Output is correct
7 Correct 33 ms 4072 KB Output is correct
8 Correct 32 ms 4112 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 121 ms 4068 KB Output is correct
3 Correct 35 ms 5580 KB Output is correct
4 Correct 88 ms 5576 KB Output is correct
5 Correct 47 ms 5456 KB Output is correct
6 Correct 46 ms 5580 KB Output is correct
7 Correct 140 ms 5516 KB Output is correct
8 Correct 47 ms 5452 KB Output is correct