Submission #3222460


Source Code Expand

#include<bits/stdc++.h>

#define int long long

using namespace std;

#define int long long

int n,p,q,r,s,x=LLONG_MAX,y=LLONG_MAX,ap,aq,ar,as;

main(){
	cin>>n;
	int a[n];
	for(int i=0;i<n;i++){
		cin>>a[i];
	}
	for(int i=2;i<n-1;i++){//iの前に仕切り
		for(int j=1;j<i;j++){
			p=0;q=0;
			for(int k=0;k<j;k++){
				p+=a[k];
			}
			for(int k=j;k<i;k++){
				q+=a[k];
			}
			//cout<<"p "<<p<<" q "<<q<<endl;
			if(x>abs(p-q)){x=abs(p-q);ap=p;aq=q;}
		}
		for(int j=i+1;j<n;j++){
			r=0;s=0;
			for(int k=i;k<j;k++){
				r+=a[k];
			}
			for(int k=j;k<n;k++){
				s+=a[k];
			}
			//cout<<r<<' '<<s<<endl;
			if(y>abs(r-s)){y=abs(r-s);ar=r;as=s;}
		}
	}
	//cout<<ap<<' '<<aq<<' '<<ar<<' '<<as<<endl;
	cout<<abs(max({ap,aq,ar,as})-min({ap,aq,ar,as}))<<endl;
}

Submission Info

Submission Time
Task D - Equal Cut
User masu1208
Language C++14 (GCC 5.4.1)
Score 0
Code Size 807 Byte
Status WA
Exec Time 2103 ms
Memory 1792 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 600
Status
AC × 1
WA × 2
AC × 3
WA × 5
TLE × 35
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_30.txt, subtask_1_31.txt, subtask_1_32.txt, subtask_1_33.txt, subtask_1_34.txt, subtask_1_35.txt, subtask_1_36.txt, subtask_1_37.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt WA 1 ms 256 KB
sample_03.txt WA 1 ms 256 KB
subtask_1_01.txt AC 1 ms 256 KB
subtask_1_02.txt TLE 2103 ms 1664 KB
subtask_1_03.txt TLE 2103 ms 896 KB
subtask_1_04.txt TLE 2103 ms 1152 KB
subtask_1_05.txt WA 4 ms 256 KB
subtask_1_06.txt TLE 2103 ms 384 KB
subtask_1_07.txt TLE 2103 ms 1152 KB
subtask_1_08.txt TLE 2103 ms 768 KB
subtask_1_09.txt TLE 2103 ms 1152 KB
subtask_1_10.txt TLE 2103 ms 1408 KB
subtask_1_11.txt TLE 2103 ms 1664 KB
subtask_1_12.txt TLE 2103 ms 896 KB
subtask_1_13.txt TLE 2103 ms 1152 KB
subtask_1_14.txt TLE 2103 ms 512 KB
subtask_1_15.txt TLE 2103 ms 384 KB
subtask_1_16.txt TLE 2103 ms 1024 KB
subtask_1_17.txt TLE 2103 ms 896 KB
subtask_1_18.txt TLE 2103 ms 256 KB
subtask_1_19.txt TLE 2103 ms 1664 KB
subtask_1_20.txt TLE 2103 ms 1664 KB
subtask_1_21.txt TLE 2103 ms 1024 KB
subtask_1_22.txt TLE 2103 ms 768 KB
subtask_1_23.txt TLE 2103 ms 1536 KB
subtask_1_24.txt TLE 2103 ms 1792 KB
subtask_1_25.txt TLE 2103 ms 1792 KB
subtask_1_26.txt TLE 2103 ms 1792 KB
subtask_1_27.txt TLE 2103 ms 1792 KB
subtask_1_28.txt TLE 2103 ms 1792 KB
subtask_1_29.txt TLE 2103 ms 1792 KB
subtask_1_30.txt TLE 2103 ms 1792 KB
subtask_1_31.txt TLE 2103 ms 1792 KB
subtask_1_32.txt TLE 2103 ms 1792 KB
subtask_1_33.txt TLE 2103 ms 1792 KB
subtask_1_34.txt TLE 2103 ms 1792 KB
subtask_1_35.txt TLE 2103 ms 1792 KB
subtask_1_36.txt TLE 2103 ms 1792 KB
subtask_1_37.txt TLE 2103 ms 1792 KB