oj.uz

답안 #24350

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
24350 2017-06-05T16:32:29 Z jiaqiyang Long Distance Coach (JOI17_coach) C++14
46 / 100
 0 ms 1196 KB 
#include <cstdio>
#include <tuple>
#include <vector>
#include <algorithm>

typedef long long i64;

const int N = 200 + 10;

i64 t;
int n, m, w;

i64 s[N], d[N];
int c[N];

void init() {
  i64 x;
  scanf("%lld%d%d%d%lld", &x, &n, &m, &w, &t);
  for (int i = 1; i <= n; ++i) scanf("%lld", &s[i]);
  s[++n] = x;
  static std::pair<i64, int> info[N];
  for (int i = 1; i <= m; ++i) scanf("%lld%d", &info[i].first, &info[i].second);
  std::sort(info + 1, info + m + 1);
  for (int i = 1; i <= m; ++i) std::tie(d[i], c[i]) = info[i];
}

int main() {
  init();
  static std::vector<i64> pool[N];
  for (int i = 1; i <= n; ++i) {
    i64 x = s[i] / t;
    int y = std::lower_bound(d + 1, d + m + 1, s[i] % t) - d - 1;
    pool[y].push_back(x);
  }
  static i64 f[N], sum[N];
  for (int i = 1; i <= m; ++i) sum[i] = sum[i - 1] + c[i];
  f[0] = (s[n] + t - 1) / t * w;
  for (int i = 1; i <= m; ++i) {
    f[i] = f[i - 1] + (s[n] - d[i] + t - 1) / t * w;
    for (auto k : pool[i])
      for (int j = 0; j < i; ++j)
        f[i] = std::min(f[i], f[j] + k * w * (i - j) + sum[i] - sum[j]);
  }
  printf("%lld\n", f[m]);
  return 0;
}

Compilation message

coach.cpp: In function 'void init()':
coach.cpp:18:46: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%d%d%d%lld", &x, &n, &m, &w, &t);
                                              ^
coach.cpp:19:52: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   for (int i = 1; i <= n; ++i) scanf("%lld", &s[i]);
                                                    ^
coach.cpp:22:80: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   for (int i = 1; i <= m; ++i) scanf("%lld%d", &info[i].first, &info[i].second);
                                                                                ^

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1196 KB Output is correct
2 Correct 0 ms 1196 KB Output is correct
3 Correct 0 ms 1196 KB Output is correct
4 Correct 0 ms 1196 KB Output is correct
5 Correct 0 ms 1196 KB Output is correct
6 Correct 0 ms 1196 KB Output is correct
7 Correct 0 ms 1196 KB Output is correct
8 Correct 0 ms 1196 KB Output is correct
9 Correct 0 ms 1196 KB Output is correct
10 Correct 0 ms 1196 KB Output is correct
11 Correct 0 ms 1196 KB Output is correct
12 Correct 0 ms 1196 KB Output is correct
13 Correct 0 ms 1196 KB Output is correct
14 Correct 0 ms 1196 KB Output is correct
15 Correct 0 ms 1196 KB Output is correct
16 Correct 0 ms 1196 KB Output is correct
17 Correct 0 ms 1196 KB Output is correct
18 Correct 0 ms 1196 KB Output is correct
19 Correct 0 ms 1196 KB Output is correct
20 Correct 0 ms 1196 KB Output is correct
21 Correct 0 ms 1196 KB Output is correct
22 Correct 0 ms 1196 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1196 KB Output is correct
2 Correct 0 ms 1196 KB Output is correct
3 Correct 0 ms 1196 KB Output is correct
4 Correct 0 ms 1196 KB Output is correct
5 Correct 0 ms 1196 KB Output is correct
6 Correct 0 ms 1196 KB Output is correct
7 Correct 0 ms 1196 KB Output is correct
8 Correct 0 ms 1196 KB Output is correct
9 Correct 0 ms 1196 KB Output is correct
10 Correct 0 ms 1196 KB Output is correct
11 Correct 0 ms 1196 KB Output is correct
12 Correct 0 ms 1196 KB Output is correct
13 Correct 0 ms 1196 KB Output is correct
14 Correct 0 ms 1196 KB Output is correct
15 Correct 0 ms 1196 KB Output is correct
16 Correct 0 ms 1196 KB Output is correct
17 Correct 0 ms 1196 KB Output is correct
18 Correct 0 ms 1196 KB Output is correct
19 Correct 0 ms 1196 KB Output is correct
20 Correct 0 ms 1196 KB Output is correct
21 Correct 0 ms 1196 KB Output is correct
22 Correct 0 ms 1196 KB Output is correct
23 Correct 0 ms 1196 KB Output is correct
24 Correct 0 ms 1196 KB Output is correct
25 Correct 0 ms 1196 KB Output is correct
26 Correct 0 ms 1196 KB Output is correct
27 Correct 0 ms 1196 KB Output is correct
28 Correct 0 ms 1196 KB Output is correct
29 Correct 0 ms 1196 KB Output is correct
30 Correct 0 ms 1196 KB Output is correct
31 Correct 0 ms 1196 KB Output is correct
32 Correct 0 ms 1196 KB Output is correct
33 Correct 0 ms 1196 KB Output is correct
34 Correct 0 ms 1196 KB Output is correct
35 Correct 0 ms 1196 KB Output is correct
36 Correct 0 ms 1196 KB Output is correct
37 Correct 0 ms 1196 KB Output is correct

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1196 KB Output is correct
2 Correct 0 ms 1196 KB Output is correct
3 Correct 0 ms 1196 KB Output is correct
4 Correct 0 ms 1196 KB Output is correct
5 Correct 0 ms 1196 KB Output is correct
6 Correct 0 ms 1196 KB Output is correct
7 Correct 0 ms 1196 KB Output is correct
8 Correct 0 ms 1196 KB Output is correct
9 Correct 0 ms 1196 KB Output is correct
10 Correct 0 ms 1196 KB Output is correct
11 Correct 0 ms 1196 KB Output is correct
12 Correct 0 ms 1196 KB Output is correct
13 Correct 0 ms 1196 KB Output is correct
14 Correct 0 ms 1196 KB Output is correct
15 Correct 0 ms 1196 KB Output is correct
16 Correct 0 ms 1196 KB Output is correct
17 Correct 0 ms 1196 KB Output is correct
18 Correct 0 ms 1196 KB Output is correct
19 Correct 0 ms 1196 KB Output is correct
20 Correct 0 ms 1196 KB Output is correct
21 Correct 0 ms 1196 KB Output is correct
22 Correct 0 ms 1196 KB Output is correct
23 Correct 0 ms 1196 KB Output is correct
24 Correct 0 ms 1196 KB Output is correct
25 Correct 0 ms 1196 KB Output is correct
26 Correct 0 ms 1196 KB Output is correct
27 Correct 0 ms 1196 KB Output is correct
28 Correct 0 ms 1196 KB Output is correct
29 Correct 0 ms 1196 KB Output is correct
30 Correct 0 ms 1196 KB Output is correct
31 Correct 0 ms 1196 KB Output is correct
32 Correct 0 ms 1196 KB Output is correct
33 Correct 0 ms 1196 KB Output is correct
34 Correct 0 ms 1196 KB Output is correct
35 Correct 0 ms 1196 KB Output is correct
36 Correct 0 ms 1196 KB Output is correct
37 Correct 0 ms 1196 KB Output is correct
38 Runtime error 0 ms 1196 KB Execution killed because of forbidden syscall futex (202)
39 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1196 KB Output is correct
2 Correct 0 ms 1196 KB Output is correct
3 Correct 0 ms 1196 KB Output is correct
4 Correct 0 ms 1196 KB Output is correct
5 Correct 0 ms 1196 KB Output is correct
6 Correct 0 ms 1196 KB Output is correct
7 Correct 0 ms 1196 KB Output is correct
8 Correct 0 ms 1196 KB Output is correct
9 Correct 0 ms 1196 KB Output is correct
10 Correct 0 ms 1196 KB Output is correct
11 Correct 0 ms 1196 KB Output is correct
12 Correct 0 ms 1196 KB Output is correct
13 Correct 0 ms 1196 KB Output is correct
14 Correct 0 ms 1196 KB Output is correct
15 Correct 0 ms 1196 KB Output is correct
16 Correct 0 ms 1196 KB Output is correct
17 Correct 0 ms 1196 KB Output is correct
18 Correct 0 ms 1196 KB Output is correct
19 Correct 0 ms 1196 KB Output is correct
20 Correct 0 ms 1196 KB Output is correct
21 Correct 0 ms 1196 KB Output is correct
22 Correct 0 ms 1196 KB Output is correct
23 Correct 0 ms 1196 KB Output is correct
24 Correct 0 ms 1196 KB Output is correct
25 Correct 0 ms 1196 KB Output is correct
26 Correct 0 ms 1196 KB Output is correct
27 Correct 0 ms 1196 KB Output is correct
28 Correct 0 ms 1196 KB Output is correct
29 Correct 0 ms 1196 KB Output is correct
30 Correct 0 ms 1196 KB Output is correct
31 Correct 0 ms 1196 KB Output is correct
32 Correct 0 ms 1196 KB Output is correct
33 Correct 0 ms 1196 KB Output is correct
34 Correct 0 ms 1196 KB Output is correct
35 Correct 0 ms 1196 KB Output is correct
36 Correct 0 ms 1196 KB Output is correct
37 Correct 0 ms 1196 KB Output is correct
38 Runtime error 0 ms 1196 KB Execution killed because of forbidden syscall futex (202)
39 Halted 0 ms 0 KB -