QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#627591 | #5075. Fenwick Tree | AmiyaCast | WA | 15ms | 3844kb | C++20 | 828b | 2024-10-10 16:24:41 | 2024-10-10 16:24:41 |
Judging History
answer
#include<bits/stdc++.h>
#define endl '\n'
#define ll long long
#define pii pair<int, int>
const ll inf = 1145141919810;
using namespace std;
const int N = 2e5 + 7;
ll c[N], n;
void add(int x, ll y){
for(; x <= n; x += (x & -x)) c[x] += y;
}
void slv(){
cin >> n;
string s;
cin >> s;
s = "0" + s;
ll ans = 0;
for(int i = 1; i <= n; ++i){
if(c[i] == 0 && s[i] == '1') {
ans ++ ;
add(i, (n - i + 1));
}else if(c[i] && s[i] == '0'){
ans ++ ;
add(i, -c[i]);
}
}
for(int i = 0; i <= n; ++i) c[i] = 0;
cout << ans << endl;
}
int main(){
ios::sync_with_stdio(0), cin.tie(0);
int _ = 1;
cin >> _;
while(_--) slv();
return 0;
}
/*
3
5
10110
5
00000
5
11111
*/
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3548kb
input:
3 5 10110 5 00000 5 11111
output:
3 0 3
result:
ok 3 number(s): "3 0 3"
Test #2:
score: 0
Accepted
time: 13ms
memory: 3844kb
input:
100000 10 0000000000 10 0000000100 10 0000000000 10 1000000000 10 0000010000 10 0000000000 10 0000000000 10 0000000000 10 0100000000 10 0000000000 10 0000000001 10 0000001000 10 0000000000 10 0000000000 10 0000000001 10 0000100000 10 0010000000 10 0000000000 10 0010000000 10 0000000001 10 0000000000...
output:
0 1 0 2 2 0 0 0 2 0 1 2 0 0 1 2 2 0 2 1 0 0 2 2 2 0 2 2 2 0 2 2 0 0 2 2 0 0 2 0 2 2 0 0 0 0 0 0 0 2 2 2 2 0 1 0 2 2 0 2 2 0 2 2 0 1 0 2 0 0 2 2 0 0 0 1 2 0 2 0 0 0 0 2 2 0 0 0 0 0 0 2 0 2 2 0 2 2 2 0 0 0 0 0 0 0 1 0 0 0 2 0 2 0 0 0 2 0 2 0 0 2 0 0 0 1 0 0 1 2 0 0 2 0 2 0 0 2 0 2 0 0 0 2 0 0 2 2 1 0 ...
result:
ok 100000 numbers
Test #3:
score: -100
Wrong Answer
time: 15ms
memory: 3556kb
input:
100000 10 0000001010 10 1110010000 10 0100010000 10 0001010011 10 0100001001 10 0010100000 10 0101000000 10 0100110100 10 1000001010 10 1000101001 10 1000000011 10 0000000000 10 0100011001 10 1000100101 10 0110101000 10 1000110100 10 0011100000 10 1001000000 10 0111001100 10 1100000100 10 1100110000...
output:
4 5 4 4 5 4 2 3 6 7 3 0 6 6 7 3 4 4 3 3 4 2 4 0 3 3 2 2 0 4 3 2 2 2 4 4 3 2 5 5 2 4 0 5 2 6 6 3 4 0 5 5 4 2 0 6 4 7 3 0 2 2 2 1 5 3 2 6 3 0 4 0 0 5 5 0 0 2 5 3 2 4 1 0 2 4 3 3 1 2 3 3 4 2 5 4 3 1 2 4 0 0 2 5 4 2 4 0 5 7 5 2 7 3 2 5 4 5 0 3 4 4 3 2 0 4 2 0 4 4 9 2 2 5 6 3 6 4 2 0 6 2 1 3 4 7 6 0 2 1 ...
result:
wrong answer 2nd numbers differ - expected: '4', found: '5'