제출 #1318589

#제출 시각아이디문제언어결과실행 시간메모리
1318589husuuuTable Tennis (info1cup20_tabletennis)C++20
0 / 100
3098 ms96920 KiB
#include <bits/stdc++.h> using namespace std; /////////////////////////////////////////////// #define int long long #define endl "\n" #define IO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); #define INF 0x3F3F3F3F3F3F3F3F #define ss second #define ff first #define pb push_back #define ins insert #define fori for(int i = 0 ; i < n ; i ++) /////////////////////////////////////////////// const int sz = 2e3 + 5 ; const int LG = 20 ; const int N = 1e3 ; const int mod = 1e9 + 7 ; const int MAXM = 1e5 ; /////////////////////////////////////////////// /////////////////////////////////////////////// void solve() { int n ; cin >> n ; int k ; cin >> k ; int m = n + k ; vector<int>a(m) ; map<int , int>pos ; map<int , int>mp ; for(int i = 0 ; i < m ; i ++) { cin >> a[i] ; pos[a[i]] = i ; mp[a[i]] ++ ; } sort(a.begin() , a.end()) ; map<int , int> rep ; for(int i = 0 ; i <= k / 2 ; i ++) { int l = i ; int r = m - (k - i) - 1 ; if(l >= r) break ; //cout << l << ' ' << r << endl ; int sum = 0 ; while(l < r) { sum = a[l] + a[r] ; l ++ ; r -- ; rep[sum] ++ ; //cout << sum << endl ; } } // 1 2 3 9 10 11 99 111 for(int i = k / 2 + 1 ; i < m ; i ++) { int l = i ; int r = m - i - 1 ; if(l >= r) break ; //cout << l << ' ' << r << endl ; int sum = 0 ; while(l < r) { sum = a[l] + a[r] ; //cout << sum << endl ; l ++ ; r -- ; rep[sum] ++ ; } } int sum = 0 ; int maks = -1 ; for(auto i : rep) { if(maks < i.ss) { maks = i.ss ; sum = i.ff ; } } //cout << "SUm " << sum << ' ' << rep[sum] << endl ; vector<bool>check(m , 0) ; vector<int>ans ; for(int i = 0 ; i < m ; i ++) { if(check[i] == 0) { check[i] = 1 ; int dif = sum - a[i] ; //cout << dif << ' ' ; if(mp[dif] == 0) { } else if(mp[dif] == 1 and dif == a[i]) { } else { ans.push_back(dif) ; ans.push_back(a[i]) ; check[pos[dif]] = 1 ; } } } sort(ans.begin() , ans.end()) ; for(int i = 0 ; i < ans.size() ; i ++) cout << ans[i] << ' ' ; } /////////////////////////////////////////////// /////////////////////////////////////////////// signed main() { IO ; int t = 1 ; // cin >> t ; while(t --) { solve() ; cout << endl ; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...