Submission #1058309


Source Code Expand

#ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif

#include <bits/stdc++.h>

using namespace std;

mt19937 mrand(random_device{} ()); 

int rnd(int x) {
  return mrand() % x;
}

typedef long double ld;
typedef long long ll;

#ifdef DEBUG
#define eprintf(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#else
#define eprintf(...) ;
#endif

#define pb push_back
#define mp make_pair
#define sz(x) ((int) (x).size())
#define TASK "text"

const int inf = (int) 1.01e9;
const ld eps = 1e-9;
const ld pi = acos((ld) -1.0);

void precalc() {
}

const int maxn = (int) 5e3 + 10;
int n;

int ls[maxn], rs[maxn];

int read() {
  if (scanf("%d", &n) < 1) {
    return 0;
  }
  for (int i = 0; i < n; ++i) {
    scanf("%d%d", ls + i, rs + i);
  }
  return 1;
}

pair<int, int> tosort[maxn];

long long dp[2][maxn];

void solve() {
  for (int i = 0; i < n; ++i) {
    tosort[i] = mp(ls[i] + rs[i], i);
  }
  sort(tosort, tosort + n);
  reverse(tosort, tosort + n);

  dp[0][0] = 0;
  dp[1][0] = (long long) 1e18;

  for (int iter = 0; iter < n; ++iter) {
    dp[0][iter + 1] = dp[1][iter + 1] = (long long) 1e18;
    for (int type = 1; type >= 0; --type) {
      for (int tl = iter; tl >= 0; --tl) {
        auto cur = dp[type][tl];
        dp[type][tl + 1] = min(dp[type][tl + 1], cur + (long long) tl * tosort[iter].first + rs[tosort[iter].second]);
        if (!type && (n & 1)) {
          dp[1][tl] = min(dp[1][tl], cur + (long long) (n - 1) * tosort[iter].first / 2);
        }
        dp[type][tl] = cur + (long long) (iter - tl - type) * tosort[iter].first + ls[tosort[iter].second];
      }
    }
  }
  long long res = *min_element(dp[0], dp[0] + n + 1);
  if (n & 1) {
    res = min(res, dp[1][n / 2]);
  }
  printf("%lld\n", res);
}

int main() {
  precalc();
#ifdef LOCAL
  freopen(TASK ".out", "w", stdout);
  assert(freopen(TASK ".in", "r", stdin));
#endif

  while (1) {
    if (!read()) {
      break;
    }
    solve();
#ifdef DEBUG
    eprintf("Time %.2f\n", (double) clock() / CLOCKS_PER_SEC);
#endif
  }
  return 0;
}

Submission Info

Submission Time
Task F - Intervals
User XraY
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 2122 Byte
Status AC
Exec Time 75 ms
Memory 384 KB

Compile Error

./Main.cpp: In function ‘int read()’:
./Main.cpp:46:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", ls + i, rs + i);
                                  ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1000 / 1000
Status
AC × 2
AC × 45
Set Name Test Cases
Sample example0.txt, example1.txt
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, 027.txt, 028.txt, 029.txt, 030.txt, 031.txt, 032.txt, 033.txt, 034.txt, 035.txt, 036.txt, 037.txt, 038.txt, 039.txt, 040.txt, 041.txt, 042.txt, example0.txt, example1.txt
Case Name Status Exec Time Memory
000.txt AC 75 ms 384 KB
001.txt AC 16 ms 384 KB
002.txt AC 75 ms 384 KB
003.txt AC 65 ms 384 KB
004.txt AC 75 ms 384 KB
005.txt AC 33 ms 384 KB
006.txt AC 75 ms 384 KB
007.txt AC 38 ms 384 KB
008.txt AC 75 ms 384 KB
009.txt AC 9 ms 256 KB
010.txt AC 75 ms 384 KB
011.txt AC 33 ms 384 KB
012.txt AC 75 ms 384 KB
013.txt AC 8 ms 256 KB
014.txt AC 75 ms 384 KB
015.txt AC 18 ms 384 KB
016.txt AC 75 ms 384 KB
017.txt AC 56 ms 384 KB
018.txt AC 75 ms 384 KB
019.txt AC 40 ms 384 KB
020.txt AC 3 ms 256 KB
021.txt AC 3 ms 256 KB
022.txt AC 75 ms 384 KB
023.txt AC 74 ms 384 KB
024.txt AC 75 ms 384 KB
025.txt AC 74 ms 384 KB
026.txt AC 75 ms 384 KB
027.txt AC 75 ms 384 KB
028.txt AC 75 ms 384 KB
029.txt AC 75 ms 384 KB
030.txt AC 75 ms 384 KB
031.txt AC 74 ms 384 KB
032.txt AC 75 ms 384 KB
033.txt AC 75 ms 384 KB
034.txt AC 75 ms 384 KB
035.txt AC 75 ms 384 KB
036.txt AC 75 ms 384 KB
037.txt AC 74 ms 384 KB
038.txt AC 75 ms 384 KB
039.txt AC 75 ms 384 KB
040.txt AC 75 ms 384 KB
041.txt AC 75 ms 384 KB
042.txt AC 75 ms 384 KB
example0.txt AC 3 ms 256 KB
example1.txt AC 3 ms 256 KB