oj.uz

Submission #387721

# Submission time Handle Problem Language Result Execution time Memory
387721 2021-04-09T06:15:41 Z 2qbingxuan Table Tennis (info1cup20_tabletennis) C++14
100 / 100
 817 ms 61872 KB 
#include <bits/stdc++.h>
#ifdef local
#define debug(a...) qqbx(#a, a)
template <typename ...T> void qqbx(const char *s, T ...a) {
    int cnt = sizeof...(T);
    ((std::cerr << "\033[1;32m(" << s << ") = (") , ... , (std::cerr << a << (--cnt ? ", " : ")\033[0m\n")));
}
#define pary(a...) danb(#a, a)
template <typename T> void danb(const char *s, T L, T R) {
    std::cerr << "\033[1;32m[ " << s << " ] = [ ";
    for (int f = 0; L != R; ++L) std::cerr << (f++ ? " " : "") << *L;
    std::cerr << " ]\033[0m\n";
}
#else
#define debug(...) ((void)0)
#define pary(...) ((void)0)
#endif // local
#define all(v) begin(v),end(v)
#define pb emplace_back

using namespace std;
using ll = int64_t;
const int inf = 1e9, MOD = 1000000007, maxn = 1 << 18, maxLg = 18;

signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    int n, k;
    cin >> n >> k;
    int m = n+k;
    vector<int> a(m);
    for (int i = 0; i < m; i++)
        cin >> a[i];
    int lim = min(m / 2, k * 2);

    vector<int> jizz(a.begin(), a.begin() + lim);
    jizz.insert(jizz.end(), a.end() - lim, a.end());

    map<int,int> freq;
    for (int x: jizz) for (int y: jizz) if (x < y) ++freq[x+y];
    for (auto [val, cnt]: freq) if (cnt >= min(n/2, k)) {
        debug(val);
        vector<int> cur;
        for (int i = 0, j = a.size()-1; i < j; i++) {
            while (j > i && a[j] > val - a[i]) --j;
            if (j > i && a[j] + a[i] == val)
                cur.pb(a[i]), cur.pb(a[j]);
        }
        if (cur.size() == n) {
            sort(all(cur));
            for (int x: cur)
                cout << x << ' ';
            cout << '\n';
            return 0;
        }
    }
}

Compilation message

tabletennis.cpp: In function 'int main()':
tabletennis.cpp:40:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   40 |     for (auto [val, cnt]: freq) if (cnt >= min(n/2, k)) {
      |               ^
tabletennis.cpp:48:24: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   48 |         if (cur.size() == n) {
      |             ~~~~~~~~~~~^~~~

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 6 ms 764 KB Output is correct
2 Correct 45 ms 3024 KB Output is correct
3 Correct 95 ms 3028 KB Output is correct
4 Correct 43 ms 3084 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 3092 KB Output is correct
2 Correct 66 ms 3108 KB Output is correct
3 Correct 43 ms 3032 KB Output is correct
4 Correct 78 ms 3008 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 716 KB Output is correct
2 Correct 3 ms 972 KB Output is correct
3 Correct 3 ms 972 KB Output is correct
4 Correct 5 ms 972 KB Output is correct
5 Correct 4 ms 972 KB Output is correct

Subtask #5
9.0 / 9.0

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

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 3 ms 332 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 48 ms 3200 KB Output is correct
3 Correct 40 ms 3056 KB Output is correct
4 Correct 43 ms 3044 KB Output is correct
5 Correct 42 ms 3128 KB Output is correct
6 Correct 46 ms 3948 KB Output is correct
7 Correct 42 ms 3128 KB Output is correct
8 Correct 54 ms 3128 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 4548 KB Output is correct
2 Correct 817 ms 56504 KB Output is correct
3 Correct 712 ms 61872 KB Output is correct
4 Correct 483 ms 53608 KB Output is correct
5 Correct 245 ms 16168 KB Output is correct
6 Correct 129 ms 4632 KB Output is correct
7 Correct 454 ms 47932 KB Output is correct
8 Correct 366 ms 51320 KB Output is correct