제출 #718290

#제출 시각아이디문제언어결과실행 시간메모리
718290haxormanTable Tennis (info1cup20_tabletennis)C++14
34 / 100
358 ms80404 KiB
#include <bits/stdc++.h> using namespace std; #define int long long const int mxN = 2e5 + 7; int arr[mxN]; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, k; cin >> n >> k; map<int,bool> in; for (int i = 0; i < n + k; ++i) { cin >> arr[i]; in[arr[i]] = true; } map<int,int> freq; for (int i = 0; i < k + 2; ++i) { for (int j = n + k - 1; j >= n - 1; --j) { int sum = arr[i] + arr[j]; freq[sum]++; } } for (auto p : freq) { if (p.second >= k - 1) { int sum = p.first; vector<int> nums; for (int l = 0; l < n + k; ++l) { if (sum - arr[l] >= 0 && in[sum - arr[l]]) { nums.push_back(arr[l]); } } if (nums.size() >= n) { for (int l = 0; l < n; ++l) { cout << nums[l] << ' '; } cout << "\n"; exit(0); } } } assert(false); } // 1 2 1 2 3

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

tabletennis.cpp: In function 'int32_t main()':
tabletennis.cpp:41:29: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   41 |             if (nums.size() >= n) {
      |                 ~~~~~~~~~~~~^~~~
#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...