Submission #1991627
Source Code Expand
//set many funcs template
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<stdbool.h>
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384
int max(int a,int b){if(a>b){return a;}return b;}
int min(int a,int b){if(a<b){return a;}return b;}
int zt(int a,int b){return max(a,b)-min(a,b);}
int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
int ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}
int gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;}
int lcm(int a,int b){int c=gcd(a,b);a/=c;return a*b;}
int nCr(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}
int fact(int a){int i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}
int pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
long long llmax(long long a,long long b){if(a>b){return a;}return b;}
long long llmin(long long a,long long b){if(a<b){return a;}return b;}
long long llzt(long long a,long long b){return llmax(a,b)-llmin(a,b);}
long long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
long long llceil(long long a,long long b){if(a%b==0){return a/b;}return (a/b)+1;}
long long llgcd(long long a,long long b){long long c;while(b!=0){c=a%b;a=b;b=c;}return a;}
long long lllcm(long long a,long long b){long long c=llgcd(a,b);a/=c;return a*b;}
long long llnCr(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}
long long llfact(long long a){long long i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}
long long llpow(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
double dbmax(double a,double b){if(a>b){return a;}return b;}
double dbmin(double a,double b){if(a<b){return a;}return b;}
double dbzt(double a,double b){return dbmax(a,b)-dbmin(a,b);}
int sortfncsj(const void *a,const void *b){if(*(int *)a>*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}
int sortfnckj(const void *a,const void *b){if(*(int *)a<*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}
int llsortfncsj(const void *a,const void *b){if(*(long long *)a>*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}
int llsortfnckj(const void *a,const void *b){if(*(long long *)a<*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}
int dbsortfncsj(const void *a,const void *b){if(*(double *)a>*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}
int dbsortfnckj(const void *a,const void *b){if(*(double *)a<*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}
int strsortfncsj(const void *a,const void *b){return strcmp((char *)a,(char *)b);}
int strsortfnckj(const void *a,const void *b){return strcmp((char *)b,(char *)a);}
int calc(int p1,int p2,int p3){
int m;
if(p1>p2){m=p1;p1=p2;p2=m;}
if(p2>p3){m=p2;p2=p3;p3=m;}
if(p1>p2){m=p1;p1=p2;p2=m;}
if(p1+p2>=p3){return 0;}
return p3-p2-p1;
}
int main(void){
int i,j,n,m,t,k,a[262144],r=inf,rw[262144],l,p1,p2,p3;
double d;
char s[262144];
scanf("%d",&n);
//l=strlen(s);
rw[0]=0;
for(i=1;i<=n;i++){scanf("%d",&a[i]);
rw[i]=rw[i-1]+a[i];
}
if(n==1){
printf("%d\n%d\n",rw[n],rw[n]);
return 0;
}
printf("%d\n",rw[n]);
for(i=1;i<=n;i++){
for(j=i+1;j<=n;j++){
p1=rw[i];
p2=rw[j]-rw[i];
p3=rw[n]-rw[j];
r=min(r,calc(p1,p2,p3));
}
}
printf("%d\n",r);
return 0;
}
Submission Info
Compile Error
./Main.c:14:5: warning: conflicting types for built-in function ‘round’
int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
^
./Main.c:15:5: warning: conflicting types for built-in function ‘ceil’
int ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}
^
./Main.c:20:5: warning: conflicting types for built-in function ‘pow’
int pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
^
./Main.c:24:11: warning: conflicting types for built-in function ‘llround’
long long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
^
./Main.c: In function ‘main’:
./Main.c:56:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
./Main.c:59:23: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
for(i=1;i<=n;i++){scanf("%d",&a[i]);
^
Judge Result
Set Name |
All |
Score / Max Score |
100 / 100 |
Status |
|
Set Name |
Test Cases |
All |
00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 02_rnd2_00.txt, 02_rnd2_01.txt, 02_rnd2_02.txt, 02_rnd2_03.txt, 02_rnd2_04.txt, 02_rnd2_05.txt, 02_rnd2_06.txt, 02_rnd2_07.txt, 02_rnd2_08.txt, 02_rnd2_09.txt, 02_rnd2_10.txt, 02_rnd2_11.txt, 02_rnd2_12.txt, 02_rnd2_13.txt, 02_rnd2_14.txt, 02_rnd2_15.txt, 02_rnd2_16.txt, 02_rnd2_17.txt, 02_rnd2_18.txt, 02_rnd2_19.txt, 02_rnd2_20.txt, 02_rnd2_21.txt, 02_rnd2_22.txt, 02_rnd2_23.txt, 02_rnd2_24.txt, 02_rnd2_25.txt, 02_rnd2_26.txt, 02_rnd2_27.txt, 02_rnd2_28.txt, 02_rnd2_29.txt, 03_max_00.txt, 03_max_01.txt, 03_max_02.txt, 03_max_03.txt, 03_max_04.txt, 03_max_05.txt, 03_max_06.txt, 03_max_07.txt, 03_max_08.txt, 03_max_09.txt, 04_maxret_01.txt, 04_maxret_02.txt |
Case Name |
Status |
Exec Time |
Memory |
00_sample_01.txt |
AC |
1 ms |
128 KB |
00_sample_02.txt |
AC |
0 ms |
128 KB |
00_sample_03.txt |
AC |
1 ms |
128 KB |
00_sample_04.txt |
AC |
1 ms |
128 KB |
00_sample_05.txt |
AC |
1 ms |
128 KB |
01_rnd_00.txt |
AC |
1 ms |
128 KB |
01_rnd_01.txt |
AC |
1 ms |
128 KB |
01_rnd_02.txt |
AC |
1 ms |
128 KB |
01_rnd_03.txt |
AC |
1 ms |
128 KB |
01_rnd_04.txt |
AC |
1 ms |
128 KB |
01_rnd_05.txt |
AC |
1 ms |
128 KB |
01_rnd_06.txt |
AC |
1 ms |
128 KB |
01_rnd_07.txt |
AC |
1 ms |
128 KB |
01_rnd_08.txt |
AC |
1 ms |
128 KB |
01_rnd_09.txt |
AC |
0 ms |
128 KB |
01_rnd_10.txt |
AC |
1 ms |
128 KB |
01_rnd_11.txt |
AC |
1 ms |
128 KB |
01_rnd_12.txt |
AC |
1 ms |
128 KB |
01_rnd_13.txt |
AC |
1 ms |
128 KB |
01_rnd_14.txt |
AC |
1 ms |
128 KB |
01_rnd_15.txt |
AC |
1 ms |
128 KB |
02_rnd2_00.txt |
AC |
0 ms |
128 KB |
02_rnd2_01.txt |
AC |
1 ms |
128 KB |
02_rnd2_02.txt |
AC |
1 ms |
128 KB |
02_rnd2_03.txt |
AC |
1 ms |
128 KB |
02_rnd2_04.txt |
AC |
1 ms |
128 KB |
02_rnd2_05.txt |
AC |
1 ms |
128 KB |
02_rnd2_06.txt |
AC |
1 ms |
128 KB |
02_rnd2_07.txt |
AC |
1 ms |
128 KB |
02_rnd2_08.txt |
AC |
1 ms |
128 KB |
02_rnd2_09.txt |
AC |
1 ms |
128 KB |
02_rnd2_10.txt |
AC |
1 ms |
128 KB |
02_rnd2_11.txt |
AC |
1 ms |
128 KB |
02_rnd2_12.txt |
AC |
0 ms |
128 KB |
02_rnd2_13.txt |
AC |
1 ms |
128 KB |
02_rnd2_14.txt |
AC |
1 ms |
128 KB |
02_rnd2_15.txt |
AC |
1 ms |
128 KB |
02_rnd2_16.txt |
AC |
0 ms |
128 KB |
02_rnd2_17.txt |
AC |
1 ms |
128 KB |
02_rnd2_18.txt |
AC |
1 ms |
128 KB |
02_rnd2_19.txt |
AC |
1 ms |
128 KB |
02_rnd2_20.txt |
AC |
1 ms |
128 KB |
02_rnd2_21.txt |
AC |
1 ms |
128 KB |
02_rnd2_22.txt |
AC |
1 ms |
128 KB |
02_rnd2_23.txt |
AC |
1 ms |
128 KB |
02_rnd2_24.txt |
AC |
1 ms |
128 KB |
02_rnd2_25.txt |
AC |
1 ms |
128 KB |
02_rnd2_26.txt |
AC |
1 ms |
128 KB |
02_rnd2_27.txt |
AC |
1 ms |
128 KB |
02_rnd2_28.txt |
AC |
1 ms |
128 KB |
02_rnd2_29.txt |
AC |
1 ms |
128 KB |
03_max_00.txt |
AC |
1 ms |
128 KB |
03_max_01.txt |
AC |
1 ms |
128 KB |
03_max_02.txt |
AC |
1 ms |
128 KB |
03_max_03.txt |
AC |
1 ms |
128 KB |
03_max_04.txt |
AC |
1 ms |
128 KB |
03_max_05.txt |
AC |
1 ms |
128 KB |
03_max_06.txt |
AC |
1 ms |
128 KB |
03_max_07.txt |
AC |
1 ms |
128 KB |
03_max_08.txt |
AC |
1 ms |
128 KB |
03_max_09.txt |
AC |
1 ms |
128 KB |
04_maxret_01.txt |
AC |
1 ms |
128 KB |
04_maxret_02.txt |
AC |
1 ms |
128 KB |