Submission #717360

# Submission time Handle Problem Language Result Execution time Memory
717360 2023-04-01T21:39:01 Z vjudge1 Table Tennis (info1cup20_tabletennis) C++17
49 / 100
3000 ms 956788 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> > > mp;
void solve() {
    return;
}
signed main() {
    FAST;
    cin >> n >> k;
    int num = 0;
    for(int i = 0; i < n + k; i++) cin >> a[i];
    // if(k == 1) {
    //     solve();
    //     return 0;
    // }
    for(int i = 0; i < n + k - 1; i++) {
        for(int j = i + 1; j < n + k; j++) {
            mp[a[i] + a[j]].push_back({a[i], a[j]});
            if(mp[a[i] + a[j]].size() >= n / 2) num = a[i] + a[j];
        }
    }
    vector<int> v;
    int i = 0;
    while(v.size() < n && i < mp[num].size()) {
        v.push_back(mp[num][i].first);
        v.push_back(mp[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:25:39: 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]
   25 |             if(mp[a[i] + a[j]].size() >= n / 2) num = a[i] + a[j];
      |                ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
tabletennis.cpp:30: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]
   30 |     while(v.size() < n && i < mp[num].size()) {
      |           ~~~~~~~~~^~~
tabletennis.cpp:30: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]
   30 |     while(v.size() < n && i < mp[num].size()) {
      |                           ~~^~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 972 ms 133184 KB Output is correct
2 Correct 230 ms 42500 KB Output is correct
3 Correct 1125 ms 167520 KB Output is correct
# Verdict Execution time Memory Grader output
1 Execution timed out 3062 ms 507544 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 3083 ms 956788 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 3 ms 1236 KB Output is correct
2 Correct 6 ms 2004 KB Output is correct
3 Correct 6 ms 2108 KB Output is correct
4 Correct 6 ms 2004 KB Output is correct
5 Correct 5 ms 2004 KB Output is correct
# 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 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 256 ms 46720 KB Output is correct
3 Correct 1943 ms 207264 KB Output is correct
4 Correct 1572 ms 172076 KB Output is correct
5 Correct 249 ms 46816 KB Output is correct
6 Correct 247 ms 43172 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Execution timed out 3035 ms 1492 KB Time limit exceeded
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 43 ms 10368 KB Output is correct
2 Runtime error 15 ms 2772 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -