2014 Multi-University Training Contest 1

a

Problem Description

  
  

   
      DouBiXp has a girlfriend named DouBiNan.One day they felt very boring and decided to play some games. The rule of this game is as following. There are k balls on the desk. Every ball has a value and the value of ith (i=1,2,...,k) ball is 1^i+2^i+...+(p-1)^i (mod p). Number p is a prime number that is chosen by DouBiXp and his girlfriend. And then they take balls in turn and DouBiNan first. After all the balls are token, they compare the sum of values with the other ,and the person who get larger sum will win the game. You should print “YES” if DouBiNan will win the game. Otherwise you should print “NO”.
  
  

 

Input

  
  

   
      Multiply Test Cases. 
   In the first line there are two Integers k and p(1<k,p<2^31).

  
  

 

Output

  
  

   
      For each line, output an integer, as described above.
  
  

 

Sample Input

  
  

   
   2 3
20 3
  
  

 

Sample Output

  
  

   
   YES

   
   
NO
   
   
一开始以为是数论，后来手算了样例发现有规律，打表过了（快速幂写错不能多说..）
   
   
官方题解
   
   


   
   
我们队还没有人开始搞数论..
   
   
b题千树神搞定..
   
   
d
   
   

    
    Problem Description
   
   
   
   

    
    
     
     

      
         Today the company has m tasks to complete. The ith task need xi minutes to complete. Meanwhile, this task has a difficulty level yi. The machine whose level below this task’s level yi cannot complete this task. If the company completes this task, they will get (500*xi+2*yi) dollars.
   The company has n machines. Each machine has a maximum working time and a level. If the time for the task is more than the maximum working time of the machine, the machine can not complete this task. Each machine can only complete a task one day. Each task can only be completed by one machine.
   The company hopes to maximize the number of the tasks which they can complete today. If there are multiple solutions, they hopes to make the money maximum.
     
     
   
   
   
   

    
     
   
   
   
   

   
   

    
    Input
   
   
   
   

    
    
     
     

      
         The input contains several test cases. 
   The first line contains two integers N and M. N is the number of the machines.M is the number of tasks(1 < =N <= 100000,1<=M<=100000).
   The following N lines each contains two integers xi(0<xi<1440),yi(0=<yi<=100).xi is the maximum time the machine can work.yi is the level of the machine.
   The following M lines each contains two integers xi(0<xi<1440),yi(0=<yi<=100).xi is the time we need to complete the task.yi is the level of the task.
     
     
   
   
   
   

    
     
   
   
   
   

   
   

    
    Output
   
   
   
   

    
    
     
     

      
         For each test case, output two integers, the maximum number of the tasks which the company can complete today and the money they will get.
     
     
   
   
   
   

    
     
   
   
   
   

   
   

    
    Sample Input
   
   
   
   

    
    
     
     

      
      1 2
100 3
100 2
100 1
     
     
   
   
   
   

    
     
   
   
   
   

   
   

    
    Sample Output
   
   
   
   

    
    
     
     

      
      1 50004
     
     
   
   
   
   

    
    
     
     

      
      千树和pathway商量这题时我在打1010，总的来说三人没把题意说清，也没有再看题，想这题的时候还剩半个小时，我觉得可能是贪心，基本
     
     
     
     

      
      队里就是放弃的状态了。比较可惜。
     
     
     
     


     
     
     
     


     
     
     
     


     
     
     
     


     
     
     
     


     
     
     
     


     
     
     
     


     
     
     
     

      
      第一场多校权值比较小，后面会越来越难，专题没补上的补上这种不必再说。关于比赛经验，最多就是两点
     
     
     
     

      
      1不放弃深入思考
     
     
     
     

      
      2自己一定要手算一遍样例