QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#326424#6135. BooksLainAC ✓52ms4840kbC++23762b2024-02-13 01:55:112024-02-13 01:55:11

Judging History

This is the latest submission verdict.

  • [2024-02-13 01:55:11]
  • Judged
  • Verdict: AC
  • Time: 52ms
  • Memory: 4840kb
  • [2024-02-13 01:55:11]
  • Submitted

answer

#include "bits/stdc++.h"
using namespace std;

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  int tt;
  cin >> tt;
  while(tt--) {
    int n, m;
    cin >> n >> m;
    vector<int64_t> a(n);
    for (auto& x : a) cin >> x;

    if (n == m) {
      cout << "Richman\n";
      continue;
    }
    
    int z = 0;
    vector<int> nz;
    for (int i =0; i < n;i++) {
      if (a[i]) {
        nz.push_back(a[i]);
      } else {
        z++;
      }
    }
    int64_t ans =0;
    if (z > m) {
      cout << "Impossible\n";
      continue;
    }
    m -= z;
    for (int i =0; i < m; i++) {
      ans += nz[i];
    }
    ans += *min_element(nz.begin() + m, nz.end()) - 1;
    cout << ans << '\n';
  }
}


詳細信息

Test #1:

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

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: 0
Accepted
time: 47ms
memory: 4588kb

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
0
Impossible
99999999999999
192
80
Richman
97
460
Richman
24
163
98
30
15
Richman
Richman
Richman
65
Richman
Richman
450
98
44
349
34
513
28
161
297
Richman
Richman
Richman
147
274
2
160
76
58
91
130
3
Richman
175
32
15
Richman
21
26
Richman
65
Richman
247
356
Richman
Richman
60
312
62
276
Richman...

result:

ok 10012 lines

Test #3:

score: 0
Accepted
time: 52ms
memory: 4840kb

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
0
Impossible
99999999999999
Richman
Impossible
697
123
Richman
Impossible
Richman
335
Richman
Impossible
Richman
486
Richman
Impossible
57
41
Richman
Impossible
42
Richman
Richman
99
106
Richman
Richman
Impossible
Richman
Richman
Richman
Impossible
164
26
Richman
43
Richman
Richman
Richman
Impossi...

result:

ok 10012 lines