oj.uz

Submission #717429

# Submission time Handle Problem Language Result Execution time Memory
717429 2023-04-01T22:47:15 Z vjudge1 Table Tennis (info1cup20_tabletennis) C++17
43 / 100
 3000 ms 552116 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long

const int mxN = 2e5 + 7;

const long long rand_max = 1e18;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
long long x_rand(long long i) {
    return uniform_int_distribution<long long>(0, rand_max)(rng) % i;
}

int arr[mxN];

int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
    auto rand = [&](long long a, long long b) {
        return a + x_rand(rand_max) % (b - a + 1);
    };

    int n, k;
    cin >> n >> k;

    //bitset<2000000001> in;
    map<int,bool> in;
    for (int i = 0; i < n + k; ++i) {
        cin >> arr[i];
        in[arr[i]] = true;
    }

    int cnt = 750;
    while (cnt--) {
        int sum = arr[rand(0, k + 1)] + arr[rand(n - 1, n + k - 1)];

        vector<int> nums;
        for (int l = 0; l < n + k; ++l) {
            if (sum - arr[l] >= 0 && in[sum - arr[l]]) {
                nums.push_back(arr[l]);
            }
        }

        if (nums.size() >= n) {
            for (int l = 0; l < n; ++l) {
                cout << nums[l] << ' ';
            }
            cout << "\n";
            exit(0);
        }
    }
    assert(false);
}
// 1 2 1 2 3

Compilation message

tabletennis.cpp: In function 'int32_t main()':
tabletennis.cpp:44:25: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   44 |         if (nums.size() >= n) {
      |             ~~~~~~~~~~~~^~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 2132 KB Output is correct
2 Correct 93 ms 23044 KB Output is correct
3 Correct 196 ms 41780 KB Output is correct
4 Correct 66 ms 13632 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 255 ms 61560 KB Output is correct
2 Correct 204 ms 60520 KB Output is correct
3 Correct 180 ms 48396 KB Output is correct
4 Correct 569 ms 97784 KB Output is correct

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 19 ms 9172 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
9.0 / 9.0

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

Subtask #6
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 3 ms 1492 KB Output is correct
3 Runtime error 292 ms 96956 KB Execution killed with signal 6
4 Halted 0 ms 0 KB -

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 899 ms 182344 KB Output is correct
3 Execution timed out 3081 ms 552116 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 105 ms 32868 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -