oj.uz

답안 #1024620

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1024620 2024-07-16T08:41:24 Z TraianDanciu Long Distance Coach (JOI17_coach) C++17
0 / 100
 1 ms 4444 KB 
#include <stdio.h>
#include <algorithm>

#define MAXN 200000
#define INFINIT 1000000000000000000

static inline long long min(long long a, long long b) {
  return a < b ? a : b;
}
static inline long long max(long long a, long long b) {
  return a > b ? a : b;
}

// lichao incoming
/*
struct Line {
  long long a, b;
  
  inline long long eval(long long x) {
    return a * x + b;
  }
};

struct Node {
  Node *st, *dr;
  Line val;
  
  Node(Line val) {
    st = dr = nullptr;
    this->val = val;
  }
};

void update(Node *&node, int left, int right, Line val) {
  int middle;
  
  if(node == nullptr) {
    node = new Node(val);
  } else {
    middle = (left + right) / 2;
    
    if(node->val.eval(middle) > val.eval(middle)) {
      std::swap(node->val, val);
    }
    
    if(node->val.eval(left) > val.eval(left)) {
      update(node->st, left, middle, val);
    }
    if(node->val.eval(right) > val.eval(right)) {
      update(node->dr, middle + 1, right, val);
    }
  }
}

long long query(Node *&node, int left, int right, long long pos) {
  int middle;
  long long ans;
  
  if(node == nullptr) {
    return INFINIT;
  }
  
  middle = (left + right) / 2;
  ans = node->val.eval(pos);
  
  if(pos <= middle) {
    ans = min(ans, query(node->st, left, middle, pos));
  } else {
    ans = min(ans, query(node->dr, middle + 1, right, pos));
  }
  
  return ans;
}
*/

struct Arbore {
  int val, aux, tip;
} v[2 * MAXN + 2];
static inline int compar(Arbore a, Arbore b) {
  return a.val < b.val;
}
long long sp[2 * MAXN + 2], dp[2 * MAXN];
int cnt[2 * MAXN + 2];

int main() {
  int n, m, t, w, i, j;
  long long x;
  
  scanf("%lld%d%d%d%d", &x, &n, &m, &w, &t);
  for(i = 1; i <= n; i++) {
    scanf("%d", &v[i].aux);
    v[i].val = v[i].aux % t;
    v[i].tip = 0;
  }
  
  for(i = n + 1; i <= n + m; i++) {
    scanf("%d%d", &v[i].val, &v[i].aux);
    v[i].tip = 1;
  }
  
  m++;
  v[n + m] = (struct Arbore){.val = x % t, .aux = x, .tip = 0};
  std::sort(v + 1, v + n + m + 1, compar);
  
  for(i = 1; i <= n + m; i++) {
    sp[i] = sp[i - 1] + v[i].aux * v[i].tip;
    cnt[i] = cnt[i - 1] + v[i].tip;
  }
  
  for(i = 1; i <= n + m; i++) {
    if(v[i].tip == 0) {
      dp[i] = INFINIT;
      for(j = 0; j < i; j++) {
        dp[i] = min(dp[i], dp[j] + sp[i] - sp[j] + (v[i].aux
              - v[i].val) / t * 1LL * w * (cnt[i] - cnt[j]));
      }
    } else {
      dp[i] = dp[i - 1] + 1LL * w * (x / t + (v[i].val <= x % t));
    }
  }
  
  // adaug la final si pentru sofer
  printf("%lld\n", dp[n + m] + 1LL * (x / t + 1) * w);
  return 0;
}

Compilation message

coach.cpp: In function 'int main()':
coach.cpp:102:39: warning: narrowing conversion of '(x % ((long long int)t))' from 'long long int' to 'int' [-Wnarrowing]
  102 |   v[n + m] = (struct Arbore){.val = x % t, .aux = x, .tip = 0};
      |                                     ~~^~~
coach.cpp:102:51: warning: narrowing conversion of 'x' from 'long long int' to 'int' [-Wnarrowing]
  102 |   v[n + m] = (struct Arbore){.val = x % t, .aux = x, .tip = 0};
      |                                                   ^
coach.cpp:89:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 |   scanf("%lld%d%d%d%d", &x, &n, &m, &w, &t);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
coach.cpp:91:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   91 |     scanf("%d", &v[i].aux);
      |     ~~~~~^~~~~~~~~~~~~~~~~
coach.cpp:97:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   97 |     scanf("%d%d", &v[i].val, &v[i].aux);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 4444 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 4444 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 4444 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 4444 KB Output isn't correct
2 Halted 0 ms 0 KB -