oj.uz

답안 #682472

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
682472 2023-01-16T09:18:26 Z vjudge1 Road Construction (JOI21_road_construction) C++17
100 / 100
 3625 ms 26904 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#pragma GCC optimization("g", on)
#pragma GCC optimization("03")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse,-fgcse-lm")
#pragma GCC optimize("-ftree-pre,-ftree-vrp")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")

#define aboba ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define br break;
#define sp " "
#define en "\n"
#define pb push_back
#define sz size()
#define bg begin()
#define ed end()
#define in insert
#define ss second
#define ff first
#define rbg rbegin()
#define setp(a) cout << fixed; cout << setprecision(a);
#define all(v) v.begin(), v.end()
 
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef double db;
typedef tree<
    long long,
    null_type,
    less_equal<long long>,
    rb_tree_tag,
    tree_order_statistics_node_update> orset;

void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
ll bp(ll x, ll y, ll z) { ll res = 1; while (y) { if (y & 1) { res = (res * x) % z; y--; } x = (x * x) % z; y >>= 1; } return res; }
// C(n, k) = ((fact[n] * bp(fact[k], mod - 2)) % mod * bp(fact[n - k], mod - 2)) % mod;
ll lcm(ll a, ll b) { return (a / __gcd(a, b)) * b; }

const ll N = 3e5 + 11;
const ll inf = 1e18 + 7;
ll tt = 1;
ll x[N], y[N], p[N];
vector<pll> v;
ll n, k;

void solve() {
	cin >> n >> k;
    vector<ll> ans;
    v.pb({-inf, -inf});
    for (int i = 1;i <= n;i++) {
    	cin >> x[i] >> y[i];
    	v.pb({x[i], y[i]});
	}
	sort(v.bg, v.ed);
	multiset<ll> st;
	for (int i = 1;i < n;i++) {
		for (int j = i + 1;j <= min(i + 2000ll, n);j++) {
			ll h = (abs(v[i].ff - v[j].ff) + abs(v[i].ss - v[j].ss));
			if (st.sz < k) {
				st.insert(abs(v[i].ff - v[j].ff) + abs(v[i].ss - v[j].ss));
			} else {
				if (*(st.rbg) <= h) continue;
				else {
					st.erase(st.find(*(st.rbg)));
					st.insert(h);
				}
			}
		}
	}
	auto to = st.bg;
	for (int i = 0;i < k;i++) cout << *(to++) << en;
}

int main() {    
    aboba  
    //freopen("numbers");
    //cin >> tt;
    for (int i = 1;i <= tt;i++) {
        solve();
    }
}

Compilation message

road_construction.cpp:7: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    7 | #pragma GCC optimization("g", on)
      | 
road_construction.cpp:8: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    8 | #pragma GCC optimization("03")
      | 
road_construction.cpp:9: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    9 | #pragma comment(linker, "/stack:200000000")
      | 
road_construction.cpp: In function 'void solve()':
road_construction.cpp:73:14: warning: comparison of integer expressions of different signedness: 'std::multiset<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   73 |    if (st.sz < k) {
      |        ~~~~~~^~~
road_construction.cpp: In function 'void freopen(std::string)':
road_construction.cpp:48:33: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 | void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
      |                          ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
road_construction.cpp:48:75: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 | void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
      |                                                                    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 348 ms 14584 KB Output is correct
2 Correct 340 ms 14620 KB Output is correct
3 Correct 151 ms 14744 KB Output is correct
4 Correct 134 ms 14672 KB Output is correct
5 Correct 229 ms 13608 KB Output is correct
6 Correct 4 ms 496 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3184 ms 24076 KB Output is correct
2 Correct 3625 ms 24080 KB Output is correct
3 Correct 99 ms 14640 KB Output is correct
4 Correct 3019 ms 23896 KB Output is correct
5 Correct 2635 ms 23980 KB Output is correct
6 Correct 2632 ms 24096 KB Output is correct
7 Correct 2696 ms 23428 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1726 ms 13112 KB Output is correct
2 Correct 1702 ms 13428 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1794 ms 11128 KB Output is correct
5 Correct 1693 ms 13536 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1726 ms 13112 KB Output is correct
2 Correct 1702 ms 13428 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1794 ms 11128 KB Output is correct
5 Correct 1693 ms 13536 KB Output is correct
6 Correct 1715 ms 12588 KB Output is correct
7 Correct 1762 ms 12500 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1704 ms 12576 KB Output is correct
11 Correct 1683 ms 11196 KB Output is correct
12 Correct 1751 ms 12620 KB Output is correct

Subtask #5
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 348 ms 14584 KB Output is correct
2 Correct 340 ms 14620 KB Output is correct
3 Correct 151 ms 14744 KB Output is correct
4 Correct 134 ms 14672 KB Output is correct
5 Correct 229 ms 13608 KB Output is correct
6 Correct 4 ms 496 KB Output is correct
7 Correct 2242 ms 19208 KB Output is correct
8 Correct 2303 ms 19164 KB Output is correct
9 Correct 161 ms 14684 KB Output is correct
10 Correct 2213 ms 18516 KB Output is correct
11 Correct 2710 ms 18392 KB Output is correct
12 Correct 1400 ms 19136 KB Output is correct
13 Correct 1569 ms 17732 KB Output is correct

Subtask #6
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 348 ms 14584 KB Output is correct
2 Correct 340 ms 14620 KB Output is correct
3 Correct 151 ms 14744 KB Output is correct
4 Correct 134 ms 14672 KB Output is correct
5 Correct 229 ms 13608 KB Output is correct
6 Correct 4 ms 496 KB Output is correct
7 Correct 3184 ms 24076 KB Output is correct
8 Correct 3625 ms 24080 KB Output is correct
9 Correct 99 ms 14640 KB Output is correct
10 Correct 3019 ms 23896 KB Output is correct
11 Correct 2635 ms 23980 KB Output is correct
12 Correct 2632 ms 24096 KB Output is correct
13 Correct 2696 ms 23428 KB Output is correct
14 Correct 1726 ms 13112 KB Output is correct
15 Correct 1702 ms 13428 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1794 ms 11128 KB Output is correct
18 Correct 1693 ms 13536 KB Output is correct
19 Correct 1715 ms 12588 KB Output is correct
20 Correct 1762 ms 12500 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1704 ms 12576 KB Output is correct
24 Correct 1683 ms 11196 KB Output is correct
25 Correct 1751 ms 12620 KB Output is correct
26 Correct 2242 ms 19208 KB Output is correct
27 Correct 2303 ms 19164 KB Output is correct
28 Correct 161 ms 14684 KB Output is correct
29 Correct 2213 ms 18516 KB Output is correct
30 Correct 2710 ms 18392 KB Output is correct
31 Correct 1400 ms 19136 KB Output is correct
32 Correct 1569 ms 17732 KB Output is correct
33 Correct 3326 ms 26896 KB Output is correct
34 Correct 3213 ms 26896 KB Output is correct
35 Correct 3429 ms 26156 KB Output is correct
36 Correct 2348 ms 26904 KB Output is correct
37 Correct 2683 ms 26892 KB Output is correct
38 Correct 2674 ms 25688 KB Output is correct