sdutoj 2624 Contest Print Server

http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=2624

Contest Print Server

Time Limit: 1000ms Memory limit: 65536K 有疑问？点这里^_^

题目描述

In ACM/ICPC on-site contests ,3 students share 1 computer,so you can print your source code any time. Here you need to write a contest print server to handle all the requests.

输入

In each case,the first line contains 5 integers n,s,x,y,mod (1<=n<=100, 1<=s,x,y,mod<=10007), and n lines of requests follow. The request is like "Team_Name request p pages" (p is integer, 0<p<=10007, the length of "Team_Name" is no longer than 20), means the team "Team_Name" need p pages to print, but for some un-know reason the printer will break down when the printed pages counter reached s(s is generated by the function s=(s*x+y)%mod ) and then the counter will become 0. In the same time the last request will be reprint from the very begin if it isn't complete yet(The data guaranteed that every request will be completed in some time).
You can get more from the sample.

输出

Every time a request is completed or the printer is break down,you should output one line like "p pages for Team_Name",p is the number of pages you give the team "Team_Name".

Please note that you should print an empty line after each case.

示例输入

2

3 7 5 6 177

Team1 request 1 pages

Team2 request 5 pages

Team3 request 1 pages

3 4 5 6 177

Team1 request 1 pages

Team2 request 5 pages

Team3 request 1 pages

示例输出

1 pages for Team1

5 pages for Team2

1 pages for Team3

1 pages for Team1

3 pages for Team2

5 pages for Team2

1 pages for Team3

提示

来源

2013年山东省第四届ACM大学生程序设计竞赛

示例程序

分析：

按照这个形式输入第A个队伍需要打印B张纸。

然后定义s=(s*x+y)%mod。

当打印的纸张数>=s时，便会重新打印这个队伍的纸张。按照要求输出。

AC代码：

 #include<stdio.h>

 #include<string>

 #include<iostream>

 using namespace std;

 struct sa

 {

     int num;

     string name;

 }data[],cnt;

 int main()

 {

     int t;

     scanf("%d",&t);

     while(t--)

     {

         int n,s,x,y,mod,i,j,flag;

         string name,tmp1,tmp2;

         scanf("%d%d%d%d%d",&n,&s,&x,&y,&mod);

         getchar();

         for(i=;i<=n;i++)

         {

             cin>>name>>tmp1>>flag>>tmp2;

             data[i].name=name;

             data[i].num=flag;

         }

         int count=,ans=;

         for(i=;i<=n;i++)

         {

             ans=count+data[i].num;

             if(ans<=s)

             {

                 count+=data[i].num;

                 cnt=data[i];

             }

             else

             {

                 cnt.name=data[i].name;

                 cnt.num=s-count;

                 count=;

                 s=(s*x+y)%mod;

                 if(s==)s=(s*x+y)%mod;

                 i--;

             }

             cout<<cnt.num<<" pages for "<<cnt.name<<endl;

         }

         cout<<endl;

     }

     return ;

 }

官方标程：

 #include<stdio.h>

 #include<string.h>

 #include<algorithm>

 #include<queue>

 using namespace std;

 #define MAX_Len 30

 struct Request {

     char s[MAX_Len];

     int p;

     Request ( ) {

     }

     Request ( char *_s, int _p ) {

         strcpy(s, _s), p =_p;

     }

     void In ( ) {

         scanf("%s%*s%d%*s", s, &p );

     }

 };

 int n, s, x, y, mod;

 queue< Request > que;

 void gettask() {

     while( !que.empty( ) ) que.pop( );

     for ( int i = ; i < n; i ++ ) {

         Request tmp;

         tmp.In( );

         que.push( tmp );

     }

 }

 void dotask() {

     int counter = ;

     while ( !que.empty( ) ) {

         Request now = que.front( );

         if ( (s - counter) < now.p ) {

             printf("%d pages for %s\n", s - counter, now.s );

             s = ( s * x + y ) % mod ;

             counter = ;

         } else {

             counter += now.p;

             printf("%d pages for %s\n", now.p, now.s );

             que.pop( );

         }

     }

     puts("");

 }

 int main() {

 //    freopen("input.in", "r", stdin);

 //    freopen("output.out", "w", stdout);

     int t;

     scanf("%d", &t );

     while ( t -- ) {

         scanf("%d%d%d%d%d", &n, &s, &x, &y, &mod);

         gettask( );

         dotask( );

     }

     return ;

 }

官方数据生成：

 #include<stdio.h>

 #include<string.h>

 #include<algorithm>

 #include<time.h>

 using namespace std;

 void ots(){

     int xs=rand()%+;

     while(xs--) {

         int ps=rand()%;

         if(ps<=)

         printf("%c",rand()%+'a');

         else if(ps<=) printf("%c",rand()%+'A');

         else if(ps<) printf("%c",rand()%+'');

         else printf("_");

     }

 }

 int main(){

     srand(time(NULL));

     freopen("input.in","w",stdout);

     srand(time(NULL));

     printf("%d\n", );

     printf("100 2 3 1 1007\n");

     for(int i=;i<;i++) printf("Team%d request %d pages\n",i+, rand()%+);

     int ca=;

     while(ca--) {

         int n=rand()%+,s=rand()%+,x=rand()%+,y=rand()%+,mod=rand()%+;

         printf("%d %d %d %d %d\n",n,s,x,y,mod);

         for(int i=;i<n;i++){

             ots();

             printf(" request %d pages\n", rand()%(mod-)+);

         }

     }

     return ;

 }

巴特西