QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#227179 | #6135. Books | hano | WA | 204ms | 4908kb | C++14 | 1.4kb | 2023-10-27 00:56:35 | 2023-10-27 00:56:36 |
Judging History
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;
int cntz=0;
ll kk=0;
for(int i=0;i<n;i++){
ll a;cin>>a;
mn=min(mn,a);
if(i>=m&&a==0)cntz++;
if(i<m)kk+=a;
v.push_back(a);
}
ll ans=0;
for(int i=0;i<m;i++){
ans+=v[i];
}
if(m==0){
if(mn==0){
cout<<"Impossible"<<endl;
}else{
cout<<mn-1<<endl;
}
continue;
}
if(n==m){
cout<<"Richman"<<endl;
}else if(cntz){
int k=m-1;
while(cntz && k>-1){
if(v[k]){
ans-=v[k];
cntz--;
if(cntz==0){
ans+=v[k];
}
}
k--;
}
if(cntz){
cout<<"Impossible"<<endl;
}else{
cout<<ans<<endl;
}
}else{
cout<<ans+v[m]-1<<endl;
}
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3760kb
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: 204ms
memory: 4908kb
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 1 Impossible 99999999999999 192 80 Richman 97 490 Richman 24 163 98 30 15 Richman Richman Richman 111 Richman Richman 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 62 343 Rich...
result:
wrong answer 2nd lines differ - expected: '0', found: '1'