oj.uz

Submission #314248

# Submission time Handle Problem Language Result Execution time Memory
314248 2020-10-19T08:46:55 Z lauran Pinball (JOI14_pinball) C++14
0 / 100
 1 ms 384 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;

const ll INF = 1e17;
const int NMAX = 1e5 + 5;

int m, n;
ll A[NMAX], B[NMAX], C[NMAX], D[NMAX];
ll dpst[NMAX], dpdr[NMAX];

void normalizare() {
   // normalizez 1, A, B, C, n
   set <int> tot;
   tot.insert(1); tot.insert(n);
   for (int i = 1; i <= m; i++) {
      tot.insert(A[i]);
      tot.insert(B[i]);
      tot.insert(C[i]);
   }

   map <int, int> nou;
   int newN = 0;
   for (auto x: tot)
         nou[x] = ++newN;

   for (int i = 1; i <= m; i++) {
      A[i] = nou[A[i]];
      B[i] = nou[B[i]];
      C[i] = nou[C[i]];
   }
   n = newN;
}

int main()
{
   cin >> m >> n;
   for (int i = 1; i <= m; i++) {
      cin >> A[i] >> B[i] >> C[i] >> D[i];
   }

   normalizare();

   if (A[1] == 1)
      dpst[1] = D[1];
   else
      dpst[1] = INF;
   if (B[1] == n)
      dpdr[1] = D[1];
   else
      dpdr[1] = INF;

   for (int i = 2; i <= n; i++) {
      // dpst[i] = min{dpst[j] + d[i], cu C[j] intre A[i] si B[i]}
      dpst[i] = INF;
      if (A[i] == 1)
         dpst[i] = D[i];
      else for (int j = i - 1; j >= 1; j--)
         if (A[i] <= C[j] && C[j] <= B[i])
            dpst[i] = min(dpst[i], dpst[j] + D[i]);

      dpdr[i] = INF;
      if (B[i] == n)
         dpdr[i] = D[i];
      else for (int j = i - 1; j >= 1; j--)
         if (A[i] <= C[j] && C[j] <= B[i])
            dpdr[i] = min(dpdr[i], dpdr[j] + D[i]);
   }

   ll ans = INF;
   for (int i = 1; i <= n; i++)
      ans = min(ans, dpst[i] + dpdr[i] - D[i]);
   ans < INF ? cout << ans : cout << -1;


   return 0;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Incorrect 1 ms 384 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Incorrect 1 ms 384 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Incorrect 1 ms 384 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Incorrect 1 ms 384 KB Output isn't correct
7 Halted 0 ms 0 KB -