Instant Complexity - POJ1472
2016-01-27 17:50
204 查看
Instant Complexity
Generally, one determines the run-time of an algorithm in relation to the `size’ n of the input, which could be the number of objects to be sorted, the number of points in a given polygon, and so on. Since determining a formula dependent on n for the run-time of an algorithm is no easy task, it would be great if this could be automated. Unfortunately, this is not possible in general, but in this problem we will consider programs of a very simple nature, for which it is possible. Our programs are built according to the following rules (given in BNF), where < number > can be any non-negative integer:
< Program > ::= “BEGIN” < Statementlist > “END”
< Statementlist > ::= < Statement > | < Statement > < Statementlist >
< Statement > ::= < LOOP-Statement > | < OP-Statement >
< LOOP-Statement > ::= < LOOP-Header > < Statementlist > “END”
< LOOP-Header > ::= “LOOP” < number > | “LOOP n”
< OP-Statement > ::= “OP” < number >
The run-time of such a program can be computed as follows: the execution of an OP-statement costs as many time-units as its parameter specifies. The statement list enclosed by a LOOP-statement is executed as many times as the parameter of the statement indicates, i.e., the given constant number of times, if a number is given, and n times, if n is given. The run-time of a statement list is the sum of the times of its constituent parts. The total run-time therefore generally depends on n.
Input
The input starts with a line containing the number k of programs in the input. Following this are k programs which are constructed according to the grammar given above. Whitespace and newlines can appear anywhere in a program, but not within the keywords BEGIN, END, LOOP and OP or in an integer value. The nesting depth of the LOOP-operators will be at most 10.
Output
For each program in the input, first output the number of the program, as shown in the sample output. Then output the run-time of the program in terms of n; this will be a polynomial of degree Y <= 10. Print the polynomial in the usual way, i.e., collect all terms, and print it in the form “Runtime = a*n^10+b*n^9+ … +i*n^2+ j*n+k”, where terms with zero coefficients are left out, and factors of 1 are not written. If the runtime is zero, just print “Runtime = 0”.
Output a blank line after each test case.
Sample Input
Sample Output
Program #1
Runtime = 3*n^2+11*n+17
Program #2
Runtime = n^2+1997
Source
Southwestern European Regional Contest 1997
计算算法时间复杂度,注意处理LOOP = 0的时候。
Time Limit: 1000MS | Memory Limit: 10000K |
---|
Description
Analyzing the run-time complexity of algorithms is an important tool for designing efficient programs that solve a problem. An algorithm that runs in linear time is usually much faster than an algorithm that takes quadratic time for the same task, and thus should be preferred.Generally, one determines the run-time of an algorithm in relation to the `size’ n of the input, which could be the number of objects to be sorted, the number of points in a given polygon, and so on. Since determining a formula dependent on n for the run-time of an algorithm is no easy task, it would be great if this could be automated. Unfortunately, this is not possible in general, but in this problem we will consider programs of a very simple nature, for which it is possible. Our programs are built according to the following rules (given in BNF), where < number > can be any non-negative integer:
< Program > ::= “BEGIN” < Statementlist > “END”
< Statementlist > ::= < Statement > | < Statement > < Statementlist >
< Statement > ::= < LOOP-Statement > | < OP-Statement >
< LOOP-Statement > ::= < LOOP-Header > < Statementlist > “END”
< LOOP-Header > ::= “LOOP” < number > | “LOOP n”
< OP-Statement > ::= “OP” < number >
The run-time of such a program can be computed as follows: the execution of an OP-statement costs as many time-units as its parameter specifies. The statement list enclosed by a LOOP-statement is executed as many times as the parameter of the statement indicates, i.e., the given constant number of times, if a number is given, and n times, if n is given. The run-time of a statement list is the sum of the times of its constituent parts. The total run-time therefore generally depends on n.
Input
The input starts with a line containing the number k of programs in the input. Following this are k programs which are constructed according to the grammar given above. Whitespace and newlines can appear anywhere in a program, but not within the keywords BEGIN, END, LOOP and OP or in an integer value. The nesting depth of the LOOP-operators will be at most 10.
Output
For each program in the input, first output the number of the program, as shown in the sample output. Then output the run-time of the program in terms of n; this will be a polynomial of degree Y <= 10. Print the polynomial in the usual way, i.e., collect all terms, and print it in the form “Runtime = a*n^10+b*n^9+ … +i*n^2+ j*n+k”, where terms with zero coefficients are left out, and factors of 1 are not written. If the runtime is zero, just print “Runtime = 0”.
Output a blank line after each test case.
Sample Input
2 BEGIN LOOP n OP 4 LOOP 3 LOOP n OP 1 END OP 2 END OP 1 END OP 17 END BEGIN OP 1997 LOOP n LOOP n OP 1 END END END
Sample Output
Program #1
Runtime = 3*n^2+11*n+17
Program #2
Runtime = n^2+1997
Source
Southwestern European Regional Contest 1997
计算算法时间复杂度,注意处理LOOP = 0的时候。
#include <cstdio> #include <cstring> #include <cstdlib> #include <cmath> #include <string> #include <queue> #include <stack> #include <vector> #include <algorithm> using namespace std; typedef struct node { int x; int m; node *next; }Node; void Mult(Node *Head) { Node *p; p=Head; while(p) { p->m++; p=p->next; } } void Mult(Node *Head,int ans) { Node *p; p = Head; while(p) { p->x*=ans; p=p->next; } } void Output(Node *Head) { Node *p; p=Head; bool flag=false; while(p) { if(flag) { printf("+"); } if(p->m==0&&p->x) { printf("%d",p->x); flag=true; } else if(p->m==1&&p->x) { if(p->x!=1) printf("%d*n",p->x); else { printf("n"); } flag=true; } else if(p->m>1&&p->x) { if(p->x!=1) printf("%d*n^%d",p->x,p->m); else { printf("n^%d",p->m); } flag=true; } p=p->next; } if(!flag) { printf("0"); } printf("\n"); } Node * Add(Node *Head,Node *ans) { Node *p,*q,*t; p = ans; while(p) { q = Head; while(q) { if(p->m==q->m) { q->x+=p->x; break; } else { q=q->next; } } if(!q) { t=p->next; p->next = Head; Head = p; p = t ; } else { p=p->next; } } return Head; } Node * Qsort(Node *Head) { Node *p,*q,*t; p = Head; while(p) { t=p; q=p->next; while(q) { if(q->m==p->m) { p->x+=q->x; t->next = q->next; q=t->next; } else { t=t->next; q=q->next; } } p=p->next; } p =Head; while(p) { q=p->next; while(q) { if(p->m<q->m) { swap(p->m,q->m); swap(p->x,q->x); } q=q->next; } p=p->next; } return Head; } int Trans(char *s) { int ans = 0; for(int i=0;s[i]!='\0';i++) { ans = ans*10+s[i]-'0'; } return ans; } Node * dfs() { Node *Head,*ans,*p; char str[110],c[110]; Head = NULL; while(1) { scanf("%s",str); if(str[0]=='L') { scanf("%s",c); int num = -1; if(c[0]!='n') { num = Trans(c); } ans = dfs(); if(num==-1) { Mult(ans); } else if(num!=0) { Mult(ans,num); } else { ans = NULL; } Head = Add(Head,ans); } else if(str[0]=='O') { scanf("%s",c); int num = Trans(c); if(num==0) { continue; } p = new Node; p->x = num; p->m = 0 ; p->next = NULL; Head = Add(Head,p); } else if(str[0]=='E') { break; } } return Head; } int main() { char str[110]; int T; int z = 1; Node *Head; scanf("%d",&T); while(T--) { Head = NULL; while(scanf("%s",str)&&strcmp(str,"BEGIN")!=0); Head = dfs(); Qsort(Head); printf("Program #%d\n",z++); printf("Runtime = "); Output(Head); printf("\n"); } return 0; } /* 11 BEGIN LOOP n OP 4 LOOP 3 LOOP n OP 1 END OP 2 END OP 1 END OP 17 END BEGIN OP 1997 LOOP n LOOP n OP 1 END END END BEGIN LOOP 0 OP 17 END END BEGIN LOOP n OP 0 END END BEGIN OP 1 LOOP n LOOP n OP 3 LOOP n OP 2 END END END END BEGIN LOOP n OP 1 LOOP n OP 2 LOOP n OP 3 LOOP n OP 4 LOOP n OP 5 LOOP n OP 6 LOOP n OP 7 LOOP n OP 8 LOOP n OP 9 LOOP n OP 10 END END END END END LOOP 17 LOOP n LOOP n OP 3 END END END END END END END END END BEGIN LOOP 1 LOOP 2 LOOP 3 OP 1 LOOP 4 LOOP 5 LOOP 6 LOOP 7 LOOP 8 OP 1 END END END END OP 2 END END END END OP 17 END BEGIN OP 1 OP 2 OP 3 OP 4 OP 5 OP 6 OP 7 OP 8 OP 9 OP 10 OP 11 OP 12 END BEGIN LOOP n LOOP n LOOP n LOOP n LOOP n LOOP n LOOP n LOOP n LOOP n LOOP n OP 12345 END END END END END END END END END END END BEGIN OP 17 LOOP 2 LOOP n LOOP 2 OP 4 LOOP n OP 4 LOOP n OP 5 END END OP 4 END END END END BEGIN OP 0 LOOP n LOOP n OP 88 OP 0 LOOP n LOOP 0 OP 17 END END END END OP 0 LOOP n LOOP 3 OP 0 END END OP 8 END Sample Output Program #1 Runtime = 3*n^2+11*n+17 Program #2 Runtime = n^2+1997 Program #3 Runtime = 0 Program #4 Runtime = 0 Program #5 Runtime = 2*n^3+3*n^2+1 Program #6 Runtime = 10*n^10+9*n^9+8*n^8+58*n^7+6*n^6+5*n^5+4*n^4+3*n^3+2*n^2+n Program #7 Runtime = 40391 Program #8 Runtime = 78 Program #9 Runtime = 12345*n^10 Program #10 Runtime = 20*n^3+16*n^2+32*n+17 Program #11 Runtime = 88*n^2+8 */
相关文章推荐
- java -D參数简化增加多个jar【简化设置classpath】
- 学习Slim Framework for PHP v3 (五)--route怎么被调用的?
- 实习
- C# 特性
- 通知 listview刷新
- Instant Complexity - POJ1472
- C代码对比,走心和不走心的程序猴
- Android系统启动过程
- Android中关于FTP的文件上传和下载
- Codeforces Round #340 (Div. 2) 完整解题报告
- vs2010 win32程序中 sqlserver 2008 express的简单使用
- Centos 部署nginx反向代理
- Linux 进程后台运行的几种方式(screen) - Sean's Notes - SegmentFault
- 正则表达式——一步一步总结
- 关于UIView的autoresizingMask属性的研究【转】
- 旅行总结和计划
- 项目经理和产品经理的区别
- mysql 主从配置
- iOS性能优化之内存管理:Analyze、Leaks、Allocations的使用和案例代码
- 构建Python+Selenium2自动化测试环境<一>