QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #694202 | #8338. Quad Kingdoms Chess | snow_mikumiku | WA | 26ms | 8560kb | C++14 | 2.5kb | 2024-10-31 17:27:56 | 2024-10-31 17:27:57 |
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 {
UL max, hs;
}A[N << 2], B[N << 2];
UL ask(int p, UL mx, int ty, int l, int r)
{
int mid = l + r >> 1;
if(!ty) {
if(A[p].max < mx) return 0;
if(l == r) return A[p].hs;
if(A[p * 2].max < mx)
return ask(p * 2 + 1, mx, ty, mid + 1, r);
else
return A[p].hs - A[p * 2].hs + ask(p * 2, mx, ty, l, mid);
}
else {
if(B[p].max < mx || B[p].max == 0) return 0;
if(B[p * 2].max < mx)
return ask(p * 2 + 1, mx, ty, mid + 1, r);
else
return B[p].hs - B[p * 2].hs + ask(p * 2, mx, ty, l, mid);
}
}
void change(int x, int p, UL To, int ty, int l, int r)
{
if(!ty) {
if(l == r) {
A[p].hs = m995[To];
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);
A[p].max = max(A[p * 2].max, A[p * 2 + 1].max);
A[p].hs = A[p * 2].hs + ask(p * 2 + 1, A[p * 2].max, 1, mid + 1, r);
}
else {
if(l == r) {
B[p].hs = m995[To];
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);
B[p].max = max(B[p * 2].max, B[p * 2 + 1].max);
B[p].hs = B[p * 2].hs + ask(p * 2 + 1, B[p * 2].max, 1, mid + 1, r);
}
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
mt19937_64 rnd(4124235623523);
for(int i = 1; i < N; i++){
m995[i] = rnd();
}
// 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";
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 8468kb
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: 26ms
memory: 8560kb
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'