Submission #63550

#TimeUsernameProblemLanguageResultExecution timeMemory
63550TalantHomecoming (BOI18_homecoming)C++17
0 / 100
57 ms4328 KiB
#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)4e6 + 7; long long b[N]; long long ans; long long sum; long long solve(int N, int K, int *A, int *B) { for (int i = 0; i < N; i ++) { sum = A[i]; for (int j = i; j < i + K; j ++) { sum -= B[j % N]; } if (sum > 0) ans += sum; } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...