# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
853027 | Benmath | Homecoming (BOI18_homecoming) | C++14 | 228 ms | 188576 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<homecoming.h>
#include<bits/stdc++.h>
using namespace std;
long long int calculate (int i, int j, long long int prefiks[]){
if(i == 0){
return prefiks[j];
}else{
return prefiks[j] - prefiks[i-1];
}
}
long long solve(int N, int K, int *A, int *B){
int n = N;
int k = K;
long long int a[n];
long long int b[n];
long long int dp[n];
long long int dp1[n];
long long int sum1 = 0;
long long int pref1[2*n+1];
long long int pref2[2*n+1];
for(int i = 0; i < n; i++){
a[i] = A[i];
b[i] = B[i];
sum1 = sum1 + a[i] - b[i];
dp[i] = 0;
dp1[i] = -1e18;
}
pref1[0] = a[0];
pref2[0] = b[0];
# | 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... |