QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#310545#6135. BooksBrotherCall#WA 2ms9688kbC++14821b2024-01-21 15:27:162024-01-21 15:27:16

Judging History

This is the latest submission verdict.

  • [2024-01-21 15:27:16]
  • Judged
  • Verdict: WA
  • Time: 2ms
  • Memory: 9688kb
  • [2024-01-21 15:27:16]
  • Submitted

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(num < 0) cout << "Impossible" << endl;	else
		cout << sum << endl;
	}
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 2ms
memory: 9688kb

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
-1

result:

wrong answer 4th lines differ - expected: 'Impossible', found: '-1'