oj.uz

Submission #987404

# Submission time Handle Problem Language Result Execution time Memory
987404 2024-05-22T17:11:16 Z Zbyszek99 Table Tennis (info1cup20_tabletennis) C++17
100 / 100
 140 ms 6064 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ff first
#define ss second
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define size(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace std;
//mt19937 mt;void random(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll rand(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

ll tab[150400];

void solve()
{
    int n,k;
    cin >> n >> k;
    rep(i,n+k)
    {
        cin >> tab[i];
    }
    //sort(tab,tab+(n+k));
    for(int i = 0; i <= k; i++)
    {
        for(int j = n+k-1; j >= n-1; j--)
        {
            
            if(i == j) continue;
            int r = i+1;
            int l = j-1;
            ll w = tab[i] + tab[j];
          //  cout << i << " " << j << " " << w << "\n";
            int how_many_pairs = 1;
            while(l > r)
            {
                while(l > r && tab[r] + tab[l] < w)
                {
                    r++;
                }
                while(l > r && tab[r] + tab[l] > w)
                {
                    l--;
                }
                if(l > r && tab[r] + tab[l] == w)
                {
                    how_many_pairs++;
                    r++;
                    l--;
                }
                else break;
            }
           // cout << i << " " << j << "\n";
            if(how_many_pairs >= n/2)
            {
                vector<ll> wyn = {tab[i],tab[j]};
                r = i+1;
                l = j-1;
                while(l > r)
                {
                    while(l > r && tab[r] + tab[l] < w)
                    {
                        r++;
                    }
                    while(l > r && tab[r] + tab[l] > w)
                    {
                        l--;
                    }
                    if(l > r)
                    {
                        if(size(wyn) != n)
                        {
                            wyn.pb(tab[r]);wyn.pb(tab[l]);
                        }
                        r++;
                        l--;
                    }
                }
                sort(all(wyn));
                rep(i,n) cout << wyn[i] << " ";
                return;
            }
        }
    }
}

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
 //   random();
    int t = 1;
  //  cin >> t;
    while(t--) solve();
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 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 1248 KB Output is correct
2 Correct 26 ms 5836 KB Output is correct
3 Correct 27 ms 5852 KB Output is correct
4 Correct 29 ms 5836 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 5744 KB Output is correct
2 Correct 27 ms 5832 KB Output is correct
3 Correct 26 ms 5856 KB Output is correct
4 Correct 27 ms 5728 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 344 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

Subtask #5
9.0 / 9.0

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

Subtask #6
14.0 / 14.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 344 KB Output is correct
4 Correct 1 ms 344 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 1 ms 344 KB Output is correct
2 Correct 28 ms 6064 KB Output is correct
3 Correct 26 ms 5736 KB Output is correct
4 Correct 30 ms 5844 KB Output is correct
5 Correct 26 ms 5832 KB Output is correct
6 Correct 32 ms 5736 KB Output is correct
7 Correct 26 ms 5836 KB Output is correct
8 Correct 27 ms 5832 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 69 ms 5832 KB Output is correct
3 Correct 26 ms 5836 KB Output is correct
4 Correct 44 ms 5736 KB Output is correct
5 Correct 26 ms 5580 KB Output is correct
6 Correct 140 ms 5768 KB Output is correct
7 Correct 44 ms 5852 KB Output is correct
8 Correct 27 ms 5840 KB Output is correct