# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
521257 | Baytoro | Table Tennis (info1cup20_tabletennis) | C++17 | 34 ms | 4056 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define Baytoro_MayrambekovOrz void solve()
#define ios ios::sync_with_stdio(false); cin.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fr first
#define sc second
#define int long long
int a,b,c,n,m,i,j,k,x,y,cnt=0,sum=0,res=0;
Baytoro_MayrambekovOrz{
cin>>n>>k;
vector<int> vec(n+k);
for(i=0;i<n+k;i++){
cin>>vec[i];
}
if(n==2){
cout<<vec[0]<<' '<<vec[1]<<endl;
return;
}
int l=0,r=n-1;
vector<int> sm(n+k);
sm[0]=vec[0];
for(i=1;i<n+k;i++){
sm[i]=sm[i-1]+vec[i];
}
for(i=0;i<=k;i++){
x=(n-2)/2;
sum=sm[i+n-1];
if(i>0)
sum-=sm[i-1];
sum-=vec[i];
sum-=vec[i+n-1];
if(sum/x==vec[i]+vec[i+n-1]){
for(j=i;j<i+n;j++){
cout<<vec[j]<<' ';
}
return;
}
}
}
main(){
ios;
int T=1;
//cin>>T;
while(T--){
solve();
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |