简答题
偏难
#22096
星战(galaxy)
星战(galaxy)




答案与解析
正确答案:<pre class="brush:cpp;toolbar:false">#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 5;
int n, m, q, a[N];
long long to[N], sum[N], tot, ans;
int main() {
mt19937 rnd(time(0));
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i) {
ans += (a[i] = rnd());
}
for (int i = 1, u, v; i <= m; ++i) {
scanf("%d%d", &u, &v);
to[v] += a[u];
sum[v] = to[v];
tot += a[u];
}
scanf("%d", &q);
for (int i = 1, t, u, v; i <= q; ++i) {
scanf("%d%d", &t, &u);
if (t == 1) {
scanf("%d", &v);
to[v] -= a[u];
tot -= a[u];
}
if (t == 2) {
tot -= to[u];
to[u] = 0;
}
if (t == 3) {
scanf("%d", &v);
to[v] += a[u];
tot += a[u];
}
if (t == 4) {
tot += sum[u] - to[u];
to[u] = sum[u];
}
puts(tot == ans ? "YES" : "NO");
}
return 0;
}</pre><p><br/></p>
这道题暂未补解析。