oj.uz

Submission #893443

# Submission time Handle Problem Language Result Execution time Memory
893443 2023-12-27T04:59:02 Z abushbandit_1 Road Construction (JOI21_road_construction) C++17
5 / 100
 184 ms 13132 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define pb push_back
#define all(x) x.begin(),x.end()
#define ff first
#define ss second

const long long INF = 1e18;
const int N = 1e5 + 1;

signed main(){
	
	int n;
	cin >> n;
	int k;
	cin >> k;
	int cnt = 0;
	int x[n],y[n];
	for(int i = 0;i < n;i++){
		cin >> x[i] >> y[i];
		if(y[i] == 0){
			cnt++;
		}
	}
	if(cnt == n){
		sort(x,x + n);
		vector<int> v;
		int j = 1,h = k;
		while(k > 0){
			for(int i = 0;i < n - j;i++){
				v.pb(abs(abs(x[i + j]) - abs(x[i])));
				k--;
			}
			j++;
		}
		for(int i = 0;i < n - j;i++){
			v.pb(abs(abs(x[i + j]) - abs(x[i])));
			k--;
		}
		k = h;
		sort(all(v));
		for(int i = 0;i < k;i++){
			cout << v[i] << "\n";	
		}
	} else if(n <= 1000){
		vector<int> v;
		for(int i = 0;i < n;i++){
			for(int j = i + 1;j < n;j++){
				v.pb(abs(x[i] - x[j]) + abs(y[i] - y[j]));
			}
		}
		sort(all(v));
		for(int i = 0;i < k;i++){
			cout << v[i] << "\n";
		}
	} else if(k == 1){
		
	} else if(k <= 10){
		
	} else {
		
	}
		
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 7044 KB Output is correct
2 Correct 54 ms 7024 KB Output is correct
3 Correct 35 ms 5044 KB Output is correct
4 Correct 45 ms 5088 KB Output is correct
5 Correct 51 ms 5816 KB Output is correct
6 Correct 19 ms 5064 KB Output is correct

Subtask #2
0 / 6.0

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

Subtask #3
0 / 7.0

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

Subtask #4
0 / 20.0

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

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 7044 KB Output is correct
2 Correct 54 ms 7024 KB Output is correct
3 Correct 35 ms 5044 KB Output is correct
4 Correct 45 ms 5088 KB Output is correct
5 Correct 51 ms 5816 KB Output is correct
6 Correct 19 ms 5064 KB Output is correct
7 Incorrect 61 ms 1884 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 7044 KB Output is correct
2 Correct 54 ms 7024 KB Output is correct
3 Correct 35 ms 5044 KB Output is correct
4 Correct 45 ms 5088 KB Output is correct
5 Correct 51 ms 5816 KB Output is correct
6 Correct 19 ms 5064 KB Output is correct
7 Incorrect 184 ms 13132 KB Output isn't correct
8 Halted 0 ms 0 KB -