Posted on 2011-05-02 23:31
Uriel 閱讀(3985)
評論(0) 編輯 收藏 引用 所屬分類:
模擬 、
HDOJ
今天晚上ch_g和MEC在HDU放了場Virtual Contest, 是以前的一層HDU月賽題... 一共8道... 依然悲劇... 組隊賽還是不給力啊... ...
我只過了San Guo Sha 這道, 還是最后1.5h一直糾結到最后才過...
原來一直對三國殺木有興趣的, 所以當寢室眾人沉浸其中的時候我都不參與, 結果今天這題題目沒有說得很完全, 就一直糾結啊糾結... 最后QQ線上請教了會三國殺的同學才知道內奸要到最后跟主公單挑并且勝了才算贏... 題目沒有提到啊... - -||
WS的代碼如下...
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
struct player 
{
int id;
int alive;
int nkill[4];
int sco;
} p[110];
int N, M, winner;
int n[4], idNJ;
bool killZG;
int role(char *s) {
if (!strcmp(s, "ZG"))
return 0;
if (!strcmp(s, "ZC"))
return 1;
if (!strcmp(s, "NJ"))
return 2;
if (!strcmp(s, "FZ"))
return 3;
}
void check() {
if (!n[2] && !n[3] && n[0] > 0)
winner = 1;
else if (!n[0] && !n[1] && n[2] == 1 && !n[3] && killZG)
winner = 2;
else if (!n[0])
winner = 3;
}
void getscore() {
int i, j;
if (winner == 1) {
for (i = 0; i < N; ++i) {
if (p[i].id == 0) {
p[i].sco = 4 + n[1] * 2;
p[i].sco += p[i].nkill[2] + p[i].nkill[3];
}
else if(p[i].id == 1) {
p[i].sco = 5 + n[1];
p[i].sco += p[i].nkill[2] + p[i].nkill[3];
}
else if(p[i].id == 2) {
if(killZG == false && idNJ == i)
p[i].sco = N;
}
}
}
else if(winner == 2) {
for(i = 0; i < N; ++i) {
if(p[i].id == 0) {
p[i].sco = 1;
}
else if(p[i].id == 2) {
if(p[i].alive) p[i].sco = 4 + 2 * N;
}
}
}
else if(winner == 3) {
for(i = 0; i < N; ++i) {
if(p[i].id == 2) {
if(p[i].alive) p[i].sco = 1;
}
else if(p[i].id == 3) {
p[i].sco = n[3] * 3;
p[i].sco += p[i].nkill[0] * 2;
p[i].sco += p[i].nkill[1] + p[i].nkill[2];
}
}
}
}
int main() {
int cse, i, j, a, b, r1, r2, g;
char ss[10];
scanf("%d", &cse);
while (cse--) {
scanf("%d %d", &N, &M);
memset(n, 0, sizeof(n));
killZG = false;
for (i = 0; i < N; ++i) {
scanf("%s", ss);
p[i].id = role(ss);
n[p[i].id]++;
p[i].alive = 1;
memset(p[i].nkill, 0, sizeof(p[i].nkill));
p[i].sco = 0;
}
winner = 0;
for (i = 0; i < M; ++i) {
scanf("%d %d", &a, &b);
p[b].alive = 0;
p[a].nkill[p[b].id]++;
if (!n[1] && !n[3] && (n[2] == 1)) {
if (p[a].id == 0 && p[b].id == 2) {
killZG = false;
idNJ = b;
}
else {
killZG = true;
idNJ = a;
}
}
n[p[b].id]--;
check();
if (winner!=0) {
getscore();
for (j = 0; j < N - 1; ++j) {
printf("%d ", p[j].sco);
}
printf("%d\n", p[j].sco);
break;
}
}
for (g = i + 1; g < M; ++g)
scanf("%d %d", &a, &b);
}
return 0;
}