QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#406319	#5420. Inscryption	xiaole	WA	133ms	3636kb	C++23	1.1kb	2024-05-07 09:46:59	2024-05-07 09:47:00

Judging History

你现在查看的是最新测评结果

[2024-05-07 09:47:00]
评测

测评结果：WA
用时：133ms
内存：3636kb

查看

[2024-05-07 09:46:59]
提交

answer

#include<bits/stdc++.h>
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
using namespace std;using ll = long long;using PLL = pair<ll,ll>;
const ll MAX = 1e18;const ll MIN = -1e18;const ll INF=0x3f3f3f3f;
const ll Q = 2e5+9;const ll MOD = 1e9 + 7;
ll a[Q];
void solve(){
   ll n;cin>>n;
   ll ma=1,cd=1;
   for (ll i = 1; i <= n; i++)
        cin>>a[i];
   ll now=0;
   for (ll i = 1; i <= n; i++)
   {
        if(a[i]==0) now++;
        if(a[i]==1) cd++;
        if(a[i]==-1){
            if(cd>=2){
                cd--;
                ma++;
            }else{
                if(now>0){
                    now--;
                    ma++;
                }else{
                    cout<<-1<<"\n";
                    return;
                }
            }
        }
   }
    while(now--){
        if(cd>=2){
            cd--;
            ma++;
        }else{
            cd++;
        }
    }
    ma+=cd-1;
    cout<<ma/gcd(ma,cd)<<" "<<cd/gcd(ma,cd)<<"\n";
}
int main(){
    ios;ll _=1;cin>>_;
    while (_--)solve();
    return 0;
}

源文件, 语言: C++23

詳細信息

Test #1:

score: 100

Accepted

time: 1ms

memory: 3520kb

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:

result:

ok 6 lines

Test #2:

score: 0

Accepted

time: 133ms

memory: 3536kb

input:

output:

result:

ok 1000000 lines

Test #3:

score: -100

Wrong Answer

time: 60ms

memory: 3636kb

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:

result:

wrong answer 28th lines differ - expected: '5 4', found: '2 1'