摘要： 1 #include 2 #include 3 #include 4 using namespace std; 5 typedef pair a1; 6 map b; 7 int main() 8 { 9 int i,j,k,n,m,x,y,z;10 pair a;11 while(scanf("%d",&n)>0)12 {13 for(i=1;i<=n;i++)14 {15 scanf("%d%d%d",&x,&y,&z);16 a.first=x;17 a.second=y;18 // b[a]=z;19 阅读全文

摘要： 1 /* 2 优先队列 3 */ 4 5 #include 6 #include 7 #include 8 #include 9 #include10 #define HH 1111111111 using namespace std;12 char a[202][202];13 int visit[202][202];14 int n,m;15 int map[4][2]={{1,0},{0,1},{-1,0},{0,-1}};16 struct node17 {18 friend bool operatorn2.p;21 }22 int p;23 int... 阅读全文

摘要： PebblesTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 795Accepted Submission(s): 439Problem DescriptionYou're given an unlimited number of pebbles to distribute across an N x N game board (N drawn from [3, 15]), where each square on the board 阅读全文