oj.uz

답안 #314258

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
314258 2020-10-19T09:14:12 Z lauran Pinball (JOI14_pinball) C++14
100 / 100
 823 ms 49272 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;

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

int m, n;
int A[NMAX], B[NMAX], C[NMAX], D[NMAX];
ll dpst[NMAX], dpdr[NMAX];
ll poz, val;
ll st, dr, ansQuery;
ll aint[2][4 * 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;
}

void build(int lin, int nod, int l, int r) {
   if (l == r) {
      aint[lin][nod] = INF;
      return;
   }

   int mij = (l + r) / 2;
   build(lin, 2 * nod, l, mij);
   build(lin, 2 * nod + 1, mij + 1, r);

   aint[lin][nod] = INF;
}

void update(int lin, int nod, int l, int r) {
   if (l == r) {
      if (val < aint[lin][nod])
         aint[lin][nod] = val;
      return;
   }

   int mij = (l + r) / 2;
   if (poz <= mij)
      update(lin, 2 * nod, l, mij);
   else
      update(lin, 2 * nod + 1, mij + 1, r);

   aint[lin][nod] = min(aint[lin][2 * nod], aint[lin][2 * nod + 1]);
}

void query(int lin, int nod, int l, int r) {
   if (st <= l && r <= dr) {
      ansQuery = min(ansQuery, aint[lin][nod]);
      return;
   }

   int mij = (l + r) / 2;
   if (st <= mij)
      query(lin, 2 * nod, l, mij);
   if (dr > mij)
      query(lin, 2 * nod + 1, mij + 1, r);
}

int main()
{
   scanf("%d%d", &m, &n);
   for (int i = 1; i <= m; i++) {
      scanf("%d%d%d%d", &A[i], &B[i], &C[i], &D[i]);
   }

   normalizare();

   build(0, 1, 1, n);
   build(1, 1, 1, n);

   if (A[1] == 1)
      dpst[1] = D[1];
   else
      dpst[1] = INF;
   poz = C[1], val = dpst[1];
   update(0, 1, 1, n);

   if (B[1] == n)
      dpdr[1] = D[1];
   else
      dpdr[1] = INF;
   poz = C[1], val = dpdr[1];
   update(1, 1, 1, n);

   for (int i = 2; i <= m; 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 {
         st = A[i], dr = B[i];
         ansQuery = INF;
         query(0, 1, 1, n);

         dpst[i] = min(dpst[i], ansQuery + D[i]);
      }
      poz = C[i], val = dpst[i];
      update(0, 1, 1, n);

      dpdr[i] = INF;
      if (B[i] == n)
         dpdr[i] = D[i];
      else {
         st = A[i], dr = B[i];
         ansQuery = INF;
         query(1, 1, 1, n);

         dpdr[i] = min(dpdr[i], ansQuery + D[i]);
      }
      poz = C[i], val = dpdr[i];
      update(1, 1, 1, n);
   }

   ll ans = INF;
   for (int i = 1; i <= m; i++)
      ans = min(ans, dpst[i] + dpdr[i] - D[i]);
   ans < INF ? printf("%lld", ans) : printf("-1");


   return 0;
}

Compilation message

pinball.cpp: In function 'int main()':
pinball.cpp:82:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   82 |    scanf("%d%d", &m, &n);
      |    ~~~~~^~~~~~~~~~~~~~~~
pinball.cpp:84:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   84 |       scanf("%d%d%d%d", &A[i], &B[i], &C[i], &D[i]);
      |       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 512 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 3 ms 640 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 3 ms 768 KB Output is correct
20 Correct 3 ms 512 KB Output is correct
21 Correct 2 ms 640 KB Output is correct
22 Correct 3 ms 768 KB Output is correct
23 Correct 3 ms 768 KB Output is correct
24 Correct 3 ms 768 KB Output is correct

Subtask #4
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 3 ms 640 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 3 ms 768 KB Output is correct
20 Correct 3 ms 512 KB Output is correct
21 Correct 2 ms 640 KB Output is correct
22 Correct 3 ms 768 KB Output is correct
23 Correct 3 ms 768 KB Output is correct
24 Correct 3 ms 768 KB Output is correct
25 Correct 33 ms 3320 KB Output is correct
26 Correct 132 ms 8384 KB Output is correct
27 Correct 325 ms 16248 KB Output is correct
28 Correct 177 ms 3704 KB Output is correct
29 Correct 234 ms 14584 KB Output is correct
30 Correct 267 ms 6204 KB Output is correct
31 Correct 591 ms 27512 KB Output is correct
32 Correct 484 ms 18916 KB Output is correct
33 Correct 67 ms 8568 KB Output is correct
34 Correct 300 ms 24312 KB Output is correct
35 Correct 386 ms 48120 KB Output is correct
36 Correct 823 ms 48248 KB Output is correct
37 Correct 652 ms 49272 KB Output is correct
38 Correct 590 ms 49144 KB Output is correct