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_15345206_5536.cpp:6:86: error: 'vectr' does not name a type
 int maxn[M][M];int n,m,b[N],cnt[N];long long num[M][M];typedef pair<int,long long> Q;vectr<Q>C[M][M];int main(){    int _;    scanf("%d",&_);    for(int ca=1;ca<=_;ca++){        emset(b,0,sizeof(b));        memset(C,0,sizeof(C));        memset(num,0,sizeof(num));       memset(maxn,0,sizeof(maxn));        scanf("%d%d",&n,&m);        for(int i=0;i<n;i++){           int x,y;            scanf("%d%d",&x,&y);            if(x>b[y]){                nt[y]=1;                b[y]=x;            }            else if(x==b[y]){                nt[y]++;            }        }        for(int i=0;i<m;i++){            int x,y,z;           scanf("%d%d%d",&x,&y,&z);            if(b[z]>0)C[x][y].push_back(Q(b[z],cnt[z]));       }        for(int i=1;i<M;i++){            for(int j=1;j<M;j++){                int cnt=;                sort(C[i][j].begin(),C[i][j].end());                for(int k=1;k<C[i][j.size();k++){                    if(C[i][j][k]==C[i][j][cnt]){                        C[i[j][cnt].second+=C[i][j][k].second;                    }                    else{                       cnt++;                        C[i][j][cn
                                                                                      ^
0_0_15345206_5536.cpp: In function 'int main()':
0_0_15345206_5536.cpp:6:198: error: 'emset' was not declared in this scope
 int maxn[M][M];int n,m,b[N],cnt[N];long long num[M][M];typedef pair<int,long long> Q;vectr<Q>C[M][M];int main(){    int _;    scanf("%d",&_);    for(int ca=1;ca<=_;ca++){        emset(b,0,sizeof(b));        memset(C,0,sizeof(C));        memset(num,0,sizeof(num));       memset(maxn,0,sizeof(maxn));        scanf("%d%d",&n,&m);        for(int i=0;i<n;i++){           int x,y;            scanf("%d%d",&x,&y);            if(x>b[y]){                nt[y]=1;                b[y]=x;            }            else if(x==b[y]){                nt[y]++;            }        }        for(int i=0;i<m;i++){            int x,y,z;           scanf("%d%d%d",&x,&y,&z);            if(b[z]>0)C[x][y].push_back(Q(b[z],cnt[z]));       }        for(int i=1;i<M;i++){            for(int j=1;j<M;j++){                int cnt=;                sort(C[i][j].begin(),C[i][j].end());                for(int k=1;k<C[i][j.size();k++){                    if(C[i][j][k]==C[i][j][cnt]){                        C[i[j][cnt].second+=C[i][j][k].second;                    }                    else{                       cnt++;                        C[i][j][cn
                                                                                                                                                                                                      ^
0_0_15345206_5536.cpp:6:215: error: 'C' was not declared in this scope
 int maxn[M][M];int n,m,b[N],cnt[N];long long num[M][M];typedef pair<int,long long> Q;vectr<Q>C[M][M];int main(){    int _;    scanf("%d",&_);    for(int ca=1;ca<=_;ca++){        emset(b,0,sizeof(b));        memset(C,0,sizeof(C));        memset(num,0,sizeof(num));       memset(maxn,0,sizeof(maxn));        scanf("%d%d",&n,&m);        for(int i=0;i<n;i++){           int x,y;            scanf("%d%d",&x,&y);            if(x>b[y]){                nt[y]=1;                b[y]=x;            }            else if(x==b[y]){                nt[y]++;            }        }        for(int i=0;i<m;i++){            int x,y,z;           scanf("%d%d%d",&x,&y,&z);            if(b[z]>0)C[x][y].push_back(Q(b[z],cnt[z]));       }        for(int i=1;i<M;i++){            for(int j=1;j<M;j++){                int cnt=;                sort(C[i][j].begin(),C[i][j].end());                for(int k=1;k<C[i][j.size();k++){                    if(C[i][j][k]==C[i][j][cnt]){                        C[i[j][cnt].second+=C[i][j][k].second;                    }                    else{                       cnt++;                        C[i][j][cn
                                                                                                                                                                                                                       ^
0_0_15345206_5536.cpp:6:446: error: 'nt' was not declared in this scope
 int maxn[M][M];int n,m,b[N],cnt[N];long long num[M][M];typedef pair<int,long long> Q;vectr<Q>C[M][M];int main(){    int _;    scanf("%d",&_);    for(int ca=1;ca<=_;ca++){        emset(b,0,sizeof(b));        memset(C,0,sizeof(C));        memset(num,0,sizeof(num));       memset(maxn,0,sizeof(maxn));        scanf("%d%d",&n,&m);        for(int i=0;i<n;i++){           int x,y;            scanf("%d%d",&x,&y);            if(x>b[y]){                nt[y]=1;                b[y]=x;            }            else if(x==b[y]){                nt[y]++;            }        }        for(int i=0;i<m;i++){            int x,y,z;           scanf("%d%d%d",&x,&y,&z);            if(b[z]>0)C[x][y].push_back(Q(b[z],cnt[z]));       }        for(int i=1;i<M;i++){            for(int j=1;j<M;j++){                int cnt=;                sort(C[i][j].begin(),C[i][j].end());                for(int k=1;k<C[i][j.size();k++){                    if(C[i][j][k]==C[i][j][cnt]){                        C[i[j][cnt].second+=C[i][j][k].second;                    }                    else{                       cnt++;                        C[i][j][cn
                                                                                                                                                                                                                                                                                                                                                                                                                                                              ^
0_0_15345206_5536.cpp:6:535: error: 'nt' was not declared in this scope
 int maxn[M][M];int n,m,b[N],cnt[N];long long num[M][M];typedef pair<int,long long> Q;vectr<Q>C[M][M];int main(){    int _;    scanf("%d",&_);    for(int ca=1;ca<=_;ca++){        emset(b,0,sizeof(b));        memset(C,0,sizeof(C));        memset(num,0,sizeof(num));       memset(maxn,0,sizeof(maxn));        scanf("%d%d",&n,&m);        for(int i=0;i<n;i++){           int x,y;            scanf("%d%d",&x,&y);            if(x>b[y]){                nt[y]=1;                b[y]=x;            }            else if(x==b[y]){                nt[y]++;            }        }        for(int i=0;i<m;i++){            int x,y,z;           scanf("%d%d%d",&x,&y,&z);            if(b[z]>0)C[x][y].push_back(Q(b[z],cnt[z]));       }        for(int i=1;i<M;i++){            for(int j=1;j<M;j++){                int cnt=;                sort(C[i][j].begin(),C[i][j].end());                for(int k=1;k<C[i][j.size();k++){                    if(C[i][j][k]==C[i][j][cnt]){                        C[i[j][cnt].second+=C[i][j][k].second;                    }                    else{                       cnt++;                        C[i][j][cn
                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                       ^
0_0_15345206_5536.cpp:6:802: error: expected primary-expression before ';' token
 int maxn[M][M];int n,m,b[N],cnt[N];long long num[M][M];typedef pair<int,long long> Q;vectr<Q>C[M][M];int main(){    int _;    scanf("%d",&_);    for(int ca=1;ca<=_;ca++){        emset(b,0,sizeof(b));        memset(C,0,sizeof(C));        memset(num,0,sizeof(num));       memset(maxn,0,sizeof(maxn));        scanf("%d%d",&n,&m);        for(int i=0;i<n;i++){           int x,y;            scanf("%d%d",&x,&y);            if(x>b[y]){                nt[y]=1;                b[y]=x;            }            else if(x==b[y]){                nt[y]++;            }        }        for(int i=0;i<m;i++){            int x,y,z;           scanf("%d%d%d",&x,&y,&z);            if(b[z]>0)C[x][y].push_back(Q(b[z],cnt[z]));       }        for(int i=1;i<M;i++){            for(int j=1;j<M;j++){                int cnt=;                sort(C[i][j].begin(),C[i][j].end());                for(int k=1;k<C[i][j.size();k++){                    if(C[i][j][k]==C[i][j][cnt]){                        C[i[j][cnt].second+=C[i][j][k].second;                    }                    else{                       cnt++;                        C[i][j][cn
                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  ^
0_0_15345206_5536.cpp:6:892: error: request for member 'size' in 'j', which is of non-class type 'int'
 int maxn[M][M];int n,m,b[N],cnt[N];long long num[M][M];typedef pair<int,long long> Q;vectr<Q>C[M][M];int main(){    int _;    scanf("%d",&_);    for(int ca=1;ca<=_;ca++){        emset(b,0,sizeof(b));        memset(C,0,sizeof(C));        memset(num,0,sizeof(num));       memset(maxn,0,sizeof(maxn));        scanf("%d%d",&n,&m);        for(int i=0;i<n;i++){           int x,y;            scanf("%d%d",&x,&y);            if(x>b[y]){                nt[y]=1;                b[y]=x;            }            else if(x==b[y]){      


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-11-28 15:02:59, Gzip enabled