具体的(第一个问题) :
for(int i = 1; i <= m; i++) if(deg[i] == 0) q.push(i);
打成了
for(int i = 1; i <= n; i++) if(deg[i] == 0) q.push(i);
第二个问题 :
bool cheak(int x) {
int now = x;
bool flag = 0;
while(now > 2) {
flag ^= 1;
PII maxn = val[now], minn = val[1];
maxn.val -= minn.val;
if(maxn > val[2]) return flag;
else val[1] = maxn, now--;
}
flag ^= 1;
return flag;
}
写成了
bool cheak(int x) {
int now = x;
bool flag = 1;
while(now > 2) {
flag ^= 1;
PII maxn = val[now], minn = val[1];
maxn.val -= minn.val;
if(maxn > val[2]) return flag;
else val[1] = maxn, now--;
}
return flag;
}