oj.uz

Submission #862468

# Submission time Handle Problem Language Result Execution time Memory
862468 2023-10-18T09:53:50 Z aykhn Table Tennis (info1cup20_tabletennis) C++14
100 / 100
 52 ms 5864 KB 
#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];
 
bool f(int start, int end, int rem)
{   
 
    int s = start, e = end, ls = s, rs = e;
    s++;
    e--;
    
    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
        {
            s++;
            e--;
        }
        if(rem < 0)break;
    }
  	if (s == e) rem--;
    if(rem < 0 || rem % 2)return 0;
 
    s = start + 1;
    e = end - 1;
    ls = start;
    rs = end;
 
    vector<int> l, r;
 
    l.pb(a[ls]);
    r.pb(a[rs]);
 
    while(s < e)
    {
        if(a[s] - a[ls] < a[rs] - a[e])
        {
            s++;
        }
        else if(a[s] - a[ls] > a[rs] - a[e])
        {
            e--;
        }
        else
        {
			if (l.size() < n/2)
			{
				l.pb(a[s]);
            	r.pb(a[e]);
			}
            s++;
            e--;
        }
    }
 
 
    for(int i : l)cout << i << " ";
    reverse(all(r));
    for(int i : r)cout << i << " ";
    return 1;
}
 
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++)
        {
            if(f(j+1, n+k-(i-j), k-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 'bool f(ll, ll, ll)':
tabletennis.cpp:92: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]
   92 |    if (l.size() < n/2)
      |        ~~~~~~~~~^~~~~
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 0 ms 348 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1112 KB Output is correct
2 Correct 21 ms 4340 KB Output is correct
3 Correct 23 ms 4288 KB Output is correct
4 Correct 22 ms 4284 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 4292 KB Output is correct
2 Correct 22 ms 4540 KB Output is correct
3 Correct 21 ms 4536 KB Output is correct
4 Correct 27 ms 4288 KB Output is correct

Subtask #4
15.0 / 15.0

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

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 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 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 22 ms 4552 KB Output is correct
3 Correct 21 ms 4296 KB Output is correct
4 Correct 23 ms 4296 KB Output is correct
5 Correct 21 ms 4292 KB Output is correct
6 Correct 22 ms 4544 KB Output is correct
7 Correct 22 ms 4292 KB Output is correct
8 Correct 21 ms 4476 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 344 KB Output is correct
2 Correct 38 ms 4288 KB Output is correct
3 Correct 32 ms 4288 KB Output is correct
4 Correct 29 ms 4296 KB Output is correct
5 Correct 24 ms 4288 KB Output is correct
6 Correct 22 ms 4548 KB Output is correct
7 Correct 42 ms 5864 KB Output is correct
8 Correct 26 ms 5804 KB Output is correct