Submission #862487

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
862487	2023-10-18T10:31:51 Z	aykhn	Table Tennis (info1cup20_tabletennis)	C++14	100 / 100	56 ms	4396 KB

tabletennis

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
// author : AtabeyR
 
#define pb          push_back
#define pii         pair<int, int>
#define pll         pair<ll, ll>
#define all(v)      v.begin(), v.end()
#define OPT         ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define sec         second
#define fi          first
#define int         ll
#define print(k)    cerr << "Ans : "; cout << k << endl;
#define ins         insert
#define bpc         __builtin_popcountll
#define skip        continue
#define endll        '\n'
#define gcd(a, b)   __gcd(a, b)
#define lcm(a, b)   a*b / (__gcd(a, b))
 
typedef long long ll;
typedef unsigned long long ull;
const int oo = 0x3F3F3F3F;
const int ooo = 0x3F3F3F3F3F3F3F3FLL;
const int mod = 998244353;
const int sz = 2e5;
using namespace std;
using namespace __gnu_pbds;
template<class T> using ordered_set = tree<T, null_type,less<T>, rb_tree_tag,tree_order_statistics_node_update>;
 
void open(string s)
{
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
 
int n, m, k, a[sz];
 
vector<int> f(int s, int e, int rem)
{
    int ls = s, rs = e, team = 1;
    s++;
    e--;
    vector<int> v;
    v.pb(a[s-1]);
    v.pb(a[e+1]);
    while(s < e)
    {
        if(a[s] - a[ls] < a[rs] - a[e])
        {
            rem--;
            s++;
        }
        else if(a[s] - a[ls] > a[rs] - a[e])
        {
            rem--;
            e--;
        }
        else
        {
            ls = s;
            rs = e;
            v.pb(a[ls]);
            v.pb(a[rs]);
            s++;
            e--;
        }
        if(rem < 0 || v.size() == n) break;
    }
    vector<int> tmp;
    if(v.size() != n) return tmp;
 
    sort(all(v));
    return v;
}
 
void solve()
{
    cin >> n >> k;
 
    for(int i = 1; i<=n+k; i++)cin >> a[i];
 
    for(int i = 0; i<=k; i++)
    {
        for(int j = 0; j<=i; j++)
        {
            vector<int> g = f(j+1, n+k-(i-j), k-i);
            if(g.empty())skip;
            
            for(int i : g)cout << i << " ";
            return;
        }
    }
}
 
int32_t main()  
{
    // open("i");
 
    OPT
    int t = 1;
    // cin >> t;
 
    for(int i = 1; i<=t; i++)
        solve();
}

Compilation message

tabletennis.cpp: In function 'std::vector<long long int> f(ll, ll, ll)':
tabletennis.cpp:70:32: 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]
   70 |         if(rem < 0 || v.size() == n) break;
      |                       ~~~~~~~~~^~~~
tabletennis.cpp:73:17: 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]
   73 |     if(v.size() != n) return tmp;
      |        ~~~~~~~~~^~~~
tabletennis.cpp:43:25: warning: unused variable 'team' [-Wunused-variable]
   43 |     int ls = s, rs = e, team = 1;
      |                         ^~~~
tabletennis.cpp: In function 'void open(std::string)':
tabletennis.cpp:35:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
tabletennis.cpp:36:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	992 KB	Output is correct
2	Correct	25 ms	4308 KB	Output is correct
3	Correct	25 ms	4392 KB	Output is correct
4	Correct	25 ms	4308 KB	Output is correct

Subtask #3
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	25 ms	4308 KB	Output is correct
2	Correct	25 ms	4304 KB	Output is correct
3	Correct	24 ms	4304 KB	Output is correct
4	Correct	26 ms	4296 KB	Output is correct

Subtask #4
15.0 / 15.0

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

Subtask #5
9.0 / 9.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct

Subtask #6
14.0 / 14.0

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

Subtask #7
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	26 ms	4248 KB	Output is correct
3	Correct	25 ms	4304 KB	Output is correct
4	Correct	28 ms	4304 KB	Output is correct
5	Correct	25 ms	4304 KB	Output is correct
6	Correct	25 ms	4224 KB	Output is correct
7	Correct	24 ms	4308 KB	Output is correct
8	Correct	27 ms	4396 KB	Output is correct

Subtask #8
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	56 ms	344 KB	Output is correct
2	Correct	45 ms	4296 KB	Output is correct
3	Correct	41 ms	4296 KB	Output is correct
4	Correct	42 ms	4224 KB	Output is correct
5	Correct	34 ms	4256 KB	Output is correct
6	Correct	25 ms	4304 KB	Output is correct
7	Correct	50 ms	4296 KB	Output is correct
8	Correct	32 ms	4300 KB	Output is correct