F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

View Compilation Error

0_0_20611335_11121.cpp:11:5: error: 'gg' does not name a type
     gg;int n,m;char mp[105][105];int vis[105][105][16];int dir[4][2]={ {1,0},{-1,0},{0,-1},{0,1} };void init(){    gg['b']=gg['B']=0;    gg['y']=gg['Y']=1;    gg['r']=gg['R']=2;    gg['g']=gg['G']=3;}int bfs(){    queue<point>ss;    ss.push(b);    vis[b.x][b.y][b.z]=0;    while(ss.size())    {        point f=ss.front();        ss.pop();        for(int i=0;i<4;i++)        {            b.x=f.x+dir[i][0];            b.y=f.y+dir[i][1];            b.z=f.z;            if(mp[b.x][b.y]!='#'&&vis[b.x][b.y][b.z]==-1)            {                if(mp[b.x][b.y]=='X') return vis[f.x][f.y][f.z]+1;                if(mp[b.x][b.y]=='.')                {                    vis[b.x][b.y][b.z]=vis[f.x][f.y][f.z]+1;                    ss.push(b);                    continue;                }                int t=gg[mp[b.x][b.y]];                if(isupper(mp[b.x][b.y]))                {                    if(b.z>>t&1)                    {                        vis[b.x][b.y][b.z]=vis[f.x][f.y][f.z]+1;                        ss.push(b);                    }                }                else                {                    b.z=b.z|1<<t;                    vis[b.x][b.y][b.z]=vis[f.x][f.y][f.z]+1;                    ss.push(b);                }            }        }    }    return 0;}int main(){    init();    while(scanf("%d%d",&n,&m),n+m)    {        memset(mp,'#',sizeof(mp));        memset(vis,-1,sizeof(vis));        for(int i=1; i<=n; i++)            for(int j=1; j<=m; j++)            {                scanf(" %c",&mp[i][j]);                if(mp[i][j]=='*')                {                    b.x=i,b.y=j,b.z=0;                    mp[i][j]='.';                }            }        int t=bfs();        if(t) printf("Escape possible in %d steps.\n",t);        else printf("The poor student is trapped!\n");    }    return 0;}
     ^
0_0_20611335_11121.cpp: In function 'void init()':
0_0_20611335_11121.cpp:11:116: error: 'gg' was not declared in this scope
     gg;int n,m;char mp[105][105];int vis[105][105][16];int dir[4][2]={ {1,0},{-1,0},{0,-1},{0,1} };void init(){    gg['b']=gg['B']=0;    gg['y']=gg['Y']=1;    gg['r']=gg['R']=2;    gg['g']=gg['G']=3;}int bfs(){    queue<point>ss;    ss.push(b);    vis[b.x][b.y][b.z]=0;    while(ss.size())    {        point f=ss.front();        ss.pop();        for(int i=0;i<4;i++)        {            b.x=f.x+dir[i][0];            b.y=f.y+dir[i][1];            b.z=f.z;            if(mp[b.x][b.y]!='#'&&vis[b.x][b.y][b.z]==-1)            {                if(mp[b.x][b.y]=='X') return vis[f.x][f.y][f.z]+1;                if(mp[b.x][b.y]=='.')                {                    vis[b.x][b.y][b.z]=vis[f.x][f.y][f.z]+1;                    ss.push(b);                    continue;                }                int t=gg[mp[b.x][b.y]];                if(isupper(mp[b.x][b.y]))                {                    if(b.z>>t&1)                    {                        vis[b.x][b.y][b.z]=vis[f.x][f.y][f.z]+1;                        ss.push(b);                    }                }                else                {                    b.z=b.z|1<<t;                    vis[b.x][b.y][b.z]=vis[f.x][f.y][f.z]+1;                    ss.push(b);                }            }        }    }    return 0;}int main(){    init();    while(scanf("%d%d",&n,&m),n+m)    {        memset(mp,'#',sizeof(mp));        memset(vis,-1,sizeof(vis));        for(int i=1; i<=n; i++)            for(int j=1; j<=m; j++)            {                scanf(" %c",&mp[i][j]);                if(mp[i][j]=='*')                {                    b.x=i,b.y=j,b.z=0;                    mp[i][j]='.';                }            }        int t=bfs();        if(t) printf("Escape possible in %d steps.\n",t);        else printf("The poor student is trapped!\n");    }    return 0;}
                                                                                                                    ^
0_0_20611335_11121.cpp: In function 'int bfs()':
0_0_20611335_11121.cpp:11:215: error: 'queue' was not declared in this scope
     gg;int n,m;char mp[105][105];int vis[105][105][16];int dir[4][2]={ {1,0},{-1,0},{0,-1},{0,1} };void init(){    gg['b']=gg['B']=0;    gg['y']=gg['Y']=1;    gg['r']=gg['R']=2;    gg['g']=gg['G']=3;}int bfs(){    queue<point>ss;    ss.push(b);    vis[b.x][b.y][b.z]=0;    while(ss.size())    {        point f=ss.front();        ss.pop();        for(int i=0;i<4;i++)        {            b.x=f.x+dir[i][0];            b.y=f.y+dir[i][1];            b.z=f.z;            if(mp[b.x][b.y]!='#'&&vis[b.x][b.y][b.z]==-1)            {                if(mp[b.x][b.y]=='X') return vis[f.x][f.y][f.z]+1;                if(mp[b.x][b.y]=='.')                {                    vis[b.x][b.y][b.z]=vis[f.x][f.y][f.z]+1;                    ss.push(b);                    continue;                }                int t=gg[mp[b.x][b.y]];                if(isupper(mp[b.x][b.y]))                {                    if(b.z>>t&1)                    {                        vis[b.x][b.y][b.z]=vis[f.x][f.y][f.z]+1;                        ss.push(b);                    }                }                else                {                    b.z=b.z|1<<t;                    vis[b.x][b.y][b.z]=vis[f.x][f.y][f.z]+1;                    ss.push(b);                }            }        }    }    return 0;}int main(){    init();    while(scanf("%d%d",&n,&m),n+m)    {        memset(mp,'#',sizeof(mp));        memset(vis,-1,sizeof(vis));        for(int i=1; i<=n; i++)            for(int j=1; j<=m; j++)            {                scanf(" %c",&mp[i][j]);                if(mp[i][j]=='*')                {                    b.x=i,b.y=j,b.z=0;                    mp[i][j]='.';                }            }        int t=bfs();        if(t) printf("Escape possible in %d steps.\n",t);        else printf("The poor student is trapped!\n");    }    return 0;}
                                                                                                                                                                                                                       ^
0_0_20611335_11121.cpp:11:215: note: suggested alternative:
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/queue:64:0,
                 from 0_0_20611335_11121.cpp:7:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:96:11: note:   'std::queue'
     class queue
           ^
0_0_20611335_11121.cpp:11:221: error: 'point' was not declared in this scope
     gg;int n,m;char mp[105][105];int vis[105][105][16];int dir[4][2]={ {1,0},{-1,0},{0,-1},{0,1} };void init(){    gg['b']=gg['B']=0;    gg['y']=gg['Y']=1;    gg['r']=gg['R']=2;    gg['g']=gg['G']=3;}int bfs(){    queue<point>ss;    ss.push(b);    vis[b.x][b.y][b.z]=0;    while(ss.size())    {        point f=ss.front();        ss.pop();        for(int i=0;i<4;i++)        {            b.x=f.x+dir[i][0];            b.y=f.y+dir[i][1];            b.z=f.z;            if(mp[b.x][b.y]!='#'&&vis[b.x][b.y][b.z]==-1)            {                if(mp[b.x][b.y]=='X') return vis[f.x][f.y][f.z]+1;                if(mp[b.x][b.y]=='.')                {                    vis[b.x][b.y][b.z]=vis[f.x][f.y][f.z]+1;                    ss.push(b);                    continue;                }                int t=gg[mp[b.x][b.y]];                if(isupper(mp[b.x][b.y]))                {                    if(b.z>>t&1)                    {                        vis[b.x][b.y][b.z]=vis[f.x][f.y][f.z]+1;                        ss.push(b);                    }                }                else                {                    b.z=b.z|1<<t;                    vis[b.x][b.y][b.z]=vis[f.x][f.y][f.z]+1;                    ss.push(b);                }            }        }    }    return 0;}int main(){    init();    while(scanf("%d%d",&n,&m),n+m)    {        memset(mp,'#',sizeof(mp));        memset(vis,-1,sizeof(vis));        for(int i=1; i<=n; i++)            for(int j=1; j<=m; j++)            {                scanf(" %c",&mp[i][j]);                if(mp[i][j]=='*')                {                    b.x=i,b.y=j,b.z=0;                    mp[i][j]='.';                }            }        int t=bfs();        if(t) printf("Escape possible in %d steps.\n",t);        else printf("The poor student is trapped!\n");    }    return 0;}
                                                                                                                                                                                                                             ^
0_0_20611335_11121.cpp:11:227: error: 'ss' was not declared in this scope
     gg;int n,m;char mp[105][105];int vis[105][105][16];int dir[4][2]={ {1,0},{-1,0},{0,-1},{0,1} };void init(){    gg['b']=gg['B']=0;    gg['y']=gg['Y']=1;    gg['r']=gg['R']=2;    gg['g']=gg['G']=3;}int bfs(){    queue<point>ss;    ss.push(b);    vis[b.x][b.y][b.z]=0;    while(ss.size())    {        point f=ss.front();        ss.pop();        for(int i=0;i<4;i++)        {            b.x=f.x+dir[i][0];            b.y=f.y+dir[i][1];            b.z=f.z;            if(mp[b.x][b.y]!='#'&&vis[b.x][b.y][b.z]==-1)            {                if(mp[b.x][b.y]=='X') return vis[f.x][f.y][f.z]+1;                if(mp[b.x][b.y]=='.')                {                    vis[b.x][b.y][b.z]=vis[f.x][f.y][f.z]+1;                    ss.push(b);                    continue;                }                int t=gg[mp[b.x][b.y]];                if(isupper(mp[b.x][b.y]))                {                    if(b.z>>t&1)                    {                        vis[b.x][b.y][b.z]=vis[f.x][f.y][f.z]+1;                        ss.push(b);                    }                }                else                {                    b.z=b.z|1<<t;                    vis[b.x][b.y][b.z]=vis[f.x][f.y][f.z]+1;                    ss.push(b);                }            }        }    }    return 0;}int main(){    init();    while(scanf("%d%d",&n,&m),n+m)    {        memset(mp,'#',sizeof(mp));        memset(vis,-1,sizeof(vis));        for(


Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-07-01 14:10:23, Gzip enabled