# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
756220 | 2023-06-11T10:17:35 Z | Alkarat | Table Tennis (info1cup20_tabletennis) | C++17 | 3000 ms | 3152 KB |
#include <bits/stdc++.h> using namespace std; const int N=2e5+5; int n,k,a[N]; map<int,int>ck; bool check(int l,int r) { int sum=a[l]+a[r]; vector<int>g; while(l<r) { if(a[l]+a[r]==sum) { g.push_back(a[l]); g.push_back(a[r]); l++; r--; } else if(a[l]+a[r]>sum) r--; else l++; if(g.size()==n) { sort(g.begin(),g.end()); for(int e:g) cout<<e<<" "; return 1; } } return 0; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin>>n>>k; for(int i=1; i<=n+k; i++) cin>>a[i]; for(int i=1; i<=k+1; i++) for(int j=n+k; j>=i+n-1; j--) if(check(i,j)) return 0; }
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 | 724 KB | Output is correct |
2 | Correct | 31 ms | 3120 KB | Output is correct |
3 | Correct | 29 ms | 3056 KB | Output is correct |
4 | Correct | 30 ms | 2996 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 32 ms | 3096 KB | Output is correct |
2 | Correct | 31 ms | 3148 KB | Output is correct |
3 | Correct | 31 ms | 3152 KB | Output is correct |
4 | Correct | 34 ms | 3020 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 2 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 2 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 | 0 ms | 212 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 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 | 1 ms | 340 KB | Output is correct |
5 | Correct | 1 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 | 170 ms | 3068 KB | Output is correct |
3 | Correct | 35 ms | 3016 KB | Output is correct |
4 | Correct | 57 ms | 3068 KB | Output is correct |
5 | Correct | 32 ms | 2992 KB | Output is correct |
6 | Correct | 44 ms | 3144 KB | Output is correct |
7 | Correct | 53 ms | 3096 KB | Output is correct |
8 | Correct | 31 ms | 3044 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Execution timed out | 3056 ms | 888 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |