oj.uz

Submission #496717

# Submission time Handle Problem Language Result Execution time Memory
496717 2021-12-22T03:13:13 Z JerryLiu06 Table Tennis (info1cup20_tabletennis) C++17
20 / 100
 26 ms 4956 KB 
// https://oj.uz/problem/view/info1cup20_tabletennis
 
#include <bits/stdc++.h>
 
using namespace std;
 
using ll = long long;
using ld = long double;
using db = double;
using str = string;
 
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
 
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
 
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(0);
#define FASTIOF ios_base::sync_with_stdio(false); fin.tie(0);
 
#define mp make_pair
#define f first
#define s second
 
#define sz(x) (int)(x).size()
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define sor(x) sort(all(x))
#define rev(x) reverse(all(x))
#define rsz resize
#define ins insert 
#define ft front()
#define bk back()
#define pb push_back
#define pf push_front
 
#define lb lower_bound
#define ub upper_bound
 
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define R0F(i, a) ROF(i, 0, a)
#define EACH(a, x) for (auto& a : x)
 
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); }
ll fdiv(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); }
 
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
 
template<class T> void remDup(vector<T>& v) { sor(v); v.erase(unique(all(v)), v.end()); }
 
const int MOD = 1e9 + 7;
const int MX = 15e4 + 410;
const ll INF = 1e18;
 
int N, K, A[MX]; unordered_map<int, int> freq; vi possSum;
 
bool valid(int sum) {
    int L = 1, R = N + K;
    int numGroup = 0;
 
    while (L < R) {
        while (A[L] + A[R] != sum) {
            if (A[L] + A[R] < sum) {
                L++;
            }
            else {
                R--;
            }
            if (L >= R) {
                break;
            }
        }
        if (L >= R) {
            break;
        }
        numGroup++;
        
        if (numGroup >= N / 2) {
        	return true;
        }
        L++;
        R--;
    }
    return false;
}
 
int main() {
    FASTIO;
 
    cin >> N >> K;
 
    FOR(i, 1, N + K + 1) {
        cin >> A[i];
    }
    FOR(i, 1, K + 2) {
        FOR(j, N, N + K + 1) {
            freq[A[i] + A[j]]++;
        }
    }
    EACH(P, freq) {
        if (P.s > K / 2) {
            possSum.pb(P.f);
        }
    }
    int res = 0;
    
    EACH(sum, possSum) {
        if (valid(sum)) {
            res = sum;
            break;
        }
    }
    vi ans(N);
 
    int L = 1, R = N + K;
    int numGroup = 0;
 
    while (L < R) {
        while (A[L] + A[R] != res) {
            if (A[L] + A[R] < res) {
                L++;
            }
            else {
                R--;
            }
        }
        ans[numGroup] = A[L];
        ans[N - 1 - numGroup] = A[R];
 
        numGroup++;
 
        if (numGroup >= N / 2) {
            break;
        }
        L++;
        R--;
    }
    EACH(i, ans) {
        cout << i << " ";
    }
}

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 3 ms 588 KB Output is correct
2 Correct 24 ms 2920 KB Output is correct
3 Correct 26 ms 2908 KB Output is correct
4 Correct 24 ms 2956 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 2980 KB Output is correct
2 Incorrect 21 ms 1740 KB Output not subsequence of input
3 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 588 KB Output not subsequence of input
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output not subsequence of input
2 Halted 0 ms 0 KB -

Subtask #6
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output not subsequence of input
2 Halted 0 ms 0 KB -

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 332 KB Output not subsequence of input
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 17 ms 4956 KB Output not subsequence of input
2 Halted 0 ms 0 KB -