# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
717870 | 2023-04-02T17:09:41 Z | vjudge1 | Table Tennis (info1cup20_tabletennis) | C++17 | 3000 ms | 4656 KB |
#include <bits/stdc++.h> using namespace std; #define ll long long #define endl '\n' #define all(x) x.begin(),x.end() const int MOD = 1e9 + 7, SZ = 1e5 + 10, MX = 1e9; signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, k; cin >> n >> k; int arr[n + k]; for(int &i : arr) cin >> i; ll a[k + 1], b[k + 1]; for(int i=0;i<=k;i++) a[i] = arr[i]; reverse(arr, arr + n + k); for(int i=0;i<=k;i++) b[i] = arr[i]; vector<ll> vec; for(ll i : a){ for(ll j : b){ if(i == j) continue; vec.push_back(i + j); } } reverse(arr, arr + n + k); for(ll i : vec){ vector<int> ans; int l = 0, r = n + k - 1; while(l < r){ ll x = arr[l] + arr[r]; if(ans.size() == n) break; if(x == i){ ans.push_back(arr[l]); ans.push_back(arr[r]); } if(x >= i) r--; if(x <= i) l++; } if(ans.size() == n){ sort(all(ans)); for(int x : ans) cout << x << ' '; break; } } return 0; } // https://www.youtube.com/watch?v=zL32whN6p0A&ab_channel=HeidiAdel-CartoonWorld
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
3 | Correct | 1 ms | 340 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 972 KB | Output is correct |
2 | Correct | 36 ms | 4552 KB | Output is correct |
3 | Correct | 35 ms | 4572 KB | Output is correct |
4 | Correct | 33 ms | 4456 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 35 ms | 4552 KB | Output is correct |
2 | Correct | 34 ms | 4588 KB | Output is correct |
3 | Correct | 37 ms | 4552 KB | Output is correct |
4 | Correct | 34 ms | 4348 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 468 KB | Output is correct |
2 | Correct | 4 ms | 468 KB | Output is correct |
3 | Correct | 1 ms | 468 KB | Output is correct |
4 | Correct | 3 ms | 448 KB | Output is correct |
5 | Correct | 1 ms | 468 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 2 ms | 340 KB | Output is correct |
3 | Correct | 1 ms | 340 KB | Output is correct |
4 | Correct | 2 ms | 340 KB | Output is correct |
5 | Correct | 1 ms | 340 KB | Output is correct |
6 | Correct | 2 ms | 340 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 242 ms | 4656 KB | Output is correct |
3 | Correct | 37 ms | 4456 KB | Output is correct |
4 | Correct | 70 ms | 4472 KB | Output is correct |
5 | Correct | 45 ms | 4456 KB | Output is correct |
6 | Correct | 67 ms | 4592 KB | Output is correct |
7 | Correct | 63 ms | 4604 KB | Output is correct |
8 | Correct | 35 ms | 4424 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 2512 KB | Output is correct |
2 | Execution timed out | 3042 ms | 4448 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |