oj.uz

답안 #682479

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
682479 2023-01-16T09:26:58 Z vjudge1 Road Construction (JOI21_road_construction) C++17
5 / 100
 10000 ms 19768 KB 
#include "bits/stdc++.h"
using namespace std;

// #define ORD_SET
// #define ROPE
#ifdef ORD_SET
    #include <ext/pb_ds/assoc_container.hpp>
    #include <ext/pb_ds/tree_policy.hpp>
    using namespace __gnu_pbds;
    template<typename T>
    using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#endif
#ifdef ROPE
    #include <ext/rope>
    using namespace __gnu_cxx;
#endif        

// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")

using ll = long long;
using ld = long double;
#define pb push_back
#define ff first
#define ss second
#define sz(x) (ll)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
// #define ll int
void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
void NotInteractive() { ios_base::sync_with_stdio(false); cin.tie(NULL); }
void pre(ll a) { cout<<fixed<<setprecision(a); }
ll bit(ll x) { return __builtin_popcountll(x); }
ll binpow(ll x, ll y, ll z) { ll pow = 1; while(y) { if(y&1) pow *= x, pow %= z; x *= x, x %= z; y >>= 1; } return pow; }
template<typename T> T gcd(T a, T b) { if(b==0) return a; return gcd(b, a%b); }
template<typename T> T lcm(T a, T b) { return a/gcd(a, b)*b; }
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

struct sn { ll l, r, x; }; // a.swap(b)
ll B = 316;
const ll mod = (ll)1e9+7;
const ll inf = (ll)1e18+7;
const ll MX = LLONG_MAX;
const ll MN = LLONG_MIN;
const ld P = acos(-1.0);
const ll N = (ll)3e5+5;
ll x[N], y[N];

void kigash() {
    ll n, k;
    cin>>n>>k;
    vector<pair<ll, ll>> v;
    for(ll i=1; i<=n; i++) cin>>x[i]>>y[i], v.pb({x[i], y[i]});
    sort(all(v));
    multiset<ll> ans;
    for(ll i=0; i<n; i++) {
        ll cnt = (ll)500000000/n;
        for(ll j=i+1; j<n && cnt; j++) {
            if(sz(ans)<k) ans.insert(abs(v[i].ff-v[j].ff)+abs(v[i].ss-v[j].ss));
            else if(*ans.rbegin()>abs(v[i].ff-v[j].ff)+abs(v[i].ss-v[j].ss)) ans.erase(prev(ans.end())), ans.insert(abs(v[i].ff-v[j].ff)+abs(v[i].ss-v[j].ss)), cnt--;
        }
    }
    for(auto to: ans) cout<<to<<"\n";
    return;
}

signed main(/**/) {
    // freopen("");
    NotInteractive();
    // precalc();
    
    ll tt = 1;
    // cin>>tt;
    for(ll i=1; i<=tt; i++) kigash();
    
    exit(0);
}

Compilation message

road_construction.cpp: In function 'void freopen(std::string)':
road_construction.cpp:31:33: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 | void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
      |                          ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
road_construction.cpp:31:75: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 | 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 257 ms 14652 KB Output is correct
2 Correct 252 ms 14780 KB Output is correct
3 Correct 121 ms 14632 KB Output is correct
4 Correct 142 ms 14680 KB Output is correct
5 Correct 188 ms 13500 KB Output is correct
6 Correct 6 ms 468 KB Output is correct

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 10016 ms 19768 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 10099 ms 8252 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 10099 ms 8252 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 257 ms 14652 KB Output is correct
2 Correct 252 ms 14780 KB Output is correct
3 Correct 121 ms 14632 KB Output is correct
4 Correct 142 ms 14680 KB Output is correct
5 Correct 188 ms 13500 KB Output is correct
6 Correct 6 ms 468 KB Output is correct
7 Execution timed out 10084 ms 15124 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 257 ms 14652 KB Output is correct
2 Correct 252 ms 14780 KB Output is correct
3 Correct 121 ms 14632 KB Output is correct
4 Correct 142 ms 14680 KB Output is correct
5 Correct 188 ms 13500 KB Output is correct
6 Correct 6 ms 468 KB Output is correct
7 Execution timed out 10016 ms 19768 KB Time limit exceeded
8 Halted 0 ms 0 KB -