# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
735070 | 2023-05-03T13:04:37 Z | NintsiChkhaidze | Table Tennis (info1cup20_tabletennis) | C++17 | 3000 ms | 5828 KB |
#include <bits/stdc++.h> #define pb push_back #define f first #define s second #define int long long using namespace std; const int N = 2e5+5,inf = 1e9; int a[N],n,k; vector <int> v; void check(int sum){ v.clear(); int r = n + k; for (int i = 1; i <= n + k; i++){ while (i < r){ if (a[i] + a[r] > sum) { r--; continue; } break; } if (i < r && a[i] + a[r] == sum){ v.pb(a[i]),v.pb(a[r]); r--; } } if (v.size() == n){ sort(v.begin(),v.end()); for (int x: v) cout<<x<<" "; cout<<endl; exit(0); } } signed main (){ ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL); cin>>n>>k; for (int i = 1; i <= n+k;i++) cin>>a[i]; for (int i = 1; i <= k+1; i++){ int c=0; for (int j = n + k; j > i; j--){ ++c; if (c > k+1) break; check(a[i] + a[j]); } } } /* 4 7 1 3 4 5 6 8 9 100 200 431 1234 */
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 | 8 ms | 984 KB | Output is correct |
2 | Correct | 30 ms | 4228 KB | Output is correct |
3 | Correct | 33 ms | 4332 KB | Output is correct |
4 | Correct | 35 ms | 4308 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 32 ms | 4276 KB | Output is correct |
2 | Correct | 31 ms | 4292 KB | Output is correct |
3 | Correct | 36 ms | 4272 KB | Output is correct |
4 | Correct | 31 ms | 4292 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 5 ms | 324 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 3 ms | 212 KB | Output is correct |
5 | Correct | 1 ms | 212 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 300 KB | Output is correct |
2 | Correct | 2 ms | 340 KB | Output is correct |
3 | Correct | 1 ms | 340 KB | Output is correct |
4 | Correct | 1 ms | 340 KB | Output is correct |
5 | Correct | 2 ms | 340 KB | Output is correct |
6 | Correct | 1 ms | 340 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 226 ms | 4212 KB | Output is correct |
3 | Correct | 36 ms | 5700 KB | Output is correct |
4 | Correct | 64 ms | 5596 KB | Output is correct |
5 | Correct | 33 ms | 5828 KB | Output is correct |
6 | Correct | 48 ms | 5680 KB | Output is correct |
7 | Correct | 61 ms | 5744 KB | Output is correct |
8 | Correct | 36 ms | 5672 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Execution timed out | 3019 ms | 1492 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |