Submission #69282211

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
 
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;
using vs = vector<string>;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define FORR(i, m, n) for (int i = (m); i >= (n); i--)
#define REP(i, n) FOR(i, 0, (n))
#define REPR(i, n) FORR(i, (n) - 1, 0)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define REPS(c, s) for (char c : s)
#define ALL(c) (c).begin(), (c).end()
#define SORT(c) sort(ALL(c))
#define REV(c) reverse(ALL(c))
#define sz(v) (int)v.size()
#define yn(b) cout << (b ? "Yes" : "No") << endl;
#define YN(b) cout << (b ? "YES" : "NO") << endl;
#define INTERACTIVE
#ifndef INTERACTIVE
#define endl '\n'
#endif
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
template<class T> inline void prn(vector<T>& v) {int n = sz(v); REP(i, n) cout << v[i] << ' ';}
template<class T> inline void printv(vector<T>& v) {int n = sz(v); REP(i, n) cout << v[i] << (i == n - 1 ? '\n' : ' ');}
template<class T> inline void printvv(vector<vector<T>>& v) {for (auto u : v) printv(u);}
template<class T> inline void printvm(vector<T>& v) {int n = sz(v); REP(i, n) cout << v[i].val() << (i == n - 1 ? '\n' : ' ');}
template<class T> inline void printvvm(vector<vector<T>>& v) {for (auto u : v) printvm(u);}
template<class T> inline void printlnv(vector<T>& v) {int n = sz(v); REP(i, n) cout << v[i] << '\n';}
// const int MOD = 1000000007;
// const int MOD = 998244353;
// using mint = modint1000000007;
using mint = modint998244353;
const int INF = 1000000001;
const ll LINF = 1000000001000000001LL;
 
void solve();
 
int main() {
#ifndef INTERACTIVE
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
#endif
    cout << fixed << setprecision(numeric_limits<double>::max_digits10);
    solve();
    return 0;
}

vi _r{-1, 0, 1, 0};
vi _c{0, 1, 0, -1};
vi _r8{-1, -1, -1, 0, 1, 1, 1, 0};
vi _c8{-1, 0, 1, 1, 1, 0, -1, -1};

void solve() {
    int n, m;
    ll l, u;
    cin >> n >> m >> l >> u;

    random_device rnd; 
    mt19937_64 mt(rnd());

    ll d = (u - l) / (50 - 1);

    vl a(50);
    REP(i, 50) a[i] = l + (d * (ll)(i - 1));
    a.resize(n);
    // uniform_int_distribution<ll> rand2(50000000000LL, u / 2500);
    // REP(i, n - 50) a[i + 50] = rand2(mt);
    // REP(i, n - 50) a[i + 50] = 96000000000LL + 500000000LL * i;
    REP(i, n - 50) a[i + 50] = (ll)pow(2LL, i % 9 + 29);
    printv(a);

    vl b(m);
    REP(i, m) cin >> b[i];

    vi ans(n, 0);

    REP(i, n) {
        REP(j, m) {
            if (abs(b[j]) > abs(b[j] - a[i])) {
                b[j] -= a[i];
                ans[i] = j + 1;
                break;
            }
        }
    }

    printv(ans);

    ll x = 0;
    for (auto e : b) x += abs(e);
    cerr << (ll)round((20 - log10(1 + x)) * 5 * 10000000) << endl;
}

Submission Info

Judge Result