QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#227169#6135. BookshanoWA 209ms5040kbC++141.2kb2023-10-27 00:29:192023-10-27 00:29:19

Judging History

This is the latest submission verdict.

  • [2023-10-27 00:29:19]
  • Judged
  • Verdict: WA
  • Time: 209ms
  • Memory: 5040kb
  • [2023-10-27 00:29:19]
  • Submitted

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pi pair<int,ll>
#define fi first
#define se second
#define pb push_back
#pragma GCC optimize("O3")
#pragma GCC target("avx2")


int main(){
    int t;cin>>t;
    while(t--){
        int n,m;cin>>n>>m;
        vector<ll>v;
        ll mn=1e10;
        for(int i=0;i<n;i++){
            ll a;cin>>a;
            mn=min(mn,a);
            v.push_back(a);
        }
        ll ans=0;
        for(int i=0;i<m;i++){
            ans+=v[i];
            if(v[i]==0){
                for(int j=i;j<m;j++){
                    if(v[j]!=0){
                        cout<<"Impossible"<<endl;
                        goto here;
                    }
                }
            }
        }
        if(m==0){
            if(mn==0){
                cout<<"Impossible"<<endl;
            }else{
                cout<<mn-1<<endl;
            }
            continue;
        }
        if(n==m){
            if(v[n-1]!=0)cout<<"Richman"<<endl;
            else cout<<ans<<endl;
        }else if(v[m]==0){
            cout<<"Impossible"<<endl;
        }else{
            cout<<ans+v[m]-1<<endl;
        }
        here:continue;
    }
}

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3600kb

input:

4
4 2
1 2 4 8
4 0
100 99 98 97
2 2
10000 10000
5 3
0 0 0 0 1

output:

6
96
Richman
Impossible

result:

ok 4 lines

Test #2:

score: -100
Wrong Answer
time: 209ms
memory: 5040kb

input:

10012
1 0
2
3 2
0 1 0
2 1
0 0
100000 99999
1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000...

output:

1
Impossible
Impossible
99999999999999
192
80
Richman
97
490
Richman
24
163
98
30
15
Richman
Richman
Richman
111
Richman
Impossible
450
168
44
350
34
513
28
202
321
Richman
Richman
Richman
212
344
2
160
76
101
91
130
3
Richman
200
32
15
Richman
21
26
Richman
88
Richman
302
356
Richman
Richman
60
313...

result:

wrong answer 2nd lines differ - expected: '0', found: 'Impossible'