Submission #1000997
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef pair<int, int> pii; typedef long long ll; typedef vector<int> vi; #define pb push_back #define eb emplace_back #define mp make_pair #define fi first #define se second #define rep(i,n) rep2(i,0,n) #define rep2(i,m,n) for(int i=m;i<(n);i++) #define ALL(c) (c).begin(),(c).end() int N; int L[5010], R[5010]; ll ret = LLONG_MAX; ll dp[2][5010]; ll dp2[5010][5010]; int main() { cin >> N; rep(i, N) cin >> L[i] >> R[i]; vector<pii> vec; rep(j, N) vec.eb(L[j]+R[j], j); sort(ALL(vec)); for (int l=(N-1)/2; l <= (N/2); ++l) { // to left rep(j, N+1) rep(k, N+1) dp2[j][k] = LLONG_MAX; dp2[N][0] = 0; for (int j = N-1; j >= 0; --j) { int id = vec[j].se; rep(k, N) { if (dp2[j+1][k] == LLONG_MAX) continue; dp2[j][k+1] = min(dp2[j][k+1], dp2[j+1][k] + (ll)k*(L[id]+R[id]) + R[id]); dp2[j][k] = min(dp2[j][k], dp2[j+1][k] + (ll)(N-1-j-k)*(L[id]+R[id]) + L[id]); } } int c = 0, f = 1; rep(j, 2) rep(k, N) dp[j][k] = LLONG_MAX; dp[0][0] = 0; rep(i, N) { //fix int id = vec[i].se; ll t = (ll)L[id] * l + (ll)R[id] * (N-1-l); ll u = LLONG_MAX; for (int p = 0; p <= l; ++p) { if (dp[c][p] == LLONG_MAX || dp2[i+1][l-p] == LLONG_MAX) continue; u = min(u, dp[c][p] + dp2[i+1][l-p]); } u += t; ret = min(ret, u); rep(j, N+1) dp[f][j] = LLONG_MAX; rep(k, N) { if (dp[c][k] == LLONG_MAX) continue; dp[f][k+1] = min(dp[f][k+1], dp[c][k] + (ll)(l-1-k)*(L[id]+R[id]) + R[id]); dp[f][k] = min(dp[f][k], dp[c][k] + (ll)((N-1-l)-1-(i-k))*(L[id]+R[id]) + L[id]); } swap(c, f); } } cout << ret << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Intervals |
User | satashun |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 1748 Byte |
Status | AC |
Exec Time | 466 ms |
Memory | 196352 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1000 / 1000 | ||||
Status |
|
|
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 | 454 ms | 196224 KB |
001.txt | AC | 92 ms | 43392 KB |
002.txt | AC | 454 ms | 196224 KB |
003.txt | AC | 253 ms | 164480 KB |
004.txt | AC | 456 ms | 196224 KB |
005.txt | AC | 130 ms | 84352 KB |
006.txt | AC | 455 ms | 196224 KB |
007.txt | AC | 235 ms | 108032 KB |
008.txt | AC | 457 ms | 196224 KB |
009.txt | AC | 48 ms | 23296 KB |
010.txt | AC | 455 ms | 196224 KB |
011.txt | AC | 203 ms | 93568 KB |
012.txt | AC | 456 ms | 196224 KB |
013.txt | AC | 40 ms | 19584 KB |
014.txt | AC | 433 ms | 196224 KB |
015.txt | AC | 68 ms | 43776 KB |
016.txt | AC | 456 ms | 196224 KB |
017.txt | AC | 353 ms | 161408 KB |
018.txt | AC | 455 ms | 196224 KB |
019.txt | AC | 158 ms | 102784 KB |
020.txt | AC | 2 ms | 256 KB |
021.txt | AC | 2 ms | 256 KB |
022.txt | AC | 455 ms | 196224 KB |
023.txt | AC | 456 ms | 196224 KB |
024.txt | AC | 455 ms | 196224 KB |
025.txt | AC | 455 ms | 196224 KB |
026.txt | AC | 456 ms | 196224 KB |
027.txt | AC | 455 ms | 196224 KB |
028.txt | AC | 466 ms | 196352 KB |
029.txt | AC | 455 ms | 196224 KB |
030.txt | AC | 455 ms | 196224 KB |
031.txt | AC | 455 ms | 196224 KB |
032.txt | AC | 455 ms | 196224 KB |
033.txt | AC | 456 ms | 196224 KB |
034.txt | AC | 456 ms | 196224 KB |
035.txt | AC | 433 ms | 196224 KB |
036.txt | AC | 433 ms | 196224 KB |
037.txt | AC | 456 ms | 196224 KB |
038.txt | AC | 455 ms | 196224 KB |
039.txt | AC | 435 ms | 196224 KB |
040.txt | AC | 455 ms | 196224 KB |
041.txt | AC | 456 ms | 196224 KB |
042.txt | AC | 456 ms | 196224 KB |
example0.txt | AC | 2 ms | 256 KB |
example1.txt | AC | 3 ms | 384 KB |