# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
985890 | hengliao | Hacker (BOI15_hac) | C++17 | 272 ms | 34120 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 F first
#define S second
#define pb push_back
#define vll vector<ll>
#define pll pair<ll, ll>
typedef long long ll;
const ll inf=1e17;
void solve(){
ll n;
cin>>n;
vll a(2*n);
for(ll i=0;i<n;i++){
cin>>a[i];
a[i+n]=a[i];
}
vll val(2*n, inf);
ll pre=0;
ll siz=n/2;
if(n%2==1) siz++;
for(ll i=0;i<siz;i++){
pre+=a[i];
}
val[0]=pre;
ll p1=0;
ll p2=siz;
# | 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... |