Submission #63543

#	Time	Username	Problem	Language	Result	Execution time	Memory
63543		Talant	Homecoming (BOI18_homecoming)	C++17	0 / 100	39 ms	8556 KiB

homecoming

#include "homecoming.h"
#include <bits/stdc++.h>

#define mk make_pair
#define sc second
#define fr first
#define pb emplace_back
#define all(s) s.begin(), s.end()
#define sz(s) ( (int)s.size() )
#define Scan(a) scanf ("%I64d", &a)
#define scan(a) scanf ("%d", &a)

using namespace std;

const int inf = (int)1e9 + 7;
const int N = (int)5e5 + 7;

long long b[N];
long long ans;

long long solve(int N, int K, int *A, int *B) {
      for (int i = 0; i < N; i ++)
            b[i] = b[i + N] = B[i];

      for (int i = 1; i < N * 2; i ++)
            b[i] = b[i - 1] + b[i];

      for (int i = 0; i < N; i ++) {
            ans += max(0ll,A[i] - (b[i + K - 1] - (i > 0 ? b[i - 1] : 0)));
      }
      return ans;
}

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