제출 #496714

#제출 시각아이디문제언어결과실행 시간메모리
496714JerryLiu06Table Tennis (info1cup20_tabletennis)C++17
20 / 100
34 ms4996 KiB
// 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 (true) { 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]]++; if (freq[A[i] + A[j]] == K / 2 + 1) { possSum.pb(A[i] + A[j]); } } } 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 (true) { 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 << " "; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...