Submission #1353188

#	Time	Username	Problem	Language	Result	Execution time	Memory
1353188		retarde	Road Construction (JOI21_road_construction)	C++20	0 / 100	225 ms	8168 KiB

road_construction

#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define int long long
#define all(x) (x).begin(), (x).end()

typedef long double ld;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;
typedef vector<vector<ll>> vvll;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef map<int, int> mii;
typedef unordered_map<int, int> umii;

const int mod = 1e9 + 7;
const int inf = INTMAX_MAX;
const bool tc = false;

int n, k;
mii m; int tot = 0;

void add(int x) {
    m[x]++; tot++;
    // cout << "adding " << x << '\n';
    if (tot > k) {
        // cout << "removing\n";
        m[m.rbegin()->fi]--;
    }
}

inline void solve() {
    cin >> n >> k;
    vi a(n); for (int i = 0; i < n; i++) {
        int x, y; cin >> x >> y;
        a[i] = x; assert(y == 0);
    }
    sort(all(a));

    if (n <= 500) {
        multiset<int> s;
        for (int i = 0; i < n; i++) {
            for (int j = i + 1; j < n; j++) {
                s.insert(abs(a[i] - a[j]));
            }
        }
        for (int i = 0; i < k; i++) {
            cout << *s.begin() << '\n';
            s.erase(s.begin());
        }
        return;
    }

    // atmost 500 closest guys
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j <= min(i+2*(k/n+1), n - 1); j++) {
            add(a[j] - a[i]);
        }
        // for (int j = i - 1; j >= max(i-500, (int)0); j--) {
        //     add(a[i] - a[j]);
        // }
    }

    // cout << (int)m.size() << " " << k << '\n';
    for (auto &x : m) {
        if (k <= x.se) {
            for (int i = 0; i < k; i++) cout << x.fi << '\n';
            return;
        }
        for (int i = 0; i < x.se; i++) cout << x.fi << '\n';
        k -= x.se;
    }
}

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

signed main() {
    ios::sync_with_stdio(false);
    cout.tie(0);
    cin.tie(0);
    //setIO();

    int t = 1;
    if (tc) {
        cin >> t;
    }

    while (t--) {
        solve();
    }
}

Compilation message (stderr)

road_construction.cpp: In function 'void setIO(std::string)':
road_construction.cpp:89:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
road_construction.cpp:90:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   90 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 6
• Subtask 3: 0 / 7
• Subtask 4: 0 / 20
• Subtask 5: 0 / 27
• Subtask 6: 0 / 35