oj.uz

Submission #63543

# Submission time Handle Problem Language Result Execution time Memory
63543 2018-08-02T06:06:13 Z Talant Homecoming (BOI18_homecoming) C++17
0 / 100
 39 ms 8556 KB 
#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.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Runtime error 39 ms 8556 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -