oj.uz

Submission #717347

# Submission time Handle Problem Language Result Execution time Memory
717347 2023-04-01T21:17:20 Z vjudge1 Table Tennis (info1cup20_tabletennis) C++17
49 / 100
 3000 ms 969396 KB 
#include <bits/stdc++.h>
#define endl '\n'
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define int ll
typedef long long ll;
using namespace std;
const int N = 15e4 + 10, mod = 1e9 + 7;
int n, k, a[N];
map<int, vector<pair<int, int> > > vis;
signed main() {
    FAST;
    cin >> n >> k;
    int num = 0;
    for(int i = 0; i < n + k; i++) cin >> a[i];
    for(int i = 0; i < n + k - 1; i++) {
        for(int j = i + 1; j < n + k; j++) {
            vis[a[i] + a[j]].push_back({a[i], a[j]});
            if(vis[a[i] + a[j]].size() >= n / 2) num = a[i] + a[j];
        }
    }
    vector<int> v;
    int i = 0;
    while(v.size() < n && i < vis[num].size()) {
        v.push_back(vis[num][i].first);
        v.push_back(vis[num][i].second);
        i++;
    }
    sort(v.begin(), v.end());
    for(auto it : v) {
        cout << it << ' ';
    }
}

Compilation message

tabletennis.cpp: In function 'int main()':
tabletennis.cpp:18:40: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   18 |             if(vis[a[i] + a[j]].size() >= n / 2) num = a[i] + a[j];
      |                ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
tabletennis.cpp:23:20: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   23 |     while(v.size() < n && i < vis[num].size()) {
      |           ~~~~~~~~~^~~
tabletennis.cpp:23:29: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |     while(v.size() < n && i < vis[num].size()) {
      |                           ~~^~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 935 ms 133096 KB Output is correct
2 Correct 214 ms 42488 KB Output is correct
3 Correct 1250 ms 167632 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3096 ms 522804 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3110 ms 969396 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1236 KB Output is correct
2 Correct 6 ms 2004 KB Output is correct
3 Correct 5 ms 2004 KB Output is correct
4 Correct 5 ms 2044 KB Output is correct
5 Correct 5 ms 2004 KB Output is correct

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 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 271 ms 46616 KB Output is correct
3 Correct 1924 ms 207320 KB Output is correct
4 Correct 1399 ms 172056 KB Output is correct
5 Correct 241 ms 46812 KB Output is correct
6 Correct 246 ms 43180 KB Output is correct

Subtask #7
0 / 15.0

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

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 10468 KB Output is correct
2 Runtime error 15 ms 2800 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -