oj.uz

답안 #744456

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
744456 2023-05-18T15:09:41 Z fanwen Table Tennis (info1cup20_tabletennis) C++17
100 / 100
 278 ms 33844 KB 
#include <bits/stdc++.h>

using namespace std;

#define MASK(x) (1LL << (x))
#define BIT(x, i) (((x) >> (i)) & 1)
#define ALL(x) (x).begin(), (x).end()

#define REP(i, n) for (int i = 0, _n = n; i < _n; ++i)
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; --i)
#define FORE(it, s) for (__typeof(s.begin()) it = (s).begin(); it != (s).end(); ++it)

#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
#define file(TASK)                         \
    if (fopen(TASK ".inp", "r")) {         \
        freopen(TASK ".inp", "r", stdin);  \
        freopen(TASK ".out", "w", stdout); \
    }

template <class U, class V> bool maximize(U &A, const V &B) { return (A < B) ? (A = B, true) : false; }
template <class U, class V> bool minimize(U &A, const V &B) { return (A > B) ? (A = B, true) : false; }

const int MAXN = 2e5 + 5;
int N, K, a[MAXN];

void check (int sum) {

    vector <int> ans;
    for (int i = 1, j = N + K; i < j; i++) {
        while(j > i && a[j] + a[i] > sum) --j;
        if(j > i && a[i] + a[j] == sum) {
            ans.push_back(a[i]);
            ans.push_back(a[j]);
        }
    }
    if((int) ans.size() == N) {
        sort(ALL(ans));
        for (auto x : ans) cout << x << " ";
        exit(0);
    }
}

void process(void) {

    cin >> N >> K;

    FOR(i, 1, N + K) cin >> a[i];
    sort(a + 1, a + N + K + 1);

    if(4 * K >= N) {
        FOR(i, 1, N + K) FOR(j, i + 1, N + K) check(a[i] + a[j]);
    }
    map <int, int> mp;

    FOR(i, 1, 2 * K) FOR(j, N - K + 1, N + K) mp[a[i] + a[j]]++;
    for (auto [sum, cnt] : mp) if(cnt >= K) check(sum);
}

signed main() {
    file("TASK");
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int test = 1;
    // cin >> test;
    while(test--) {
        process();
        cout << '\n';
    }
    cerr << "Time elapsed: " << TIME << " s.\n";
    return (0 ^ 0);
}

Compilation message

tabletennis.cpp: In function 'int main()':
tabletennis.cpp:17:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |         freopen(TASK ".inp", "r", stdin);  \
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
tabletennis.cpp:61:5: note: in expansion of macro 'file'
   61 |     file("TASK");
      |     ^~~~
tabletennis.cpp:18:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |         freopen(TASK ".out", "w", stdout); \
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
tabletennis.cpp:61:5: note: in expansion of macro 'file'
   61 |     file("TASK");
      |     ^~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 1 ms 340 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 900 KB Output is correct
2 Correct 35 ms 4544 KB Output is correct
3 Correct 34 ms 4436 KB Output is correct
4 Correct 33 ms 4552 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 4540 KB Output is correct
2 Correct 33 ms 4532 KB Output is correct
3 Correct 43 ms 4632 KB Output is correct
4 Correct 33 ms 4536 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 6 ms 336 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 4 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct

Subtask #6
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 360 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 344 KB Output is correct

Subtask #7
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 39 ms 4664 KB Output is correct
3 Correct 34 ms 4552 KB Output is correct
4 Correct 35 ms 4540 KB Output is correct
5 Correct 40 ms 4464 KB Output is correct
6 Correct 47 ms 5460 KB Output is correct
7 Correct 34 ms 4616 KB Output is correct
8 Correct 39 ms 4500 KB Output is correct

Subtask #8
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 278 ms 32136 KB Output is correct
3 Correct 239 ms 33844 KB Output is correct
4 Correct 155 ms 29772 KB Output is correct
5 Correct 114 ms 11420 KB Output is correct
6 Correct 60 ms 5716 KB Output is correct
7 Correct 152 ms 26424 KB Output is correct
8 Correct 155 ms 28724 KB Output is correct