QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#310546 | #6135. Books | BrotherCall# | WA | 212ms | 13936kb | C++14 | 821b | 2024-01-21 15:27:45 | 2024-01-21 15:27:45 |
Judging History
answer
#include <iostream>
#include <cstdio>
#include <cmath>
#include <sstream>
#include <cstring>
#define int long long
using namespace std;
const int N = 1e6 + 100;
int t;
int n , m , a[N] , maxx[N] , minn[N];
char c1[N] , c2[N];
signed main() {
cin >> t;
while(t --) {
cin >> n >> m;
for(int i = 1;i <= n;i ++)
cin >> a[i];
if(n == m) {
cout << "Richman" << endl;
continue;
}
maxx[n] = minn[n] = a[n];
for(int i = n - 1;i >= 1;i --)
maxx[i] = max(maxx[i + 1] , a[i]) , minn[i] = min(minn[i + 1] , a[i]);
int sum = 0 , num = m;
for(int i = 1;i <= n;i ++) {
if(num == 0) {sum += minn[i] - 1; break;}
if(maxx[i + 1] > a[i] && num > 0)
sum += a[i] , num --;
}
if(sum < 0) cout << "Impossible" << endl; else
cout << sum << endl;
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 9876kb
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: 212ms
memory: 13936kb
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 0 0 103 80 Richman 97 294 Richman 24 90 98 30 15 Richman Richman Richman 65 Richman Richman 301 81 44 349 34 399 28 59 297 Richman Richman Richman 104 274 2 160 76 58 91 71 3 Richman 91 32 15 Richman 21 26 Richman 65 Richman 247 207 Richman Richman 60 312 62 178 Richman 67 Richman 245 62 43 316 ...
result:
wrong answer 3rd lines differ - expected: 'Impossible', found: '0'