oj.uz

Submission #518576

# Submission time Handle Problem Language Result Execution time Memory
518576 2022-01-24T07:10:28 Z aurims Swimming competition (LMIO18_plaukimo_varzybos) C++14
10 / 100
 365 ms 11044 KB 
#include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;

int main()
{
	int n, a, b;
	cin >> n >> a >> b;
	int t[1000000];
	for(int i = 0; i < n; i++) cin >> t[i];
	sort(t, t+n);
	int ans = -1;
	// bruteforce
	// subt #1 states a == b
	int mn = 1e6+1;
	int mx = -1;
	int track = 0;
	for(int i = 0; i < n; i++)
	{
		track++;
		if(track == 1) mn = t[i];
		if(track == a)
		{
			mx = t[i];
			ans = max(ans, mx-mn);
			track = 0;
		}
	}
	cout << ans;
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4172 KB Output is correct
2 Correct 31 ms 4804 KB Output is correct
3 Correct 6 ms 4244 KB Output is correct
4 Correct 364 ms 11044 KB Output is correct
5 Correct 365 ms 10828 KB Output is correct
6 Correct 38 ms 4848 KB Output is correct
7 Correct 334 ms 10216 KB Output is correct
8 Correct 2 ms 4172 KB Output is correct
9 Correct 2 ms 4172 KB Output is correct
10 Correct 2 ms 4172 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4172 KB Output is correct
2 Correct 2 ms 4172 KB Output is correct
3 Correct 2 ms 4172 KB Output is correct
4 Incorrect 3 ms 4172 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4172 KB Output is correct
2 Correct 31 ms 4804 KB Output is correct
3 Correct 6 ms 4244 KB Output is correct
4 Correct 364 ms 11044 KB Output is correct
5 Correct 365 ms 10828 KB Output is correct
6 Correct 38 ms 4848 KB Output is correct
7 Correct 334 ms 10216 KB Output is correct
8 Correct 2 ms 4172 KB Output is correct
9 Correct 2 ms 4172 KB Output is correct
10 Correct 2 ms 4172 KB Output is correct
11 Incorrect 3 ms 4172 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4172 KB Output is correct
2 Correct 31 ms 4804 KB Output is correct
3 Correct 6 ms 4244 KB Output is correct
4 Correct 364 ms 11044 KB Output is correct
5 Correct 365 ms 10828 KB Output is correct
6 Correct 38 ms 4848 KB Output is correct
7 Correct 334 ms 10216 KB Output is correct
8 Correct 2 ms 4172 KB Output is correct
9 Correct 2 ms 4172 KB Output is correct
10 Correct 2 ms 4172 KB Output is correct
11 Incorrect 3 ms 4172 KB Output isn't correct
12 Halted 0 ms 0 KB -