oj.uz

Submission #691811

# Submission time Handle Problem Language Result Execution time Memory
691811 2023-01-31T15:37:22 Z VahanAbraham Table Tennis (info1cup20_tabletennis) C++14
0 / 100
 3000 ms 6100 KB 
#include <iostream>
#include <string>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <sstream>
#include <map>
#include <stack>
#include <set>
#include <queue>
#include <unordered_set>
#include <unordered_map>
#include <math.h>
#include <cmath>
#include <vector>
using namespace std;


#define ll long long
#define fr first
#define sc second
#define pb push_back
#define US freopen("hps.in", "r", stdin); freopen("hps.out", "w", stdout);

ll gcd(ll a, ll b)
{
    if (a == 0 || b == 0) {
        return  max(a, b);
    }
    if (a <= b) {
        return gcd(a, b % a);
    }
    else {
        return gcd(a % b, b);
    }
}

ll lcm(ll a, ll b) {
    return (a / gcd(a, b)) * b;
}

int isprime(int p)
{
    if (p <= 1) {
        return 0;
    }
    for (int i = 2; i * i <= p; i++) {
        if (p % i == 0) {
            return 0;
        }
    }
    return 1;
}

const int N = 200005;
pair<ll, ll>  p[N], ps[N];
vector <int> g[N];


ll a[N];




void solve() {
    int n, k;
    cin >> n >> k;
    int h = n + k;
    for (int i = 0;i < h;i++) {
        cin >> a[i];
    }
    sort(a, a + h);
    if (n == 2) {
        if (a[1] == a[2]) {
            cout << a[1] << " " << a[2] << endl;
        }
        else {
            if (a[1] == a[0]) {
                cout << a[1] << " " << a[0];
            }
            else {
                cout << a[0] << " " << a[2] << endl;
            }
        }
        return;
    }
    bool fl = true;
    int z = 0;
    int l = 0, r = 0;
    set<ll> s;
    ll x = a[1] - a[0],ans=0;
    for (int i = 0;i < h;i++) {
        l = 0, r = h - 1;
        while (l < r) {
            if (l == i) {
                l++;
            }
            if (r == i) {
                r--;
            }
            s.insert(a[r] - a[l]);
        }
        if (s.size() == 1) {
            for (int j = 0;j < h;j++) {
                if (i != j) {
                    cout << a[j] << " ";
                }
            }
            return;
        }
        s.clear();
    }
}


int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    //US
    int tt = 1;
    //cin >> tt;
    while (tt--) {
        solve();
    }
}
/*

              %%           %%         %           %%      %%            %          %%     %%
               %%         %%        %% %%         %%      %%          %% %%        %%%%   %%
                %%       %%        %%   %%        %%      %%         %%   %%       %% %%  %%
                 %%     %%        %%%%%%%%%       %%%%%%%%%%        %%%%%%%%%      %%  %% %%
                  %%   %%        %%       %%      %%      %%       %%       %%     %%   %%%%
                   %% %%        %%         %%     %%      %%      %%         %%    %%    %%%
                     %         %%           %%    %%      %%     %%           %%   %%     %%


*/

Compilation message

tabletennis.cpp: In function 'void solve()':
tabletennis.cpp:87:10: warning: unused variable 'fl' [-Wunused-variable]
   87 |     bool fl = true;
      |          ^~
tabletennis.cpp:88:9: warning: unused variable 'z' [-Wunused-variable]
   88 |     int z = 0;
      |         ^
tabletennis.cpp:91:8: warning: unused variable 'x' [-Wunused-variable]
   91 |     ll x = a[1] - a[0],ans=0;
      |        ^
tabletennis.cpp:91:24: warning: unused variable 'ans' [-Wunused-variable]
   91 |     ll x = a[1] - a[0],ans=0;
      |                        ^~~

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3063 ms 4948 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3087 ms 5076 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3099 ms 6100 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3095 ms 4948 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3082 ms 4948 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3065 ms 5020 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3075 ms 4948 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3075 ms 4948 KB Time limit exceeded
2 Halted 0 ms 0 KB -