結果

問題 No.738 平らな農地
ユーザー ikd
提出日時 2019-04-18 13:05:18
言語 C
(gcc 13.3.0)
結果
AC  
実行時間 250 ms / 2,000 ms
コード長 3,323 bytes
コンパイル時間 272 ms
コンパイル使用メモリ 32,640 KB
実行使用メモリ 7,296 KB
最終ジャッジ日時 2024-09-22 09:10:12
合計ジャッジ時間 12,367 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 5
other AC * 87
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <stdio.h>
#include <stdlib.h>
unsigned int rand_int(void) {
  static unsigned int x = 123456789, y = 362436069, z = 521288629, w = 88675123;
  unsigned int t;
  t = (x ^ (x << 11));
  x = y;
  y = z;
  z = w;
  return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}
typedef long long i64;
typedef struct Node {
  i64 val;
  i64 sum;
  int size;
  struct Node *left;
  struct Node *right;
} Node;
Node *create_node(i64 val) {
  Node *ret = (Node *)malloc(sizeof(Node));
  ret->val = val;
  ret->sum = val;
  ret->size = 1;
  ret->left = ret->right = NULL;
  return ret;
}
typedef struct Pair {
  Node *left, *right;
} Pair;
Pair make_pair(Node *left, Node *right) {
  Pair pair = {left, right};
  return pair;
}
int size(Node *node) { return node == NULL ? 0 : node->size; }
i64 sum(Node *node) { return node == NULL ? 0 : node->sum; }
Node *update(Node *node) {
  node->size = 1 + size(node->left) + size(node->right);
  node->sum = node->val + sum(node->left) + sum(node->right);
  return node;
}
Node *merge(Node *left, Node *right) {
  if (left == NULL) {
    return right;
  } else if (right == NULL) {
    return left;
  }
  if (rand_int() % (size(left) + size(right)) < (unsigned int)size(left)) {
    left->right = merge(left->right, right);
    return update(left);
  } else {
    right->left = merge(left, right->left);
    return update(right);
  }
}
Pair split(Node *root, int k) {
  if (root == NULL) return make_pair(root, root);
  if (k <= size(root->left)) {
    Pair nodes = split(root->left, k);
    root->left = nodes.right;
    return make_pair(nodes.left, update(root));
  } else {
    Pair nodes = split(root->right, k - size(root->left) - 1);
    root->right = nodes.left;
    return make_pair(update(root), nodes.right);
  }
}
int count_less(Node *root, i64 x) {
  if (root == NULL) return 0;
  if (root->val < x) {
    return count_less(root->right, x) + size(root->left) + 1;
  } else {
    return count_less(root->left, x);
  }
}
Node *insert(Node *root, i64 x) {
  Pair nodes = split(root, count_less(root, x));
  return merge(merge(nodes.left, create_node(x)), nodes.right);
}
Node *erase(Node *root, i64 x) {
  Pair nodes = split(root, count_less(root, x));
  if (nodes.right != NULL) {
    return merge(nodes.left, split(nodes.right, 1).right);
  } else {
    return merge(nodes.left, nodes.right);
  }
}
Node *get_kth(Node *root, int k) {
  if (root == NULL || size(root) < k) return NULL;
  int left_size = size(root->left);
  if (left_size + 1 == k) {
    return root;
  } else if (left_size >= k) {
    return get_kth(root->left, k);
  } else {
    return get_kth(root->right, k - left_size - 1);
  }
}
int main(void) {
  Node *root = NULL;
  int n, k;
  scanf("%d %d", &n, &k);
  i64 *a = (i64 *)malloc(n * sizeof(i64));
  i64 ans = 1000000000000000000;
  for (int i = 0; i < n; i++) {
    scanf("%lld", &a[i]);
    root = insert(root, a[i]);
    if (i >= k) root = erase(root, a[i - k]);
    if (i + 1 >= k) {
      Node *node = get_kth(root, (k + 1) / 2);
      Pair pair = split(root, (k + 1) / 2);
      i64 cost = 0;
      cost += node->val * size(pair.left) - sum(pair.left);
      cost += sum(pair.right) - node->val * size(pair.right);
      if (cost < ans) ans = cost;
      root = merge(pair.left, pair.right);
    }
  }
  printf("%lld\n", ans);
  return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0