Submission #58814947

Source Code Expand

#include<bits/stdc++.h>
#define lc(p) ((p)*2)
#define rc(p) ((p)*2+1)
#define mkpr make_pair
#define LL long long
using namespace std;
inline LL read() {
    char ch=getchar();
    LL x=0;
    bool t=0;
    while(ch<'0'||ch>'9')   t|=ch=='-',ch=getchar();
    while(ch>='0'&&ch<='9') x=x*10+(ch^48),ch=getchar();
    return t?-x:x;
}
const int N=105;
int n,a[N],b[N];
int dp[N][505][505];
const int inf=1e9+7;
int main(){
	cin>>n;
	int sum=0;
	for(int i=1;i<=n;i++){
		cin>>a[i]>>b[i];
		sum+=b[i];
	}
	if(sum%3){
		cout<<-1;
		return 0;
	}
	sum/=3;
	for(int i=0;i<=n;i++){
		for(int j=0;j<=sum;j++){
			for(int k=0;k<=sum;k++){
				dp[i][j][k]=inf;
			}
		}
	}
	dp[0][0][0]=0;
	for(int i=1;i<=n;i++){
		for(int j=0;j<=sum;j++){
			for(int k=0;k<=sum;k++){
				dp[i][j][k]=min(dp[i-1][j][k]+(a[i]!=3),dp[i][j][k]);
				if(j>=b[i])dp[i][j][k]=min(dp[i][j][k],dp[i-1][j-b[i]][k]+(a[i]!=1));
				if(k>=b[i])dp[i][j][k]=min(dp[i][j][k],dp[i-1][j][k-b[i]]+(a[i]!=2));
			}
		}
	}
	if(dp[n][sum][sum]!=inf)cout<<dp[n][sum][sum];
	else cout<<-1;
	return 0;
}

Submission Info

Submission Time
Task E - 3 Team Division
User Lotus_Land
Language C++ 20 (gcc 12.2)
Score 450
Code Size 1101 Byte
Status AC
Exec Time 92 ms
Memory 103844 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 450 / 450
Status
AC × 4
AC × 52
Set Name Test Cases
Sample sample00.txt, sample01.txt, sample02.txt, sample03.txt
All sample00.txt, sample01.txt, sample02.txt, sample03.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt, testcase14.txt, testcase15.txt, testcase16.txt, testcase17.txt, testcase18.txt, testcase19.txt, testcase20.txt, testcase21.txt, testcase22.txt, testcase23.txt, testcase24.txt, testcase25.txt, testcase26.txt, testcase27.txt, testcase28.txt, testcase29.txt, testcase30.txt, testcase31.txt, testcase32.txt, testcase33.txt, testcase34.txt, testcase35.txt, testcase36.txt, testcase37.txt, testcase38.txt, testcase39.txt, testcase40.txt, testcase41.txt, testcase42.txt, testcase43.txt, testcase44.txt, testcase45.txt, testcase46.txt, testcase47.txt
Case Name Status Exec Time Memory
sample00.txt AC 1 ms 3672 KiB
sample01.txt AC 1 ms 3560 KiB
sample02.txt AC 1 ms 3668 KiB
sample03.txt AC 1 ms 4076 KiB
testcase00.txt AC 72 ms 81856 KiB
testcase01.txt AC 92 ms 103724 KiB
testcase02.txt AC 66 ms 84672 KiB
testcase03.txt AC 37 ms 58448 KiB
testcase04.txt AC 60 ms 68996 KiB
testcase05.txt AC 91 ms 103788 KiB
testcase06.txt AC 29 ms 44000 KiB
testcase07.txt AC 53 ms 72776 KiB
testcase08.txt AC 63 ms 71036 KiB
testcase09.txt AC 92 ms 103728 KiB
testcase10.txt AC 58 ms 71436 KiB
testcase11.txt AC 76 ms 91916 KiB
testcase12.txt AC 88 ms 99948 KiB
testcase13.txt AC 91 ms 103784 KiB
testcase14.txt AC 23 ms 35904 KiB
testcase15.txt AC 48 ms 68948 KiB
testcase16.txt AC 49 ms 56140 KiB
testcase17.txt AC 92 ms 103728 KiB
testcase18.txt AC 87 ms 100336 KiB
testcase19.txt AC 61 ms 79724 KiB
testcase20.txt AC 84 ms 94788 KiB
testcase21.txt AC 92 ms 103716 KiB
testcase22.txt AC 34 ms 50008 KiB
testcase23.txt AC 59 ms 78544 KiB
testcase24.txt AC 82 ms 93992 KiB
testcase25.txt AC 92 ms 103656 KiB
testcase26.txt AC 67 ms 78336 KiB
testcase27.txt AC 91 ms 102764 KiB
testcase28.txt AC 88 ms 98724 KiB
testcase29.txt AC 92 ms 103844 KiB
testcase30.txt AC 42 ms 62372 KiB
testcase31.txt AC 54 ms 74100 KiB
testcase32.txt AC 4 ms 10424 KiB
testcase33.txt AC 14 ms 29984 KiB
testcase34.txt AC 37 ms 58872 KiB
testcase35.txt AC 59 ms 78568 KiB
testcase36.txt AC 15 ms 27792 KiB
testcase37.txt AC 1 ms 3516 KiB
testcase38.txt AC 9 ms 18920 KiB
testcase39.txt AC 1 ms 3512 KiB
testcase40.txt AC 1 ms 3696 KiB
testcase41.txt AC 37 ms 57636 KiB
testcase42.txt AC 1 ms 3564 KiB
testcase43.txt AC 1 ms 3572 KiB
testcase44.txt AC 16 ms 29336 KiB
testcase45.txt AC 35 ms 55580 KiB
testcase46.txt AC 1 ms 3512 KiB
testcase47.txt AC 1 ms 3556 KiB