Submission #682249

# Submission time Handle Problem Language Result Execution time Memory
682249 2023-01-16T05:14:30 Z vjudge1 Road Construction (JOI21_road_construction) C++17
0 / 100
57 ms 6116 KB
#include <bits/stdc++.h>
#define all(a) sort(a.begin(), a.end())
#define allr(a) reverse(a.begin(), a.end())
#define rall(a) sort(a.rbegin(), a.rend())
#define ll long long
#define pb push_back
#define pob pop_back
#define ff first
#define ss second
#define mk make_pair
using namespace std;
const ll N = 1e8 + 55;
ll x[N], y[N];
int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	ll n, K;
	cin >> n >> K;
	for(ll i = 0; i < n; i++){
		cin >> x[i] >> y[i];
	}
	ll cost = 0;
	for(ll i = 1; i <= n; i++){
		for(ll j = 0; j < n; j++){
			cost = abs(x[i] - x[j]) + abs(y[i] + y[j]);
			for(ll k = 0; k < K; k++){
				cout << min(K, cost) << '\n';
			}
			return 0;
		}
	}
}
# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 2124 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 57 ms 6116 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 52 ms 4120 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 52 ms 4120 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 2124 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 2124 KB Output isn't correct
2 Halted 0 ms 0 KB -