Submission #1335853


Source Code Expand

#include <iostream>
#include <cstdio>
#include <map>
#include <set>
#include <queue>
#include <vector>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#define rep(i,a,b) for(int i = a; i <= b; i++)
#define dep(i,a,b) for(int i = a; i >= b; i--) 
#define Rep(i,a) for(int i = 0; i < a; i++)
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define ab(x) ((x) < 0 ? -(x) : (x))
using namespace std;
typedef long long LL;
typedef map<int, int>::iterator mit;
typedef set<int>::iterator sit;
typedef pair<int, int> pii;
#define x first
#define y second
const int N = 5010;
const LL inf = 1LL << 60;
int n, l[N], r[N], id[N];
LL f[N][N], g[N][N];
inline bool cmp(const int &a, const int &b) { return l[a] + r[a] < l[b] + r[b]; }
int main() {
	freopen("F.in","r",stdin);
	scanf("%d",&n);
	rep(i,1,n) scanf("%d%d", l + i, r + i), swap(l[i], r[i]);
	rep(i,1,n) id[i] = i; sort(id + 1, id + n + 1, cmp);
	f[0][0] = 0; rep(j,1,n) f[0][j] = inf;
	int cl = n >> 1, cr = n >> 1;
	rep(i,1,n) {
		int x = id[i];
		rep(j,0,i) {
			f[i][j] = inf;
			if (j - 1 >= 0) 
				f[i][j] = min(f[i][j], f[i - 1][j - 1] + l[x] + 1LL * (l[x] + r[x]) * (cl - j));
			f[i][j] = min(f[i][j], f[i - 1][j] + r[x] + 1LL * (l[x] + r[x]) * (cr - (i - j)));
		}
		rep(j,i+1,n) f[i][j] = inf;
	}

	if (!(n & 1)) printf("%lld\n",f[n][n / 2]);
	else {
		g[n+1][0] = 0; rep(j,1,n) g[n+1][j] = inf;
		dep(i,n,1) {
			int x = id[i];
			rep(j,0,n - i + 1) {
				g[i][j] = inf;
				if (j - 1 >= 0) g[i][j] = min(g[i][j], g[i + 1][j - 1] + l[x] + 1LL * (l[x] + r[x]) * (j - 1));
				else g[i][j] = min(g[i][j], g[i + 1][j] + r[x] + 1LL * (l[x] + r[x]) * ((n - i + 1) - j - 1));
			}
			rep(j,n-i+2,n) g[i][j] = inf;
		}
		LL ans = inf;
		rep(i,1,n) {
			int x = id[i], t = n >> 1;
			LL tot = 1LL * t * (l[x] + r[x]); 
			rep(j,0,t) ans = min(ans, tot + f[i - 1][j] + g[i + 1][t - j]);
		}
		cout <<ans<<endl; 
	}
	return 0;
}

Submission Info

Submission Time
Task F - Intervals
User WuHongxun
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1968 Byte
Status WA
Exec Time 2 ms
Memory 2304 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:29:27: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
  freopen("F.in","r",stdin);
                           ^
./Main.cpp:30:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:31:58: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  rep(i,1,n) scanf("%d%d", l + i, r + i), swap(l[i], r[i]);
                                                          ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1000
Status
WA × 2
AC × 2
WA × 43
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 WA 2 ms 2304 KB
001.txt WA 2 ms 2304 KB
002.txt WA 2 ms 2304 KB
003.txt WA 2 ms 2304 KB
004.txt WA 2 ms 2304 KB
005.txt WA 2 ms 2304 KB
006.txt WA 2 ms 2304 KB
007.txt WA 2 ms 2304 KB
008.txt WA 2 ms 2304 KB
009.txt WA 2 ms 2304 KB
010.txt WA 2 ms 2304 KB
011.txt WA 2 ms 2304 KB
012.txt WA 2 ms 2304 KB
013.txt WA 2 ms 2304 KB
014.txt WA 2 ms 2304 KB
015.txt WA 2 ms 2304 KB
016.txt WA 2 ms 2304 KB
017.txt WA 2 ms 2304 KB
018.txt WA 2 ms 2304 KB
019.txt WA 2 ms 2304 KB
020.txt AC 2 ms 2304 KB
021.txt AC 2 ms 2304 KB
022.txt WA 2 ms 2304 KB
023.txt WA 2 ms 2304 KB
024.txt WA 2 ms 2304 KB
025.txt WA 2 ms 2304 KB
026.txt WA 2 ms 2304 KB
027.txt WA 2 ms 2304 KB
028.txt WA 2 ms 2304 KB
029.txt WA 2 ms 2304 KB
030.txt WA 2 ms 2304 KB
031.txt WA 2 ms 2304 KB
032.txt WA 2 ms 2304 KB
033.txt WA 2 ms 2304 KB
034.txt WA 2 ms 2304 KB
035.txt WA 2 ms 2304 KB
036.txt WA 2 ms 2304 KB
037.txt WA 2 ms 2304 KB
038.txt WA 2 ms 2304 KB
039.txt WA 2 ms 2304 KB
040.txt WA 2 ms 2304 KB
041.txt WA 2 ms 2304 KB
042.txt WA 2 ms 2304 KB
example0.txt WA 2 ms 2304 KB
example1.txt WA 2 ms 2304 KB