QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#425347 | #8749. 贸易 | ucup-team2279# | WA | 67ms | 21720kb | C++17 | 597b | 2024-05-30 09:07:23 | 2024-05-30 09:07:24 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int N=5e5+5;
int n,q,a[N],c[N],tr[N],l[N],ans[N];
vector<int> p[N];
int main(){
cin.tie(0)->sync_with_stdio(0);
cin>>n>>q;
for(int i=1;i<=n;i++) cin>>a[i];
for(int i=1;i<=n;i++) cin>>c[i];
for(int i=0,r;i<q;i++) cin>>l[i]>>r,p[r].push_back(i);
for(int i=1;i<=n;i++){
auto&v=p[c[i]];
if(a[i]&&v.size()){
for(int x=v.back();x;x-=x&-x) tr[x]++;
v.pop_back();
}
if(!a[i]) v.push_back(i);
for(int t:p[i]) for(int x=l[t];x<=n;x+=x&-x) ans[t]+=tr[x];
}
for(int i=0;i<q;i++) cout<<ans[i]<<"\n";
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 15304kb
input:
10 5 1 1 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 4 6 2 4 2 6 7 10 4 7
output:
0 0 0 1 0
result:
ok 5 lines
Test #2:
score: 0
Accepted
time: 57ms
memory: 21296kb
input:
20 500000 1 0 0 1 0 0 0 0 1 0 1 0 1 0 1 0 1 0 0 0 1 2 1 2 2 1 1 2 1 1 1 2 2 1 2 2 2 1 1 2 13 20 8 9 1 7 5 13 3 10 3 19 14 15 1 5 9 17 7 10 6 6 8 20 1 17 13 20 4 6 16 20 7 14 2 16 3 17 11 12 1 1 15 20 11 15 2 12 2 15 8 16 9 12 9 13 10 19 12 19 9 13 4 8 2 2 19 19 9 17 4 20 4 14 4 8 6 13 13 17 15 16 13...
output:
1 0 1 3 1 5 0 1 3 1 0 4 6 1 0 1 3 5 5 0 0 1 1 3 5 3 1 2 3 2 2 0 0 0 3 5 3 0 3 1 0 1 1 4 2 2 2 1 0 0 2 3 1 0 3 1 0 1 4 0 1 0 5 3 1 0 1 1 1 1 0 5 3 5 5 5 2 3 2 2 2 0 4 2 0 1 6 5 1 2 2 5 4 1 1 1 1 3 1 2 5 1 2 1 0 0 5 0 1 4 3 5 0 4 2 3 0 2 3 1 1 1 1 5 0 2 3 0 6 1 1 5 0 1 4 2 0 6 3 1 0 1 2 0 2 1 0 0 0 0 ...
result:
ok 500000 lines
Test #3:
score: 0
Accepted
time: 67ms
memory: 21488kb
input:
30 500000 1 0 1 1 0 1 1 0 0 1 0 1 0 0 0 1 1 0 0 0 0 1 1 1 0 0 0 1 0 1 2 3 2 1 2 1 3 2 1 3 1 2 3 1 2 1 3 2 3 2 1 2 1 2 1 1 1 2 3 2 5 19 3 25 8 23 17 19 15 26 3 27 1 10 25 30 16 22 11 21 17 29 21 30 11 26 3 27 21 22 17 23 1 14 5 21 24 27 8 20 15 29 13 25 11 19 5 15 7 18 24 28 7 26 3 24 14 26 4 5 11 19...
output:
3 6 5 0 3 6 1 0 1 2 3 1 5 6 0 2 2 3 0 3 4 5 2 1 3 0 6 6 4 0 2 5 8 7 1 3 0 5 2 2 2 0 2 3 0 2 3 4 0 0 3 6 2 0 6 3 3 3 5 6 0 2 4 3 3 0 0 1 2 0 0 3 3 4 1 6 2 2 0 3 0 4 1 3 0 2 2 6 2 0 1 6 4 4 2 0 0 0 1 6 6 0 1 0 0 0 0 1 3 6 2 0 4 3 0 5 8 7 1 1 6 0 6 3 3 0 4 3 1 0 8 4 5 3 3 0 0 0 2 3 6 5 3 5 0 0 2 7 4 2 ...
result:
ok 500000 lines
Test #4:
score: 0
Accepted
time: 67ms
memory: 21720kb
input:
40 500000 1 1 1 1 1 1 1 1 0 1 1 0 0 0 1 0 1 1 1 1 0 0 0 1 1 0 0 0 0 1 0 1 0 0 0 1 0 0 0 0 2 3 3 2 4 3 1 3 1 3 2 3 4 3 3 1 1 4 3 2 4 1 3 1 1 3 4 4 4 1 1 1 2 4 4 1 2 3 3 3 10 24 23 39 8 26 6 23 34 39 30 32 7 33 14 28 12 32 17 18 12 30 1 23 8 40 12 33 8 9 35 40 24 40 8 31 12 24 24 36 3 30 17 24 12 14 2...
output:
5 1 6 4 0 1 7 3 6 0 5 4 7 6 0 0 1 6 5 1 6 1 0 0 5 0 5 3 7 4 1 0 0 4 4 6 0 0 5 0 0 1 3 0 0 7 0 0 1 6 0 0 3 7 0 2 4 2 6 1 0 0 0 6 6 2 1 5 6 3 2 0 7 2 0 7 0 1 0 6 0 7 0 6 6 2 1 6 5 0 0 1 0 0 1 1 2 6 3 0 1 4 2 6 7 4 0 0 0 6 4 0 2 0 0 1 3 0 7 6 1 6 1 1 5 0 0 7 1 6 1 6 6 5 4 0 1 1 4 0 4 0 3 0 4 2 0 6 6 0 ...
result:
ok 500000 lines
Test #5:
score: 0
Accepted
time: 62ms
memory: 21692kb
input:
50 500000 1 0 1 0 1 0 1 1 1 1 1 1 1 1 1 1 0 0 0 1 0 1 0 1 1 1 1 0 0 1 0 0 1 1 0 1 1 0 0 0 0 0 1 1 0 0 0 0 0 1 1 5 3 3 1 5 1 3 1 3 4 1 2 5 4 1 2 3 3 4 5 4 1 5 2 1 5 5 1 5 1 4 2 2 4 2 5 5 1 3 1 4 1 2 2 3 3 4 1 5 2 44 23 46 31 49 12 30 35 50 38 48 23 50 6 31 4 31 3 13 12 42 41 46 14 44 3 20 8 23 15 22 ...
output:
8 3 1 4 2 1 4 5 6 1 4 1 5 2 0 0 4 0 6 1 5 0 0 1 4 1 0 5 5 1 2 1 0 1 5 2 4 1 0 0 4 4 5 6 1 3 1 5 4 2 3 0 0 1 3 3 3 1 0 1 5 2 3 4 3 1 4 1 7 3 1 1 0 4 5 1 1 3 0 4 0 5 0 4 4 5 5 3 0 0 0 2 0 0 3 0 4 0 6 1 5 1 0 5 0 0 3 4 5 1 0 3 4 0 0 0 0 2 0 1 4 2 1 2 1 1 0 1 0 1 1 3 4 1 3 1 0 0 3 1 1 5 2 2 1 0 5 0 0 3 ...
result:
ok 500000 lines
Test #6:
score: 0
Accepted
time: 61ms
memory: 21560kb
input:
60 500000 0 0 1 1 0 0 0 0 0 1 0 1 0 0 1 0 0 0 0 1 0 0 0 0 0 1 1 0 0 0 1 1 0 0 0 1 0 0 0 0 1 1 0 1 1 1 0 0 0 0 1 0 1 0 1 1 0 0 1 1 2 3 2 1 4 1 3 1 6 5 1 1 2 6 2 3 5 2 3 5 4 2 1 4 4 3 1 6 5 5 4 1 3 4 4 4 2 5 1 4 4 2 3 5 2 3 2 3 1 1 5 6 5 4 2 4 3 3 3 2 19 22 37 50 29 41 32 47 28 59 5 33 8 32 15 31 30 4...
output:
0 4 2 5 10 7 7 4 2 5 1 15 13 17 6 13 18 6 2 7 1 2 2 3 0 7 3 1 0 0 13 1 7 18 9 13 9 2 10 0 1 4 17 8 0 10 17 5 7 0 15 1 2 1 15 5 6 0 0 5 16 14 1 1 10 3 3 9 7 0 2 0 16 12 1 10 6 3 0 8 8 13 2 4 5 0 5 3 4 10 2 7 3 3 1 7 18 2 3 0 0 5 1 9 1 2 3 7 16 0 0 8 1 3 2 0 4 4 3 4 1 5 2 3 1 0 8 9 2 2 0 7 3 0 15 4 2 ...
result:
ok 500000 lines
Test #7:
score: -100
Wrong Answer
time: 64ms
memory: 21580kb
input:
70 500000 0 1 0 0 1 1 1 0 0 0 0 1 1 0 1 1 0 0 1 0 0 0 0 0 1 1 0 1 1 0 0 0 1 0 1 1 0 0 0 1 1 0 1 0 1 0 0 1 1 0 1 0 1 0 1 1 0 0 0 0 1 0 0 1 0 0 1 1 0 0 6 5 5 1 6 7 1 4 1 7 7 6 6 1 4 5 7 4 5 3 4 1 3 1 4 4 2 2 1 2 2 5 7 1 5 1 1 6 3 6 7 7 2 6 4 3 4 6 1 5 1 6 4 1 4 4 2 2 5 5 2 4 4 1 5 7 5 2 1 5 42 69 30 4...
output:
6 6 4 13 5 10 2 1 21 13 3 1 1 5 0 0 9 0 3 1 3 0 10 22 1 1 7 4 7 10 2 13 13 10 5 0 7 0 5 11 1 0 0 0 3 0 15 2 0 12 8 3 4 3 1 5 10 0 13 8 0 4 18 2 5 1 7 4 0 7 14 12 7 10 5 3 13 0 1 1 17 3 0 6 1 0 17 1 1 0 5 9 6 11 1 14 16 0 5 0 9 9 7 10 15 4 15 3 0 17 1 16 7 8 18 1 3 5 8 1 8 1 4 0 7 2 12 9 4 6 3 15 1 0...
result:
wrong answer 499030th lines differ - expected: '1', found: '0'