oj.uz

Submission #682414

# Submission time Handle Problem Language Result Execution time Memory
682414 2023-01-16T08:18:20 Z vjudge1 Road Construction (JOI21_road_construction) C++17
18 / 100
 3074 ms 245340 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/rope>
using namespace __gnu_cxx;

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


typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;

#define precise(a) cout<<fixed<<setprecision(a)
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
// t1
const ll mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353;  // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const ll N = ll(5e5)+10;
const ll K = 17;
const ll inf = 1e18;
const ld eps = 1e-15L;
//const ll B = 316;
ll lcm(ll a, ll b){ return (a / __gcd(a,b)) * b; }
//const ld P = acos(-1.0);

// ll binpow(ll a, ll b, ll m){ ll res=1;a%=m; while(b>0){ if(b&1)res=(res*a)%m; a=(a*a)%m; b/=2; } return res%m;}
ld binpow(ld a, ll b){ ld res=1; while(b>0){ if(b&1)res=(res*a); a=(a*a); b/=2; } return res;}


void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }


void precalc() {
}

ll getdis(ll x1, ll y1, ll x2, ll y2) {
    return abs(x2-x1)+abs(y2-y1);
}

void Baizho()
{   
    ll n, k; cin>>n>>k;
    pll a[n+11];
    bool case2 = 1;
    for(ll i=1; i<=n; i++) {
        cin>>a[i].ff>>a[i].ss;
        if(a[i].ss!=0) case2 = 0;
    }
    sort(a+1, a+n+1);
    set<pair<ll, pll> > st;
    if(n<=1000) {
        vector<ll>vec;
        for(ll i=1; i<=n-1; i++) {
            for(ll j=i+1; j<=n; j++) {
                ll x1 = a[i].ff, y1 = a[i].ss, x2 = a[j].ff, y2 = a[j].ss;
                ll dist = getdis(x1, y1, x2, y2);
                vec.pb(dist);
            }
        }
        sort(all(vec));
        for(ll i=1; i<=k; i++) {
            cout<<vec[i-1]<<"\n";
        }
        return;
    }
    if(case2) {
        for(ll i=1; i<=n-1; i++) {
            for(ll j=i+1; j<=i+1 && j<=n; j++) {
                ll x1 = a[i].ff, y1 = a[i].ss, x2 = a[j].ff, y2 = a[j].ss;
                ll dist = getdis(x1, y1, x2, y2);
                st.insert({dist, {i, j}});
            }
        }
        for(ll i=1; i<=k; i++) {
            pair<ll, pll> get = (*st.begin());
            cout<<get.ff<<"\n";
            st.erase(get);
            if(get.ss.ss!=n) {
                ll x1 = a[get.ss.ff].ff, y1 = a[get.ss.ff].ss, x2 = a[get.ss.ss+1].ff, y2 = a[get.ss.ss+1].ss;
                ll dist = getdis(x1, y1, x2, y2);
                st.insert({dist, {get.ss.ff, get.ss.ss+1}});
            }
        }
        return;
    }
    for(ll i=1; i<=n-1; i++) {
        for(ll j=i+1; j<=i+10 && j<=n; j++) {
            ll x1 = a[i].ff, y1 = a[i].ss, x2 = a[j].ff, y2 = a[j].ss;
            ll dist = getdis(x1, y1, x2, y2);
            st.insert({dist, {i, j}});
        }
    }
    for(ll i=1; i<=k; i++) {
        pair<ll, pll> get = (*st.begin());
        cout<<get.ff<<"\n";
        st.erase(get);
        if(get.ss.ss!=n) {
            for(ll j = get.ss.ss+1; j<=get.ss.ss+10 && j<=n; j++) {
                ll p = get.ss.ff;
                ll x1 = a[p].ff, y1 = a[p].ss, x2 = a[j].ff, y2 = a[j].ss;
                ll dist = getdis(x1, y1, x2, y2);
                st.insert({dist, {i, j}});
            }
        }
    }
    
}

    
int main() {

    // Freopen("div7");
    ios_base::sync_with_stdio(false);   
    cin.tie(0);cout.tie(0); 

    precalc();

    int ttt = 1;
    // cin>>ttt;

    for(int i=1; i<=ttt; i++) { Baizho();}
}

Compilation message

road_construction.cpp: In function 'void Freopen(std::string)':
road_construction.cpp:37:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
road_construction.cpp:37:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 6924 KB Output is correct
2 Correct 59 ms 6940 KB Output is correct
3 Correct 37 ms 5080 KB Output is correct
4 Correct 37 ms 5056 KB Output is correct
5 Correct 62 ms 5780 KB Output is correct
6 Correct 17 ms 4556 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 480 ms 21020 KB Output is correct
2 Correct 439 ms 20972 KB Output is correct
3 Correct 33 ms 4940 KB Output is correct
4 Correct 210 ms 20880 KB Output is correct
5 Correct 222 ms 21056 KB Output is correct
6 Correct 215 ms 21104 KB Output is correct
7 Correct 228 ms 20260 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3074 ms 160756 KB Output is correct
2 Correct 3046 ms 160740 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 115 ms 19824 KB Output is correct
5 Correct 1022 ms 160884 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3074 ms 160756 KB Output is correct
2 Correct 3046 ms 160740 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 115 ms 19824 KB Output is correct
5 Correct 1022 ms 160884 KB Output is correct
6 Correct 3063 ms 160744 KB Output is correct
7 Correct 3030 ms 160868 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Incorrect 2951 ms 160796 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 6924 KB Output is correct
2 Correct 59 ms 6940 KB Output is correct
3 Correct 37 ms 5080 KB Output is correct
4 Correct 37 ms 5056 KB Output is correct
5 Correct 62 ms 5780 KB Output is correct
6 Correct 17 ms 4556 KB Output is correct
7 Runtime error 1834 ms 245340 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 59 ms 6924 KB Output is correct
2 Correct 59 ms 6940 KB Output is correct
3 Correct 37 ms 5080 KB Output is correct
4 Correct 37 ms 5056 KB Output is correct
5 Correct 62 ms 5780 KB Output is correct
6 Correct 17 ms 4556 KB Output is correct
7 Correct 480 ms 21020 KB Output is correct
8 Correct 439 ms 20972 KB Output is correct
9 Correct 33 ms 4940 KB Output is correct
10 Correct 210 ms 20880 KB Output is correct
11 Correct 222 ms 21056 KB Output is correct
12 Correct 215 ms 21104 KB Output is correct
13 Correct 228 ms 20260 KB Output is correct
14 Correct 3074 ms 160756 KB Output is correct
15 Correct 3046 ms 160740 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 115 ms 19824 KB Output is correct
18 Correct 1022 ms 160884 KB Output is correct
19 Correct 3063 ms 160744 KB Output is correct
20 Correct 3030 ms 160868 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Incorrect 2951 ms 160796 KB Output isn't correct
24 Halted 0 ms 0 KB -