Submission #1802112
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int, int> PII; #define fi first #define se second #define mp make_pair #define pb push_back #define N 5010 #define INF 1000000000000000000LL int n; PII a[N]; ll f[N][2], g[N][2]; bool cmp(PII x, PII y) { return x.fi + x.se < y.fi + y.se; } int main() { cin >> n; for (int i = 0; i < n; i ++) cin >> a[i].fi >> a[i].se; sort(a, a+n, cmp); reverse(a, a+n); // g = last for (int i = 0; i < n; i ++) f[i][0] = f[i][1] = INF; f[0][0] = 0; // n odd: has middle // n even: no middle for (int i = 0; i < n; i ++) { memcpy(g, f, sizeof f); for (int j = 0; j < n; j ++) f[j][0] = f[j][1] = INF; if (n%2 == 0) { for (int j = 0; j <= n/2; j ++) { // left if (j+1 <= n/2) { f[j+1][0] = min(f[j+1][0], g[j][0] + a[i].se + (ll)(a[i].fi + a[i].se)*j); } // right if (i-j+1 <= n/2) { f[j][0] = min(f[j][0], g[j][0] + a[i].fi + (ll)(a[i].fi + a[i].se)*(i-j)); } } } else { for (int j = 0; j <= n/2; j ++) { // left if (j+1 <= n/2) { f[j+1][0] = min(f[j+1][0], g[j][0] + a[i].se + (ll)(a[i].fi + a[i].se)*j); f[j+1][1] = min(f[j+1][1], g[j][1] + a[i].se + (ll)(a[i].fi + a[i].se)*j); } // right if (i-j+1 <= n/2) { f[j][0] = min(f[j][0], g[j][0] + a[i].fi + (ll)(a[i].fi + a[i].se)*(i-j)); f[j][1] = min(f[j][1], g[j][1] + a[i].fi + (ll)(a[i].fi + a[i].se)*(i-j)); } // middle f[j][1] = min(f[j][1], g[j][0] + (ll)a[i].fi * (n/2) + (ll)a[i].se * (n/2)); } } } cout << f[n/2][n%2] << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Intervals |
User | sevenkplus |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 1664 Byte |
Status | AC |
Exec Time | 83 ms |
Memory | 384 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 | 81 ms | 384 KB |
001.txt | AC | 21 ms | 384 KB |
002.txt | AC | 81 ms | 384 KB |
003.txt | AC | 83 ms | 384 KB |
004.txt | AC | 81 ms | 384 KB |
005.txt | AC | 46 ms | 384 KB |
006.txt | AC | 81 ms | 384 KB |
007.txt | AC | 44 ms | 384 KB |
008.txt | AC | 81 ms | 384 KB |
009.txt | AC | 13 ms | 384 KB |
010.txt | AC | 80 ms | 384 KB |
011.txt | AC | 39 ms | 384 KB |
012.txt | AC | 80 ms | 384 KB |
013.txt | AC | 11 ms | 384 KB |
014.txt | AC | 80 ms | 384 KB |
015.txt | AC | 26 ms | 384 KB |
016.txt | AC | 80 ms | 384 KB |
017.txt | AC | 62 ms | 384 KB |
018.txt | AC | 80 ms | 384 KB |
019.txt | AC | 55 ms | 384 KB |
020.txt | AC | 1 ms | 384 KB |
021.txt | AC | 1 ms | 384 KB |
022.txt | AC | 81 ms | 384 KB |
023.txt | AC | 80 ms | 384 KB |
024.txt | AC | 80 ms | 384 KB |
025.txt | AC | 80 ms | 384 KB |
026.txt | AC | 81 ms | 384 KB |
027.txt | AC | 80 ms | 384 KB |
028.txt | AC | 80 ms | 384 KB |
029.txt | AC | 81 ms | 384 KB |
030.txt | AC | 81 ms | 384 KB |
031.txt | AC | 80 ms | 384 KB |
032.txt | AC | 80 ms | 384 KB |
033.txt | AC | 81 ms | 384 KB |
034.txt | AC | 80 ms | 384 KB |
035.txt | AC | 81 ms | 384 KB |
036.txt | AC | 81 ms | 384 KB |
037.txt | AC | 81 ms | 384 KB |
038.txt | AC | 80 ms | 384 KB |
039.txt | AC | 81 ms | 384 KB |
040.txt | AC | 80 ms | 384 KB |
041.txt | AC | 80 ms | 384 KB |
042.txt | AC | 80 ms | 384 KB |
example0.txt | AC | 1 ms | 384 KB |
example1.txt | AC | 1 ms | 384 KB |