oj.uz

Submission #717428

# Submission time Handle Problem Language Result Execution time Memory
717428 2023-04-01T22:46:15 Z vjudge1 Table Tennis (info1cup20_tabletennis) C++17
43 / 100
 3000 ms 385960 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 = sqrt(mxN);
    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 1 ms 596 KB Output is correct
2 Correct 2 ms 596 KB Output is correct
3 Correct 2 ms 596 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 2116 KB Output is correct
2 Correct 107 ms 23048 KB Output is correct
3 Correct 370 ms 60592 KB Output is correct
4 Correct 383 ms 60628 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 213 ms 51980 KB Output is correct
2 Correct 724 ms 97968 KB Output is correct
3 Correct 301 ms 56444 KB Output is correct
4 Correct 143 ms 32292 KB Output is correct

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 12 ms 5844 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 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct

Subtask #6
0 / 14.0

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

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Execution timed out 3065 ms 385960 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

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