QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#523945 | #8832. Daily Disinfection | SocialPanda | WA | 2ms | 3648kb | C++23 | 911b | 2024-08-19 01:08:34 | 2024-08-19 01:08:34 |
Judging History
answer
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#define int long long
//#define LL long long
#define double long double
//#define lf Lf
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define endl "\n"
#define PII pair<int,int>
#define Gheap priority_queue<int,vector<int>,greater<int>>
#define Lheap priority_queue<int>
#define MAXN 0x3f3f3f3f
#define MINN -0x3f3f3f3f
using namespace std;
//const int N=1e6+100,M=2*N;
//int e[N],w[M],h[M],ne[M],idx;
void solve()
{
int n;cin>>n;
char a[n+1];
int ans=0;
for(int i=1;i<=n;i++)
{
cin>>a[i];
if(a[i]=='1') ans++;
}
if(a[1]=='1') ans++;
cout<<ans<<endl;
}
int main()
{
std::ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int tt=1;
cin >> tt;
while(tt--) solve();
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3636kb
input:
3 2 01 5 00110 9 101010101
output:
1 2 6
result:
ok 3 number(s): "1 2 6"
Test #2:
score: -100
Wrong Answer
time: 2ms
memory: 3648kb
input:
10000 15 010111111011011 10 1000101111 10 0011111101 1 0 3 110 4 1000 8 10000111 20 00000101000100001110 13 1101110110110 13 0111100011010 17 00001001111110101 1 0 20 10001010011000111100 11 00100110101 11 10110101000 15 001011110011000 16 1110111110000111 15 011110110110010 1 0 20 10110001101100010...
output:
11 7 7 0 3 2 5 6 10 7 9 0 10 5 6 7 12 9 0 10 8 7 3 6 0 7 2 5 4 9 10 4 6 1 8 2 2 8 1 8 12 10 14 4 12 13 16 7 4 4 6 2 1 7 8 5 4 0 0 11 9 5 6 7 6 4 9 1 4 5 12 0 3 10 4 3 7 8 3 7 5 3 7 9 15 3 6 7 9 8 6 1 2 5 2 12 11 5 0 0 4 7 4 8 0 5 8 9 4 3 10 4 7 12 9 2 8 6 5 2 5 10 7 1 6 8 8 3 6 12 6 10 9 8 10 16 3 7...
result:
wrong answer 2nd numbers differ - expected: '6', found: '7'