# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
228883 | blacktulip | Mean (info1cup19_mean) | C++17 | 5 ms | 384 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;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define int long long
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 100000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;
int n,m,b[li],a[li],k,flag,t;
int cev;
string s;
vector<int> v;
main(void){
scanf("%lld",&n);
FOR{
scanf("%lld",&a[i]);
v.pb(a[i]);
}
while(v.size()>1){
int ind=0,mn=inf;
for(int i=1;i<(int)v.size();i++){
//~ cout<<v[i]+v[i-1]<<" : ; "<<mn<<endl;
if(v[i]+v[i-1]<mn){ind=i;mn=v[i]+v[i-1];}
}
int at=v[ind]+v[ind-1];
v[ind-1]=at/2;
//~ cout<<ind<<endl;
v.erase(v.begin()+ind);
}
//~ printf("%lld\n",(int)v.size());
printf("%lld\n",v[0]);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |