제출 #1145018

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1145018		arafatenok	Table Tennis (info1cup20_tabletennis)	C++17	24 / 100	3129 ms	951756 KiB

tabletennis

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#pragma ("reroll")
#define skip continue;
#define gold ios_base::sync_with_stdio(false);cin.tie(NULL);
#define xa "\n"
#define int long long
#define all(a) a.begin(), a.end()
#define pb push_back
#define F first
#define S second
using namespace std;

const int mod = 1e9 + 7;
const int N = 1e5 + 7;
const int MAX = 1e9;
const int inf = 1e18;

int gcd(int a, int b) { if (b == 0) return a; else if(a == 0) return b; else return gcd(b, a % b); }
int lcm(int a, int b) { return a / gcd(a, b) * b; }

map < int, int > mp[3000];
map < int, int > cnt;

void solve() {
    int n, k;
    cin >> n >> k;
    int a[n + k + 1];
    for(int i = 1; i <= n + k; i++){
        cin >> a[i];
    }
    for(int i = 1; i <= n + k; i++){
        for(int j = 1; j <= n + k; j++){
            if(i == j) skip;
            mp[i][a[i] + a[j]]++;
            cnt[a[i] + a[j]]++;
        }
    }
    for(int i = 1; i <= n + k; i++){
        for(int j = 1; j <= n + k; j++){
            if(i == j) skip;
            if(cnt[a[i] + a[j]] == n){
                for(int ij = 1; ij <= n + k; ij++){
                    if(mp[ij][a[i] + a[j]] > 0){
                        cout << a[ij] << ' ';
                    }
                }
                return;
            }
        }
    }
}

signed main() {
    gold;
    //freopen("sum2.in", "r", stdin);
    //freopen("sum2.out", "w", stdout);
    int t = 1;
    int ti = 1;
    //cin >> t;
    while (t--) {
        //cout << "Case " << ti << ": ";
        solve();
        ti++;
    }
}

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