# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
718291 | 2023-04-03T19:46:19 Z | MrM7md | Table Tennis (info1cup20_tabletennis) | C++17 | 3000 ms | 3596 KB |
#include <bits/stdc++.h> using namespace std; // #define int long long #define endl '\n' #define F first #define S second #define pb push_back #define all(a) a.begin(),a.end() const int N=1e5; const int off=(1<<20); const int MOD = 1e9+7; signed main(){ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); int n,k; cin >> n >> k; int sz=n+k; int a[sz]; // map<int,bool>mp; for(int i=0;i<sz;i++){ cin >>a[i]; // mp[a[i]]=1; } // sort(a,a+sz); for(int i=0;i<=k;i++){ for(int j=0;j<=k-i;j++){ int ans=a[i]+a[sz-j-1]; int cur=i+j; vector<int>sml,big; int l=i,r=sz-j-1; while(l<=r){ if(l==r){ break; } if(a[l]+a[r]==ans){ sml.pb(a[l]); big.pb(a[r]); l++; r--; } else if(a[l]+a[r]>ans){ r--; } else{ l++; } } if(sml.size()+big.size()==n){ for(auto it:sml){ cout<<it<<' '; } for(int i=big.size()-1;i>=0;i--)cout<<big[i]<<' '; return 0; } // cout<<v.back()<<' '; } } // cout<<v.size()<<endl; } /* */
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Correct | 2 ms | 340 KB | Output is correct |
3 | Correct | 1 ms | 340 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 724 KB | Output is correct |
2 | Correct | 31 ms | 3136 KB | Output is correct |
3 | Correct | 29 ms | 3136 KB | Output is correct |
4 | Correct | 30 ms | 3144 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 28 ms | 3184 KB | Output is correct |
2 | Correct | 31 ms | 3180 KB | Output is correct |
3 | Correct | 32 ms | 3132 KB | Output is correct |
4 | Correct | 31 ms | 3088 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 | 0 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 | 1 ms | 280 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 1 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 | 1 ms | 340 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 153 ms | 3172 KB | Output is correct |
3 | Correct | 31 ms | 3272 KB | Output is correct |
4 | Correct | 49 ms | 3168 KB | Output is correct |
5 | Correct | 30 ms | 3116 KB | Output is correct |
6 | Correct | 45 ms | 3596 KB | Output is correct |
7 | Correct | 42 ms | 3144 KB | Output is correct |
8 | Correct | 28 ms | 3136 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Execution timed out | 3049 ms | 852 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |