제출 #955470

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
955470		AlperenT	Homecoming (BOI18_homecoming)	C++17	100 / 100	94 ms	55724 KiB

homecoming

#include <bits/stdc++.h>
#include "homecoming.h"
 
using namespace std;

long long first_forced(int n, int k, int *a, int *b){
    long long mx, cur, cost, nxtcost;
    
    cost = accumulate(b, b + k, 0ll);
    
    mx = cur = a[0] - cost;
    
    for(int i = 1; i < n; i++){
        cost -= b[i - 1];
        nxtcost = i + k - 1 < n ? b[i + k - 1] : 0;
        
        cur = max(cur + a[i] - nxtcost, mx + a[i] - (cost + nxtcost));
        
        mx = max(mx, cur);
        cost += nxtcost;
    }
    
    return mx;
}

long long first_not_forced(int n, int k, int *a, int *b){
    long long mx, cur, cost, nxtcost;
    
    cost = accumulate(b, b + k, 0ll);
    
    mx = max(0ll, a[0] - cost);
    cur = a[0] - cost;
    
    for(int i = 1; i < n; i++){
        cost -= b[i - 1];
        nxtcost = i + k - 1 < n ? b[i + k - 1] : b[i + k - 1 - n];
        
        cur = max(cur + a[i] - nxtcost, mx + a[i] - (cost + nxtcost));
        
        mx = max(mx, cur);
        cost += nxtcost;
    }
    
    return mx;
}
 
long long solve(int n, int k, int *a, int *b){
	return max(first_forced(n, k, a, b), first_not_forced(n, k, a, b));
}

• Subtask 1: 13 / 13
• Subtask 2: 18 / 18
• Subtask 3: 31 / 31
• Subtask 4: 38 / 38