QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #686703 | #5420. Inscryption | wangxiaorui# | WA | 388ms | 3716kb | C++14 | 1.4kb | 2024-10-29 15:13:46 | 2024-10-29 15:13:49 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int T;
int n;
const int MAXN = 1e6 + 10;
int a[MAXN];
int sum, cnt, c0;
void solve()
{
sum = cnt = 1;
c0 = 0;
for(int i = 1; i <= n; ++i)
{
if (a[i] == 1)
{
++sum;
++cnt;
}
if (a[i] == 0) ++c0;
if (a[i] == -1)
{
if (cnt == 1)
{
if (c0)
{
++sum;
--c0;
}
else
{
cout << "-1\n";
return;
}
}
else --cnt;
}//cout << sum << " " << cnt << "\n";
}
if (c0 < cnt - 1) cnt -= c0;
else
{
c0 -= cnt - 1;
sum += cnt - 1;
sum += c0 >> 1;
if (c0 & 1)
{
++sum;
cnt = 2;
}
else cnt = 1;
}
int t = __gcd(cnt, sum);
sum /= t;
cnt /= t;
cout << sum << ' ' << cnt << '\n';
}
int main()
{//freopen("1.in", "r", stdin);
ios_base::sync_with_stdio(false);
//cin.tie(nullptr);
//cout.tie(nullptr);
cin >> T;
while (T--)
{
cin >> n;
for(int i = 1; i <= n; ++i) cin >> a[i];
solve();
}
return 0;
}
/*
6
7
1 1 1 -1 1 1 -1
4
1 0 -1 0
4
0 -1 -1 0
1
0
2
0 0
1 -1
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3708kb
input:
6 7 1 1 1 -1 1 1 -1 4 1 0 -1 0 4 0 -1 -1 0 1 0 2 0 0 1 -1
output:
3 2 3 1 -1 1 1 2 1 -1
result:
ok 6 lines
Test #2:
score: 0
Accepted
time: 388ms
memory: 3652kb
input:
1000000 1 1 1 -1 1 1 1 1 1 1 1 1 1 -1 1 -1 1 0 1 0 1 1 1 0 1 -1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 0 1 0 1 1 1 -1 1 1 1 1 1 -1 1 0 1 1 1 0 1 -1 1 0 1 -1 1 1 1 -1 1 0 1 1 1 1 1 -1 1 0 1 -1 1 -1 1 -1 1 -1 1 0 1 0 1 -1 1 0 1 -1 1 0 1 0 1 0 1 0 1 0 1 -1 1 1 1 0 1 0 1 1 1 0 1 -1 1 1 1 1 1 0 1 1 1 1 1 1 1 0 1 ...
output:
1 1 -1 1 1 1 1 1 1 1 1 -1 -1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 1 1 1 -1 1 1 1 1 1 1 -1 1 1 -1 1 1 -1 1 1 1 1 1 1 -1 1 1 -1 -1 -1 -1 1 1 1 1 -1 1 1 -1 1 1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 -1 1 1 1 1 -1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 ...
result:
ok 1000000 lines
Test #3:
score: -100
Wrong Answer
time: 112ms
memory: 3716kb
input:
181249 6 1 0 -1 0 1 0 4 1 -1 -1 -1 8 -1 0 0 0 1 -1 1 1 3 0 1 0 6 1 0 -1 1 -1 0 4 1 -1 -1 -1 9 0 1 0 -1 -1 0 -1 0 1 1 -1 3 0 -1 1 5 0 0 1 -1 1 3 1 -1 0 6 -1 0 0 -1 0 1 8 1 -1 -1 -1 0 1 -1 0 2 0 0 3 -1 1 0 3 0 -1 -1 10 0 1 0 -1 1 1 0 -1 1 0 3 1 0 0 9 1 -1 1 -1 0 -1 0 0 0 3 0 1 0 3 -1 0 0 7 -1 0 -1 -1 ...
output:
5 1 -1 -1 2 1 4 1 -1 7 2 -1 3 2 5 2 3 2 -1 -1 2 1 -1 -1 8 1 2 1 3 1 2 1 -1 -1 -1 -1 3 1 5 3 -1 2 1 3 1 -1 2 1 6 1 1 1 -1 2 1 -1 1 1 -1 2 1 1 1 -1 1 1 -1 1 1 3 2 -1 -1 -1 -1 3 2 7 2 1 1 -1 3 1 -1 -1 1 1 -1 6 1 3 2 -1 3 2 4 3 2 1 -1 5 3 7 2 6 1 -1 2 1 2 1 -1 1 1 -1 3 1 -1 -1 5 1 1 1 2 1 5 2 -1 4 1 4 3...
result:
wrong answer 1st lines differ - expected: '4 1', found: '5 1'