| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1231968 | Aisha | Table Tennis (info1cup20_tabletennis) | C++20 | 3096 ms | 12096 KiB |
#include "bits/stdc++.h"
using namespace std;
#define int long long
signed main() {
int n, k;
cin >> n >> k;
vector <int> a(n + k);
for (int i = 0; i < n + k; i ++) cin >> a[i];
// a is sorted
vector <int> v(n + k, 0);
int cnt1, cnt2, cnt0, sum1, sum2;
cnt1 = cnt2 = cnt0 = sum1 = sum2 = 0;
bool ok = false;
auto rec = [&](auto&& rec, int i) -> void {
if (ok) return;
if (i == n + k) {
cnt1 = 0, cnt2 = 0, cnt0 = 0;
for (int j = 0; j < n + k; j ++) {
if (v[j] == 1) sum1 += a[j], cnt1 ++;
else if (v[j] == 2) sum2 += a[j], cnt2 ++;
else cnt0 ++;
}
if (sum1 != sum2 || cnt1 != cnt2 || cnt0 != k) return;
for (int j = 0; j < n + k; j ++) {
if (v[j] == 1 || v[j] == 2) cout << a[j] << ' ';
}
cout << endl;
ok = true;
return;
}
v[i] = 0; rec(rec, i + 1);
v[i] = 1; rec(rec, i + 1);
v[i] = 2; rec(rec, i + 1);
v[i] = 0;
};
rec(rec, 0);
if (!ok) cout << -1 / 0 << endl;
return 0;
}컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
