제출 #717356

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
717356		vjudge1	Table Tennis (info1cup20_tabletennis)	C++17	0 / 100	1 ms	724 KiB

tabletennis

#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];
bool vis[N];
map<int, vector<pair<int, int> > > mp;
void solve1() {
    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] << ' ';
    }
}
void solve2() {

}
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) {
        solve1();
        return 0;
    }
    if(k == 2) {
        solve2();
        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 << ' ';
    }
}

컴파일 시 표준 에러 (stderr) 메시지

tabletennis.cpp: In function 'void solve1()':
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:50: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]
   50 |             if(mp[a[i] + a[j]].size() >= n / 2) num = a[i] + a[j];
      |                ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
tabletennis.cpp:55: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]
   55 |     while(v.size() < n && i < mp[num].size()) {
      |           ~~~~~~~~~^~~
tabletennis.cpp:55: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]
   55 |     while(v.size() < n && i < mp[num].size()) {
      |                           ~~^~~~~~~~~~~~~~~~

• Subtask 1: 0 / 11
• Subtask 2: 0 / 9
• Subtask 3: 0 / 14
• Subtask 4: 0 / 15
• Subtask 5: 0 / 9
• Subtask 6: 0 / 14
• Subtask 7: 0 / 15
• Subtask 8: 0 / 13