Submission #2091340


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N;
int L[5050],R[5050];
pair<ll,int> P[5050];

ll dp[3030][3030][2];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	FOR(i,N) {
		cin>>L[i]>>R[i];
		P[i]={R[i]+L[i],i};
	}
	if(N%2==0) N++;
	
	FOR(x,3000) FOR(y,3000) dp[x][y][0]=dp[x][y][1]=1LL<<60;
	dp[0][0][0]=0;
	
	sort(P,P+N);
	FOR(i,N) {
		j=P[i].second;
		for(l=0;l<=N/2;l++) {
			for(k=0;k<=1;k++) {
				r=i-l-k;
				if(r<0 || r>N/2) continue;
				
				if(l+1<=N/2) dp[l+1][r][k]=min(dp[l+1][r][k],dp[l][r][k]+R[j]+(N/2-(l+1))*P[i].first);
				if(r+1<=N/2) dp[l][r+1][k]=min(dp[l][r+1][k],dp[l][r][k]+L[j]+(N/2-(r+1))*P[i].first);
				if(k==0) dp[l][r][k+1]=min(dp[l][r][k+1],dp[l][r][k]+(N-1)*P[i].first);
			}
		}
	}
	
	cout<<dp[N/2][N/2][1]<<endl;
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}

Submission Info

Submission Time
Task F - Intervals
User kmjp
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1460 Byte
Status WA
Exec Time 232 ms
Memory 143872 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1000
Status
AC × 2
AC × 41
WA × 4
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 231 ms 143744 KB
001.txt AC 73 ms 143616 KB
002.txt AC 231 ms 143744 KB
003.txt WA 185 ms 143744 KB
004.txt AC 231 ms 143744 KB
005.txt WA 110 ms 143744 KB
006.txt AC 231 ms 143744 KB
007.txt AC 133 ms 143744 KB
008.txt AC 232 ms 143744 KB
009.txt AC 54 ms 143616 KB
010.txt AC 231 ms 143744 KB
011.txt AC 119 ms 143744 KB
012.txt AC 231 ms 143744 KB
013.txt AC 51 ms 143616 KB
014.txt AC 232 ms 143744 KB
015.txt WA 73 ms 143616 KB
016.txt AC 231 ms 143744 KB
017.txt AC 184 ms 143744 KB
018.txt AC 231 ms 143744 KB
019.txt WA 128 ms 143744 KB
020.txt AC 36 ms 143616 KB
021.txt AC 37 ms 143616 KB
022.txt AC 231 ms 143744 KB
023.txt AC 232 ms 143744 KB
024.txt AC 231 ms 143744 KB
025.txt AC 232 ms 143744 KB
026.txt AC 231 ms 143744 KB
027.txt AC 231 ms 143744 KB
028.txt AC 231 ms 143744 KB
029.txt AC 231 ms 143744 KB
030.txt AC 232 ms 143744 KB
031.txt AC 231 ms 143744 KB
032.txt AC 230 ms 143744 KB
033.txt AC 231 ms 143872 KB
034.txt AC 231 ms 143744 KB
035.txt AC 231 ms 143744 KB
036.txt AC 231 ms 143744 KB
037.txt AC 232 ms 143744 KB
038.txt AC 232 ms 143744 KB
039.txt AC 231 ms 143744 KB
040.txt AC 231 ms 143744 KB
041.txt AC 231 ms 143744 KB
042.txt AC 231 ms 143744 KB
example0.txt AC 37 ms 143616 KB
example1.txt AC 37 ms 143616 KB