oj.uz

Submission #63555

# Submission time Handle Problem Language Result Execution time Memory
63555 2018-08-02T06:27:48 Z Talant Homecoming (BOI18_homecoming) C++17
0 / 100
 52 ms 4232 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)4e6 + 7;

long long b[N];
long long ans;
long long sum;

long long solve(int N, int K, int *A, int *B) {
      ans = 0;
      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;
}

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 248 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 248 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

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

Subtask #4
0 / 38.0

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