1 solutions
-
0
C++ :
#include<stdio.h> #include<string.h> #include<algorithm> #include<math.h> using namespace std; #define INF 100001 int bb[11],a[11][1001]; int main() { int n,aa,temp; while(scanf("%d",&n)!=EOF) { if(n==0)printf("0\n"); else{ long long k=10; long long ans; memset(a,0,sizeof(a)); for(int i=1;i<n;i++) { scanf("%d",&bb[i]); for(int j=101-bb[i];j<101;j++) { scanf("%d",&a[i][j]); a[i][j]+=1; } for(int jj=0;jj<=100;jj++) { for (int ii=0;ii<100-jj;ii++) if (a[i][ii]>a[i][ii+1]) { temp=a[i][ii]; a[i][ii]=a[i][ii+1]; a[i][ii+1]=temp; } } k*=10; } long long t=1; for(int i=n-1;i>0;i--) { ans=0; for(int j=100;j>100-t*2 && j>0;j--) { ans+=a[i][j]; } if(bb[i]>=t*2) { t=t*12-ans-(bb[i]-t*2); } else { t=t*12-ans; } } if(t<0)printf("0\n"); else printf("%lld\n",t); } } return 0; }
- 1
Information
- ID
- 16937
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By