oj.uz

Submission #945952

# Submission time Handle Problem Language Result Execution time Memory
945952 2024-03-14T09:02:15 Z hmm789 Road Construction (JOI21_road_construction) C++14
6 / 100
 503 ms 9452 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long 
#define INF 1000000000000000000
#define MOD 1000000007

const int B = 730;

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++) {
			if((int)pq.size() < k) pq.push(x[j]-x[i]);
			else if(x[j]-x[i] < pq.top()) {
				pq.pop();
				pq.push(x[j]-x[i]);
			}
		}
	}
	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 73 ms 6916 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 493 ms 9388 KB Output is correct
2 Correct 503 ms 9388 KB Output is correct
3 Correct 44 ms 6980 KB Output is correct
4 Correct 438 ms 9340 KB Output is correct
5 Correct 402 ms 9452 KB Output is correct
6 Correct 441 ms 9424 KB Output is correct
7 Correct 404 ms 9264 KB Output is correct

Subtask #3
0 / 7.0

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

Subtask #4
0 / 20.0

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

Subtask #5
0 / 27.0

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

Subtask #6
0 / 35.0

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