oj.uz

답안 #131382

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
131382 2019-07-17T05:49:32 Z Just_Solve_The_Problem Pinball (JOI14_pinball) C++11
0 / 100
 8 ms 8312 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int maxn = (int)1e5 + 7;
const int smalln = (int)1e3 + 7;

int n, m;
int a[maxn], b[maxn], c[maxn], d[maxn];
ll dp[smalln][smalln];
int pos[maxn];

main() {
  scanf("%d %d", &m, &n);
  iota(pos, pos + m, 0);
  for (int i = 0; i < m; i++) {
    scanf("%d %d %d %d", &a[i], &b[i], &c[i], &d[i]);
  }
  if (n >= smalln) return 0;
  for (int i = 0; i < smalln; i++) {
    for (int j = 0; j < smalln; j++) {
      dp[i][j] = 1e18;
    }
  }
  sort(pos, pos + m, [&](const int &A, const int &B) {
    return a[A] < a[B];
  });
  for (int i = 0; i < m; i++) {
    if (a[pos[i]] == 1) dp[i][i] = d[pos[i]];
  }
  if (a[pos[0]] != 1) {
    puts("-1");
    return 0;
  }
  for (int i = 0; i < m; i++) {
    for (int j = 0; j <= i; j++) {
      for (int k = i + 1; k < m; k++) {
        if (pos[i] < pos[k]) {
          if (c[pos[i]] >= a[pos[k]] && c[pos[i]] <= b[pos[k]]) {
            if (b[pos[j]] >= b[pos[k]]) {
              dp[k][j] = min(dp[k][j], dp[i][j] + d[pos[k]]);
            } else {
              dp[k][k] = min(dp[k][k], dp[i][j] + d[pos[k]]);
            }
          }
        } else {
          if (c[pos[k]] >= a[pos[i]] && c[pos[k]] <= b[pos[i]]) {
            if (b[pos[j]] < b[pos[k]]) {
              dp[i][k] = min(dp[i][k], dp[i][j] + d[pos[k]]);
            } 
          }
        }
      }
    }
  }
  ll ans = 1e18;
  for (int i = 0; i < m; i++) {
    if (b[pos[i]] == n) {
      for (int j = 0; j < m; j++) {
        ans = min(ans, dp[j][i]);
      }
    }
  }
  if (ans == (ll)1e18) ans = -1;
  printf("%lld", ans);
}

Compilation message

pinball.cpp:15:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^
pinball.cpp: In function 'int main()':
pinball.cpp:16:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &m, &n);
   ~~~~~^~~~~~~~~~~~~~~~~
pinball.cpp:19:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d %d", &a[i], &b[i], &c[i], &d[i]);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 11.0

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

Subtask #2
0 / 18.0

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

Subtask #3
0 / 22.0

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

Subtask #4
0 / 49.0

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