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_30850871_9643.cpp:1:18: error: stray '#' in program
 include<iostream>#include<string>#include<algorithm>#include<cstdlib>#include<cstdio>#include<set>#include<map>#include<vector>#include<cstring>#include<stack>#include<cmath>#include<queue>#define INF 0x3f3f3f3f#define eps 1e-9#define MAXN 1005using namespace std;int t,n,m,a[MAXN],b[MAXN],pre[MAXN];vector<int> color[MAXN];int main(){ scanf("%d",&t); while(t--) {  memset(pre,0,sizeof(pre));  scanf("%d%d",&n,&m);  for(int i = 0;i <= n;i++) color[i].clear();  for(int i = 1;i <= n;i++) scanf("%d",&a[i]);  for(int i = 1;i <= n;i++)   {   scanf("%d",&b[i]);   color[b[i]].push_back(i);  }  for(int i = 1;i <= n;i++)         a[i] = color[a[i]][pre[a[i]]++];        for(int i = 1;i <= m;i++)        {         int l,r;         scanf("%d%d",&l,&r);         sort(a+l,a+1+r);  }  bool flag = true;  for(int i = 1;i <= n;i++)   if(a[i] != i)    {    flag = false;    break;   }  if(flag) cout<<"Yes"<<endl;  else cout<<"No"<<endl;  } } 
                  ^
0_0_30850871_9643.cpp:1:34: error: stray '#' in program
 include<iostream>#include<string>#include<algorithm>#include<cstdlib>#include<cstdio>#include<set>#include<map>#include<vector>#include<cstring>#include<stack>#include<cmath>#include<queue>#define INF 0x3f3f3f3f#define eps 1e-9#define MAXN 1005using namespace std;int t,n,m,a[MAXN],b[MAXN],pre[MAXN];vector<int> color[MAXN];int main(){ scanf("%d",&t); while(t--) {  memset(pre,0,sizeof(pre));  scanf("%d%d",&n,&m);  for(int i = 0;i <= n;i++) color[i].clear();  for(int i = 1;i <= n;i++) scanf("%d",&a[i]);  for(int i = 1;i <= n;i++)   {   scanf("%d",&b[i]);   color[b[i]].push_back(i);  }  for(int i = 1;i <= n;i++)         a[i] = color[a[i]][pre[a[i]]++];        for(int i = 1;i <= m;i++)        {         int l,r;         scanf("%d%d",&l,&r);         sort(a+l,a+1+r);  }  bool flag = true;  for(int i = 1;i <= n;i++)   if(a[i] != i)    {    flag = false;    break;   }  if(flag) cout<<"Yes"<<endl;  else cout<<"No"<<endl;  } } 
                                  ^
0_0_30850871_9643.cpp:1:53: error: stray '#' in program
 include<iostream>#include<string>#include<algorithm>#include<cstdlib>#include<cstdio>#include<set>#include<map>#include<vector>#include<cstring>#include<stack>#include<cmath>#include<queue>#define INF 0x3f3f3f3f#define eps 1e-9#define MAXN 1005using namespace std;int t,n,m,a[MAXN],b[MAXN],pre[MAXN];vector<int> color[MAXN];int main(){ scanf("%d",&t); while(t--) {  memset(pre,0,sizeof(pre));  scanf("%d%d",&n,&m);  for(int i = 0;i <= n;i++) color[i].clear();  for(int i = 1;i <= n;i++) scanf("%d",&a[i]);  for(int i = 1;i <= n;i++)   {   scanf("%d",&b[i]);   color[b[i]].push_back(i);  }  for(int i = 1;i <= n;i++)         a[i] = color[a[i]][pre[a[i]]++];        for(int i = 1;i <= m;i++)        {         int l,r;         scanf("%d%d",&l,&r);         sort(a+l,a+1+r);  }  bool flag = true;  for(int i = 1;i <= n;i++)   if(a[i] != i)    {    flag = false;    break;   }  if(flag) cout<<"Yes"<<endl;  else cout<<"No"<<endl;  } } 
                                                     ^
0_0_30850871_9643.cpp:1:70: error: stray '#' in program
 include<iostream>#include<string>#include<algorithm>#include<cstdlib>#include<cstdio>#include<set>#include<map>#include<vector>#include<cstring>#include<stack>#include<cmath>#include<queue>#define INF 0x3f3f3f3f#define eps 1e-9#define MAXN 1005using namespace std;int t,n,m,a[MAXN],b[MAXN],pre[MAXN];vector<int> color[MAXN];int main(){ scanf("%d",&t); while(t--) {  memset(pre,0,sizeof(pre));  scanf("%d%d",&n,&m);  for(int i = 0;i <= n;i++) color[i].clear();  for(int i = 1;i <= n;i++) scanf("%d",&a[i]);  for(int i = 1;i <= n;i++)   {   scanf("%d",&b[i]);   color[b[i]].push_back(i);  }  for(int i = 1;i <= n;i++)         a[i] = color[a[i]][pre[a[i]]++];        for(int i = 1;i <= m;i++)        {         int l,r;         scanf("%d%d",&l,&r);         sort(a+l,a+1+r);  }  bool flag = true;  for(int i = 1;i <= n;i++)   if(a[i] != i)    {    flag = false;    break;   }  if(flag) cout<<"Yes"<<endl;  else cout<<"No"<<endl;  } } 
                                                                      ^
0_0_30850871_9643.cpp:1:86: error: stray '#' in program
 include<iostream>#include<string>#include<algorithm>#include<cstdlib>#include<cstdio>#include<set>#include<map>#include<vector>#include<cstring>#include<stack>#include<cmath>#include<queue>#define INF 0x3f3f3f3f#define eps 1e-9#define MAXN 1005using namespace std;int t,n,m,a[MAXN],b[MAXN],pre[MAXN];vector<int> color[MAXN];int main(){ scanf("%d",&t); while(t--) {  memset(pre,0,sizeof(pre));  scanf("%d%d",&n,&m);  for(int i = 0;i <= n;i++) color[i].clear();  for(int i = 1;i <= n;i++) scanf("%d",&a[i]);  for(int i = 1;i <= n;i++)   {   scanf("%d",&b[i]);   color[b[i]].push_back(i);  }  for(int i = 1;i <= n;i++)         a[i] = color[a[i]][pre[a[i]]++];        for(int i = 1;i <= m;i++)        {         int l,r;         scanf("%d%d",&l,&r);         sort(a+l,a+1+r);  }  bool flag = true;  for(int i = 1;i <= n;i++)   if(a[i] != i)    {    flag = false;    break;   }  if(flag) cout<<"Yes"<<endl;  else cout<<"No"<<endl;  } } 
                                                                                      ^
0_0_30850871_9643.cpp:1:99: error: stray '#' in program
 include<iostream>#include<string>#include<algorithm>#include<cstdlib>#include<cstdio>#include<set>#include<map>#include<vector>#include<cstring>#include<stack>#include<cmath>#include<queue>#define INF 0x3f3f3f3f#define eps 1e-9#define MAXN 1005using namespace std;int t,n,m,a[MAXN],b[MAXN],pre[MAXN];vector<int> color[MAXN];int main(){ scanf("%d",&t); while(t--) {  memset(pre,0,sizeof(pre));  scanf("%d%d",&n,&m);  for(int i = 0;i <= n;i++) color[i].clear();  for(int i = 1;i <= n;i++) scanf("%d",&a[i]);  for(int i = 1;i <= n;i++)   {   scanf("%d",&b[i]);   color[b[i]].push_back(i);  }  for(int i = 1;i <= n;i++)         a[i] = color[a[i]][pre[a[i]]++];        for(int i = 1;i <= m;i++)        {         int l,r;         scanf("%d%d",&l,&r);         sort(a+l,a+1+r);  }  bool flag = true;  for(int i = 1;i <= n;i++)   if(a[i] != i)    {    flag = false;    break;   }  if(flag) cout<<"Yes"<<endl;  else cout<<"No"<<endl;  } } 
                                                                                                   ^
0_0_30850871_9643.cpp:1:112: error: stray '#' in program
 include<iostream>#include<string>#include<algorithm>#include<cstdlib>#include<cstdio>#include<set>#include<map>#include<vector>#include<cstring>#include<stack>#include<cmath>#include<queue>#define INF 0x3f3f3f3f#define eps 1e-9#define MAXN 1005using namespace std;int t,n,m,a[MAXN],b[MAXN],pre[MAXN];vector<int> color[MAXN];int main(){ scanf("%d",&t); while(t--) {  memset(pre,0,sizeof(pre));  scanf("%d%d",&n,&m);  for(int i = 0;i <= n;i++) color[i].clear();  for(int i = 1;i <= n;i++) scanf("%d",&a[i]);  for(int i = 1;i <= n;i++)   {   scanf("%d",&b[i]);   color[b[i]].push_back(i);  }  for(int i = 1;i <= n;i++)         a[i] = color[a[i]][pre[a[i]]++];        for(int i = 1;i <= m;i++)        {         int l,r;         scanf("%d%d",&l,&r);         sort(a+l,a+1+r);  }  bool flag = true;  for(int i = 1;i <= n;i++)   if(a[i] != i)    {    flag = false;    break;   }  if(flag) cout<<"Yes"<<endl;  else cout<<"No"<<endl;  } } 
                                                                                                                ^
0_0_30850871_9643.cpp:1:128: error: stray '#' in program
 include<iostream>#include<string>#include<algorithm>#include<cstdlib>#include<cstdio>#include<set>#include<map>#include<vector>#include<cstring>#include<stack>#include<cmath>#include<queue>#define INF 0x3f3f3f3f#define eps 1e-9#define MAXN 1005using namespace std;int t,n,m,a[MAXN],b[MAXN],pre[MAXN];vector<int> color[MAXN];int main(){ scanf("%d",&t); while(t--) {  memset(pre,0,sizeof(pre));  scanf("%d%d",&n,&m);  for(int i = 0;i <= n;i++) color[i].clear();  for(int i = 1;i <= n;i++) scanf("%d",&a[i]);  for(int i = 1;i <= n;i++)   {   scanf("%d",&b[i]);   color[b[i]].push_back(i);  }  for(int i = 1;i <= n;i++)         a[i] = color[a[i]][pre[a[i]]++];        for(int i = 1;i <= m;i++)        {         int l,r;         scanf("%d%d",&l,&r);         sort(a+l,a+1+r);  }  bool flag = true;  for(int i = 1;i <= n;i++)   if(a[i] != i)    {    flag = false;    break;   }  if(flag) cout<<"Yes"<<endl;  else cout<<"No"<<endl;  } } 
                                                                                                                                ^
0_0_30850871_9643.cpp:1:145: error: stray '#' in program
 include<iostream>#include<string>#include<algorithm>#include<cstdlib>#include<cstdio>#include<set>#include<map>#include<vector>#include<cstring>#include<stack>#include<cmath>#include<queue>#define INF 0x3f3f3f3f#define eps 1e-9#define MAXN 1005using namespace std;int t,n,m,a[MAXN],b[MAXN],pre[MAXN];vector<int> color[MAXN];int main(){ scanf("%d",&t); while(t--) {  memset(pre,0,sizeof(pre));  scanf("%d%d",&n,&m);  for(int i = 0;i <= n;i++) color[i].clear();  for(int i = 1;i <= n;i++) scanf("%d",&a[i]);  for(int i = 1;i <= n;i++)   {   scanf("%d",&b[i]);   color[b[i]].push_back(i);  }  for(int i = 1;i <= n;i++)         a[i] = color[a[i]][pre[a[i]]++];        for(int i = 1;i <= m;i++)        {         int l,r;         scanf("%d%d",&l,&r);         sort(a+l,a+1+r);  }  bool flag = true;  for(int i = 1;i <= n;i++)   if(a[i] != i)    {    flag = false;    break;   }  if(flag) cout<<"Yes"<<endl;  else cout<<"No"<<endl;  } } 
                                                                                                                                                 ^
0_0_30850871_9643.cpp:1:160: error: stray '#' in program
 include<iostream>#include<string>#include<algorithm>#include<cstdlib>#include<cstdio>#include<set>#include<map>#include<vector>#include<cstring>#include<stack>#include<cmath>#include<queue>#define INF 0x3f3f3f3f#define eps 1e-9#define MAXN 1005using namespace std;int t,n,m,a[MAXN],b[MAXN],pre[MAXN];vector<int> color[MAXN];int main(){ scanf("%d",&t); while(t--) {  memset(pre,0,sizeof(pre));  scanf("%d%d",&n,&m);  for(int 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-11-23 01:55:07, Gzip enabled