oj.uz

답안 #682463

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
682463 2023-01-16T09:12:59 Z vjudge1 Road Construction (JOI21_road_construction) C++17
6 / 100
 3377 ms 20164 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 int 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;

bool chk(ll x) {
	ll cnt = 0;
	for (int i = 1;i < n;i++) {
		if (p[i + 1] - p[i] > x) continue;
		ll pos = upper_bound(p + 1 + i, p + n + 1, x + p[i]) - p;
		pos--;
		if (p[pos] - p[i] > x) continue;
		//cout << pos << sp << i << en;
		cnt += pos - i;
	}
	return (cnt >= 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 + 2000, 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:54:21: warning: overflow in conversion from 'double' to 'll' {aka 'int'} changes value from '1.0e+18' to '2147483647' [-Woverflow]
   54 | const ll inf = 1e18 + 7;
      |                ~~~~~^~~
road_construction.cpp: In function 'void solve()':
road_construction.cpp:86:14: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'int'} [-Wsign-compare]
   86 |    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
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 269 ms 14628 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3201 ms 17144 KB Output is correct
2 Correct 3377 ms 17136 KB Output is correct
3 Correct 104 ms 14540 KB Output is correct
4 Correct 3064 ms 16904 KB Output is correct
5 Correct 2679 ms 20068 KB Output is correct
6 Correct 2652 ms 20164 KB Output is correct
7 Correct 2749 ms 19520 KB Output is correct

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1812 ms 4288 KB Output is correct
2 Correct 1723 ms 4288 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1812 ms 4288 KB Output is correct
2 Correct 1723 ms 4288 KB Output is correct
3 Incorrect 0 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 269 ms 14628 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 269 ms 14628 KB Output isn't correct
2 Halted 0 ms 0 KB -