oj.uz

Submission #825110

# Submission time Handle Problem Language Result Execution time Memory
825110 2023-08-14T14:27:42 Z xink Road Construction (JOI21_road_construction) C++14
5 / 100
 119 ms 24624 KB 
#include <iostream>
#include <vector>
#include <utility>
#include <sstream>
#include <climits>
#include <cstring>
#include <math.h>
#include <algorithm>
#define ll long long
#define ld long double
using namespace std;
const ll mod = 1e9 + 7;
typedef vector<int> vi;
typedef pair<ll, ll> ii;
typedef vector<ii> vii;
const int maxn1 = 2e5 + 5, maxn2 = 1e6 + 6;
ii coor[maxn1];
ll dist[maxn2];

ll get_manhattan_dist(int i, int j)
{
    return abs(coor[i].first - coor[j].first) + abs(coor[i].second - coor[j].second);
}

void solve()
{
    int n, k;
    cin >> n >> k;
    for (int i = 0; i < n; i++)
    {
        cin >> coor[i].first >> coor[i].second;
    }
    int n_road = 0;
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < i; j++)
        {
            dist[n_road++] = get_manhattan_dist(i, j);
        }
    }
    sort(dist, dist + n_road);
    for (int i = 0; i < k; i++)
    {
        cout << dist[i] << "\n";
    }
}

int main()
{
    // freopen("input_text", "r", stdin);
    // freopen("output_text", "w", stdout);
    // ios_base::sync_with_stdio(NULL); cin.tie(0); cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t-- > 0)
        solve();
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 6732 KB Output is correct
2 Correct 53 ms 6804 KB Output is correct
3 Correct 35 ms 4888 KB Output is correct
4 Correct 34 ms 4972 KB Output is correct
5 Correct 49 ms 5664 KB Output is correct
6 Correct 16 ms 4256 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Runtime error 99 ms 6648 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Runtime error 119 ms 6712 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 119 ms 6712 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 6732 KB Output is correct
2 Correct 53 ms 6804 KB Output is correct
3 Correct 35 ms 4888 KB Output is correct
4 Correct 34 ms 4972 KB Output is correct
5 Correct 49 ms 5664 KB Output is correct
6 Correct 16 ms 4256 KB Output is correct
7 Runtime error 72 ms 24624 KB Execution killed with signal 11
8 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 6732 KB Output is correct
2 Correct 53 ms 6804 KB Output is correct
3 Correct 35 ms 4888 KB Output is correct
4 Correct 34 ms 4972 KB Output is correct
5 Correct 49 ms 5664 KB Output is correct
6 Correct 16 ms 4256 KB Output is correct
7 Runtime error 99 ms 6648 KB Execution killed with signal 11
8 Halted 0 ms 0 KB -