QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#315055 | #4935. Exchange Bottleneck | yuyutw# | WA | 1ms | 3612kb | C++14 | 628b | 2024-01-26 21:00:15 | 2024-01-26 21:00:16 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define io ios::sync_with_stdio(0), cin.tie(0);
#define endl '\n'
#define MXN (ll)1e6+5
int main(){
int n;
cin >> n;
int arr[n-1];
int nw = 0, mx = 0, flag = 0, ans = 0, a1 = 0;
for(int i=0;i<n-1;i++) {
cin >> arr[i];
if(arr[i]) {
flag = 1;
a1++;
} else {
flag = 0;
nw++;
}
}
if(a1 == n-1) {
cout << 1 << endl;
} else if(flag) {
cout << 2 << endl;
} else {
cout << max(nw, 2) << endl;
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3612kb
input:
5 1 0 1 0
output:
2
result:
ok single line: '2'
Test #2:
score: 0
Accepted
time: 1ms
memory: 3560kb
input:
7 1 1 1 1 1 1
output:
1
result:
ok single line: '1'
Test #3:
score: -100
Wrong Answer
time: 1ms
memory: 3592kb
input:
2 0
output:
2
result:
wrong answer 1st lines differ - expected: '1', found: '2'