QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #693669 | #8338. Quad Kingdoms Chess | snow_mikumiku | WA | 30ms | 8256kb | C++14 | 3.1kb | 2024-10-31 16:32:39 | 2024-10-31 16:32:43 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using UL = unsigned long long;
const UL mi = 1e9 + 7;
const int N = 1e5 + 10;
UL m995[N], a[N], b[N];
struct tree {
int l, r;
UL cnt;
UL max, hs;
friend tree operator + (tree &a, tree &b) {
tree ans;
ans.cnt = a.cnt + b.cnt;
if(a.max > b.max) ans.max = a.max;
else ans.max = b.max;
ans.hs = a.hs * m995[b.cnt] + b.hs;
return ans;
}
friend tree operator - (tree &a, tree &b) {
tree ans;
ans.cnt = a.cnt - b.cnt;
ans.hs = a.hs - m995[ans.cnt] * b.hs;
return ans;
}
}A[N << 2], B[N << 2], nul;
tree ask(int p, UL mx, int ty, int l, int r)
{
int mid = l + r >> 1;
if(!ty) {
if(A[p].max < mx || A[p].max == 0) return nul;
if(A[p * 2].max < mx)
return ask(p * 2 + 1, mx, ty, mid + 1, r);
else {
tree tmp = ask(p * 2, mx, ty, l, mid);
tree tmp2 = A[p] - A[p * 2];
tmp2.max = A[p * 2 + 1].max;
return tmp + tmp2;
}
}
else {
if(B[p].max < mx || B[p].max == 0) return nul;
if(B[p * 2].max < mx)
return ask(p * 2 + 1, mx, ty, mid + 1, r);
else {
tree tmp = ask(p * 2, mx, ty, l, mid);
tree tmp2 = B[p] - B[p * 2];
tmp2.max = B[p * 2 + 1].max;
return tmp + tmp2;
}
}
}
void update(tree &w, tree &u) {
w.cnt = u.cnt;
w.hs = u.hs;
w.max = u.max;
}
void change(int x, int p, UL To, int ty, int l, int r)
{
if(!ty) {
if(l == r) {
A[p].cnt = 1;
A[p].hs = A[p].max = To;
return;
}
int mid = l + r >> 1;
if(x <= mid) change(x, p * 2, To, ty, l, mid);
else change(x, p * 2 + 1, To, ty, mid + 1, r);
tree tmp = ask(p * 2 + 1, A[p * 2].max, ty, mid + 1, r);
tmp = A[p * 2] + tmp;
update(A[p], tmp);
}
else {
if(l == r) {
B[p].cnt = 1;
B[p].hs = B[p].max = To;
return;
}
int mid = l + r >> 1;
if(x <= mid) change(x, p * 2, To, ty, l, mid);
else change(x, p * 2 + 1, To, ty, mid + 1, r);
tree tmp = ask(p * 2 + 1, B[p * 2].max, ty, mid + 1, r);
tmp = B[p * 2] + tmp;
update(B[p], tmp);
}
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
m995[0] = 1;
for(int i = 1; i < N; i++) m995[i] = m995[i - 1] * mi;
int n, m, q;
cin >> n;
for(int i = n; i >= 1; i--) {
cin >> a[i];
change(i, 1, a[i], 0, 1, n);
}
cin >> m;
for(int i = m; i >= 1; i--) {
cin >> b[i];
change(i, 1, b[i], 1, 1, m);
}
int op, x, y;
cin >> q;
for(int i = 1; i <= q; i++) {
cin >> op >> x >> y;
if(op == 1) x = n - x + 1, change(x, 1, y, 0, 1, n);
if(op == 2) x = m - x + 1, change(x, 1, y, 1, 1, m);
if(B[1].hs == A[1].hs) cout << "YES\n";
else cout << "NO\n";
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 8156kb
input:
5 1 2 3 4 5 5 5 4 3 2 1 8 1 1 5 1 4 2 1 2 4 1 5 1 1 5 5 2 1 4 2 3 5 2 5 5
output:
NO NO NO YES NO NO NO YES
result:
ok 8 tokens
Test #2:
score: -100
Wrong Answer
time: 30ms
memory: 8256kb
input:
1 2 6 2 1 1 1 1 1 200000 2 6 2 1 1 1 1 1 1 1 1 2 2 1 1 1 1 2 1 1 1 2 4 1 2 1 2 1 1 1 1 1 2 2 5 1 1 1 1 1 1 2 1 1 1 2 6 1 1 1 2 1 1 2 1 1 2 2 3 1 1 1 1 2 1 1 2 6 2 1 1 2 2 4 1 1 1 2 2 6 1 1 1 2 1 1 1 2 5 2 2 6 2 1 1 1 2 4 2 2 5 2 2 6 2 1 1 1 2 5 1 2 6 2 1 1 2 1 1 1 1 1 1 2 4 1 1 1 2 1 1 2 1 1 2 2 3 2...
output:
YES NO NO YES YES YES NO NO NO NO YES YES NO YES NO YES NO NO NO NO YES YES NO YES YES YES NO NO YES YES NO NO NO NO NO NO NO NO YES NO NO NO YES YES YES YES YES YES YES YES YES NO YES YES YES YES NO YES YES NO NO YES YES YES YES YES YES YES YES YES YES YES NO YES NO NO YES YES YES NO NO NO NO NO YE...
result:
wrong answer 1st words differ - expected: 'NO', found: 'YES'