oj.uz

Submission #717362

# Submission time Handle Problem Language Result Execution time Memory
717362 2023-04-01T21:40:05 Z vjudge1 Table Tennis (info1cup20_tabletennis) C++17
58 / 100
 3000 ms 980940 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, bool> vis;
map<int, vector<pair<int, int> > > mp;
void solve() {
    int ch1 = a[0] + a[n+k-1], ch2 = a[0] + a[n+k-2], ch3 = a[1] + a[n+k-1];
    int cnt1 = 0, cnt2 = 0, cnt3 = 0;
    for(int i = 0; i < n + k; i++) {
        if(vis[ch1 - a[i]]) cnt1++;
        if(vis[ch2 - a[i]]) cnt2++;
        if(vis[ch3 - a[i]]) cnt3++;
    }
    int num = 0;
    if(cnt1 >= cnt2 && cnt1 >= cnt3) num = ch1;
    else if(cnt2 >= cnt1 && cnt2 >= cnt3) num = ch2;
    else num = ch3;
    int dont = a[n+k-1];
    for(int i = 0; i < n + k; i++) {
        if(vis[num - a[i]]) cout << a[i] << ' ';
    }
    return;
}
signed main() {
    FAST;
    cin >> n >> k;
    int num = 0;
    for(int i = 0; i < n + k; i++) {
        cin >> a[i];
        vis[a[i]] = 1;
    }
    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 'void solve()':
tabletennis.cpp:23:9: warning: unused variable 'dont' [-Wunused-variable]
   23 |     int dont = a[n+k-1];
      |         ^~~~
tabletennis.cpp: In function 'int main()':
tabletennis.cpp:44: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]
   44 |             if(mp[a[i] + a[j]].size() >= n / 2) num = a[i] + a[j];
      |                ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
tabletennis.cpp:49: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]
   49 |     while(v.size() < n && i < mp[num].size()) {
      |           ~~~~~~~~~^~~
tabletennis.cpp:49: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]
   49 |     while(v.size() < n && i < mp[num].size()) {
      |                           ~~^~~~~~~~~~~~~~~~

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 596 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1872 KB Output is correct
2 Correct 139 ms 31068 KB Output is correct
3 Correct 144 ms 31208 KB Output is correct
4 Correct 137 ms 31136 KB Output is correct

Subtask #3
0 / 14.0

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

Subtask #4
15.0 / 15.0

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

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

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 254 ms 46912 KB Output is correct
3 Correct 1980 ms 207356 KB Output is correct
4 Correct 1203 ms 172160 KB Output is correct
5 Correct 230 ms 46748 KB Output is correct
6 Correct 238 ms 43228 KB Output is correct

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Runtime error 53 ms 21824 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 10396 KB Output is correct
2 Runtime error 50 ms 21896 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -