oj.uz

Submission #481813

# Submission time Handle Problem Language Result Execution time Memory
481813 2021-10-22T01:06:00 Z Yazan_Alattar Table Tennis (info1cup20_tabletennis) C++14
20 / 100
 31 ms 3820 KB 
#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <list>
#include <utility>
#include <cmath>
#include <numeric>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 200007;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};

int n, k, a[M];

int solve(int sum)
{
    int l = 1, r = n + k, ret = 0;
    while(l < r){
        if(a[l] + a[r] == sum){
            ++l;
            --r;
        }
        else if(a[l] + a[r] > sum){
            --r;
            if(ret != 0) ret = -1;
            else ret = r +  1;
        }
        else{
            ++l;
            if(ret != 0) ret = -1;
            else ret = l - 1;
        }
    }
    if(ret == 0) ret = (n + k - 1) / 2 + 1;
    return ret;
}

int main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> k;
    for(int i = 1; i <= n + k; ++i) cin >> a[i];
    sort(a + 1, a + n + k + 1);
    int res = solve(a[1] + a[n + k]);
    if(res == -1) res = solve(a[2] + a[n + k]);
    if(res == -1) res = solve(a[1] + a[n + k - 1]);
    if(res == -1) res = solve(a[2] + a[n + k - 1]);
    for(int i = 1; i <= n + k; ++i) if(i != res) cout << a[i] << " ";
    cout << endl;
    return 0;
}
// Don't forget special cases. (n = 1?)
// Look for the constraints. (Runtime array? overflow?)

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 716 KB Output is correct
2 Correct 31 ms 3820 KB Output is correct
3 Correct 30 ms 3748 KB Output is correct
4 Correct 30 ms 3740 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 30 ms 3732 KB Output does not have symmetry property
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Extra information in the output file
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Extra information in the output file
2 Halted 0 ms 0 KB -

Subtask #6
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Extra information in the output file
2 Halted 0 ms 0 KB -

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Extra information in the output file
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Extra information in the output file
2 Halted 0 ms 0 KB -