HDU 5463

Clarke and minecraft

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 325    Accepted Submission(s): 168

Problem Description

Clarke is a patient with multiple personality disorder. One day, Clarke turned into a game player of minecraft.
On that day, Clarke set up local network and chose create mode for sharing his achievements with others. Unfortunately, a naughty kid came his game. He placed a few creepers in Clarke's castle! When Clarke returned his castle without create mode, creepers suddenly blew(what a amazing scene!). Then Clarke's castle in ruins, the materials scattered over the ground.
Clark had no choice but to pick up these ruins, ready to rebuild. After Clarke built some chests(boxes), He had to pick up the material and stored them in the chests. Clarke clearly remembered the type and number of each item(each item was made of only one type material) . Now Clarke want to know how many times he have to transport at least.
Note: Materials which has same type can be stacked, a grid can store 64 materials of same type at most. Different types of materials can be transported together. Clarke's bag has 4*9=36 grids.

 

Input

The first line contains a number T(1≤T≤10) , the number of test cases.
For each test case:
The first line contains a number n , the number of items.
Then n lines follow, each line contains two integer a,b(1≤a,b≤500) , a denotes the type of material of this item, b denotes the number of this material.

 

Output

For each testcase, print a number, the number of times that Clarke need to transport at least.

 

Sample Input

   
   
   
   

    
    
    
    2
3
2 33
3 33
2 33
10
5 467
6 378
7 309
8 499
5 320
3 480
2 444
8 391
5 333
100 499
   
   
   
   

 

Sample Output

   
   
   
   

    
    
    
    1
2

Hint:
The first sample, we need to use 2 grids to store the materials of type 2 and 1 grid to store the materials of type 3. So we only need to transport once;
   
   
   
   

 

Source

BestCoder Round #56 (div.2)

 

Recommend

hujie   |   We have carefully selected several similar problems for you:   5467  5466  5465  5464  5462 

 

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<map>
#include<algorithm>

using namespace std;

int n,m;
int T;
int s[1000],ss[1000];
int main()
{
    while(~scanf("%d",&T))
    {
        while(T--)
        {
            scanf("%d",&n);
            int num=0;
            memset(s,0,sizeof(s));
            for(int i=0;i<n;i++)
            {
                int a,b;
                scanf("%d%d",&a,&b);
                if(s[a]==0)
                    ss[num++]=a;
                s[a]+=b;
            }
            int sum=0;
            for(int i=0;i<num;i++)
            {
                if(s[ss[i]]%64==0)
                {
                    sum+=s[ss[i]]/64;
                }
                else
                sum=sum+s[ss[i]]/64+1;
            }

            if(sum%36==0)
            {
                printf("%d\n",sum/36);
            }
            else
                printf("%d\n",sum/36+1);
        }
    }
}