PKU_3699 miniSQL

最新推荐文章于 2024-08-24 08:23:22 发布

tao_tao_bu_jue

最新推荐文章于 2024-08-24 08:23:22 发布

阅读量869

点赞数 1

分类专栏： POJ ACM C++ 文章标签： input table output query list each

本文链接：https://blog.csdn.net/tao_tao_bu_jue/article/details/3018607

版权

C++ 同时被 3 个专栏收录

66 篇文章 0 订阅

订阅专栏

ACM

64 篇文章 0 订阅

订阅专栏

POJ

23 篇文章 0 订阅

订阅专栏

模拟题...比较繁琐..过的人代码普遍很长.......

注意方格中的内容"居中"
方格宽度=这一列的最大字符串长度+2
然后居中的时候，设字程是L,方格长K
那么对于字的左边来说，应该有(K-L)/2的空格
右边则要有K-L-(K-L)/2个空格.
注意方格宽度=这一列的最大字符串长度+2
这一列的最大字符串长度并不一定就是项目的名字

miniSQL

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 831		Accepted: 246

Description

Joan is taking an internship at a company these days. Every day she is assigned tons of dull statistical jobs such as counting how many products made by the company values more than $100. In order to have more time to chat with the handsome intern nearby, she asks you to program a clever software that helps her get released from the onerous work.

The software should take as input a table of records together with several queries and for each query output all the records respectively.

Input

The first part of the input is a single line consisting of three integers, m(1 ≤ m ≤ 10), n(1 ≤ n ≤ 10000), k(1 ≤ k ≤ 100) indicating the number of columns in the table, the number of records and the number of queries.

The second part of the input is the description of the table, which consists of m lines. The i-th line of this part consists two strings in the format Column_Name Type which describes the i-th column of the table.

Column_Name contains only letters(a-zA-Z), digits(0-9) and underline(_).
Type is either "STR" or "INT" indicating the type of this column.

The third part of the input shows the content of the table which contains n lines. The i-th line of this part shows the i-th record in the table which consists of m items.

if the type of the i-th column is "INT", the i-th item will be a 32-bit integer.
if the type of the i-th column is "STR" , the i-th item will be a string containing only letters(a-zA-Z), digits(0-9) and underline(_).

The last part of the input gives the k queries which are similar to SQL select statements. The query is in the format select Column_List where Condition

Column_List contains a list of column names which are separated by a single comma. All the names occured in the description of the table.
Condition is in the format Column_Name Op Value
- Column_Name is one of the column name in the description of the table.
- if the column's type is "STR", Op is "=". Otherwise it may be "=", "<" or ">".
- if the column's type is "STR", Value will be a quoted string containing only letters(a-zA-Z), digits(0-9) and underline(_). Otherwise it will be a 32-bit integer.

The size of the input will not exceed 1M bytes.

Output

For each query output a table and a blank line as Sample Output shows.

Sample Input

3 10 4
SID INT
NAME STR
PRIZE INT
1000 Potion 50
1001 Phoenix_Down 150
1002 Remedy 300
1003 Dagger 320
1004 Rod 260
1005 Flame_Staff 1100
1006 Broad_Sword 330
1007 Fork 1100
1008 Javelin 880
1009 Cats_Claws 4000
select SID,NAME,PRIZE where PRIZE>100
select SID,SID where NAME="Dagger"
select PRIZE where NAME="Rod"
select SID,NAME,PRIZE where NAME="Excalibur"

Sample Output


+-----------------------------+
| SID  |     NAME     | PRIZE |
|------|--------------|-------|
| 1001 | Phoenix_Down |  150  |
| 1002 |    Remedy    |  300  |
| 1003 |    Dagger    |  320  |
| 1004 |     Rod      |  260  |
| 1005 | Flame_Staff  | 1100  |
| 1006 | Broad_Sword  |  330  |
| 1007 |     Fork     | 1100  |
| 1008 |   Javelin    |  880  |
| 1009 |  Cats_Claws  | 4000  |
+-----------------------------+

+-------------+
| SID  | SID  |
|------|------|
| 1003 | 1003 |
+-------------+

+-------+
| PRIZE |
|-------|
|  260  |
+-------+

+--------------------+
| SID | NAME | PRIZE |
|-----|------|-------|
+--------------------+

Source

POJ Founder Monthly Contest – 2008.10.05, Dagger

 
 #include <iostream>
#include <queue>
#include <vector>
#include <string>
using namespace std;
struct vail{string name,type;}V[10],T[10];
struct record{string des[10];}R[10000];
string tmp,key,kv;
int id[10001],idlen,kid,mlen[10001],sid[10],slen;
char op;
int vaa(string aa)
{
    int tmp,tlen=aa.length(),i;
    for(i=tmp=0;i<tlen;i++)tmp=tmp*10+aa[i]-'0';return tmp;
}
int main()
{
    int vcnt,rcnt,ocnt,i,j,k,lt=0,tlen,ti,tttlen;
    char ttmp[256];
    cin>>vcnt>>rcnt>>ocnt;
    for(i=0;i<vcnt;i++)
        cin>>V[i].name>>V[i].type;
    for(i=0;i<rcnt;i++)
        {
            for(j=0;j<vcnt;j++)
                cin>>R[i].des[j];
        }
    while(ocnt--)
        {
            cin>>tmp>>tmp;
            tlen=tmp.length();
            for(j=ti=lt=0;j<tlen;j++)
                {
                    if(tmp[j]==',')
                        {
                            ttmp[ti]=0;
                            T[lt++].name=ttmp;
                            ti=0;
                        }
                    else
                        ttmp[ti++]=tmp[j];
                }
            if(ti)ttmp[ti]=0,T[lt++].name=ttmp;
            cin>>tmp>>tmp;
            tlen=tmp.length();ti=0;
            for(j=0;j<tlen;j++)
                if(tmp[j]=='='||tmp[j]=='>'||tmp[j]=='<')
                    {
                        ttmp[ti]=0;
                        key=ttmp;
                        break;
                    }
                else ttmp[ti++]=tmp[j];
            if(tmp[j+1]=='"')
                {
                    ti=0;
                    for(j+=2;j<tlen;j++)
                        if(tmp[j]=='"'){ttmp[ti]=0;kv=ttmp;break;}
                        else ttmp[ti++]=tmp[j];
                    op='=';
                }
            else
                {
                    ti=0;
                    op=tmp[j];
                    for(j++;j<tlen;j++)
                        ttmp[ti++]=tmp[j];
                    ttmp[ti]=0;
                    kv=ttmp;
                }
            idlen=0;
            for(j=0;j<vcnt;j++)if(key==V[j].name){kid=j;break;}
            for(j=0;j<rcnt;j++)
                if(op=='=')
                    {
                        if(R[j].des[kid]==kv)
                            id[idlen++]=j;
                    }
                else if(op=='>')
                    {
                        if(vaa(R[j].des[kid])>vaa(kv))
                            id[idlen++]=j;
                    }
                else if(vaa(R[j].des[kid])<vaa(kv))
                            id[idlen++]=j;
            slen=0;
            printf("+");
            for(j=0;j<lt;j++)for(k=0;k<vcnt;k++)if(V[k].name==T[j].name)sid[slen++]=k;
            for(j=0;j<slen;j++)
            {
                mlen[j]=V[sid[j]].name.length();
                for(k=0;k<idlen;k++)
                    if((tttlen=R[id[k]].des[sid[j]].length())>mlen[j])
                        mlen[j]=tttlen;
                mlen[j]+=2;
                for(k=1;k<=mlen[j];k++)printf("-");
                if(j!=slen-1)printf("-");
            }
            printf("+/n");
            putchar('|');
            for(i=0;i<slen;i++)
                {
                    j=(mlen[i]-V[sid[i]].name.length())/2;
                    for(k=1;k<=j;k++)putchar(' ');
                    cout<<V[sid[i]].name;
                    j=mlen[i]-j-V[sid[i]].name.length();
                    for(k=1;k<=j;k++)putchar(' ');
                    putchar('|');
                }
            putchar('/n');
            putchar('|');
            for(i=0;i<slen;i++)
            {
                for(j=1;j<=mlen[i];j++)
                        putchar('-');
                putchar('|');
            }
            putchar('/n');
            for(i=0;i<idlen;i++)
                {
                putchar('|');
                    for(j=0;j<slen;j++)
                        {
                            tttlen=(mlen[j]-R[id[i]].des[sid[j]].length())/2;
                            for(k=1;k<=tttlen;k++)putchar(' ');
                            cout<<R[id[i]].des[sid[j]];
                            tttlen=mlen[j]-tttlen-R[id[i]].des[sid[j]].length();
                            for(k=1;k<=tttlen;k++)putchar(' ');
                            putchar('|');
                        }
                    printf("/n");
                }
            printf("+");
            for(i=0;i<slen;i++)
            {
                for(j=1;j<=mlen[i];j++)
                        putchar('-');
                if(i!=slen-1)putchar('-');
            }
            printf("+/n/n");
        }
    return 0;
}
 