oj.uz

Submission #945939

# Submission time Handle Problem Language Result Execution time Memory
945939 2024-03-14T08:57:04 Z hmm789 Road Construction (JOI21_road_construction) C++14
0 / 100
 8538 ms 9644 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long 
#define INF 1000000000000000000
#define MOD 1000000007

const int B = 700;

int32_t main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int n, k;
	cin >> n >> k;
	int x[n], y[n];
	for(int i = 0; i < n; i++) cin >> x[i] >> y[i];
	priority_queue<int> pq;
	sort(x, x+n);
	for(int i = 0; i < n; i++) {
		for(int j = i+1; j < min(n, i+B); j++) {
			pq.push(x[j]-x[i]);
			if((int)pq.size() > k) pq.pop();
		}
	}
	vector<int> ans;
	while(pq.size()) {
		ans.push_back(pq.top());
		pq.pop();
	}
	reverse(ans.begin(), ans.end());
	for(int i : ans) cout << i << '\n';
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 68 ms 6732 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 8518 ms 9644 KB Output is correct
2 Correct 8538 ms 9384 KB Output is correct
3 Incorrect 50 ms 6988 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 1121 ms 4340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1121 ms 4340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 68 ms 6732 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 68 ms 6732 KB Output isn't correct
2 Halted 0 ms 0 KB -