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_35089045_5778.cpp:53:16: error: 'kdq' was not declared in this scope
 priority_queue<kdq>qe ;
                ^
0_0_35089045_5778.cpp:53:19: error: template argument 1 is invalid
 priority_queue<kdq>qe ;
                   ^
0_0_35089045_5778.cpp:53:19: error: template argument 2 is invalid
0_0_35089045_5778.cpp:53:19: error: template argument 3 is invalid
0_0_35089045_5778.cpp:53:23: error: invalid type in declaration before ';' token
 priority_queue<kdq>qe ;
                       ^
0_0_35089045_5778.cpp: In function 'void Prim()':
0_0_35089045_5778.cpp:72:15: error: request for member 'empty' in 'qe', which is of non-class type 'int'
     while(!qe.empty())qe.pop() ;
               ^
0_0_35089045_5778.cpp:72:26: error: request for member 'pop' in 'qe', which is of non-class type 'int'
     while(!qe.empty())qe.pop() ;
                          ^
0_0_35089045_5778.cpp:73:86: error: request for member 'push' in 'qe', which is of non-class type 'int'
     for (int i = 0 ; i < n ; i ++ )dis[i] = Map[0][i] , vis[i] = 0 ,G[i].clear() ,qe.push((kdq){0 , i , dis[i]}) ;
                                                                                      ^
0_0_35089045_5778.cpp:75:15: error: request for member 'empty' in 'qe', which is of non-class type 'int'
     while(!qe.empty()){
               ^
0_0_35089045_5778.cpp:76:21: error: request for member 'top' in 'qe', which is of non-class type 'int'
         kdq tp = qe.top() ; qe.pop() ;
                     ^
0_0_35089045_5778.cpp:76:32: error: request for member 'pop' in 'qe', which is of non-class type 'int'
         kdq tp = qe.top() ; qe.pop() ;
                                ^
0_0_35089045_5778.cpp:83:103: error: request for member 'push' in 'qe', which is of non-class type 'int'
         for (int i = 0 ; i < n ; i ++ )if(!vis[i] && dis[i] > Map[tp.e][i])dis[i] = Map[tp.e][i] , qe.push((kdq){tp.e , i , dis[i]}) ;
                                                                                                       ^


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-04 08:51:03, Gzip enabled