Submission #850738

#	Time	Username	Problem	Language	Result	Execution time	Memory
850738		Forested	Topical (NOI23_topical)	C++17	100 / 100	654 ms	134668 KiB

Main

#ifndef LOCAL
#define FAST_IO
#endif

// ============
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define OVERRIDE(a, b, c, d, ...) d
#define REP2(i, n) for (i32 i = 0; i < (i32)(n); ++i)
#define REP3(i, m, n) for (i32 i = (i32)(m); i < (i32)(n); ++i)
#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define PER(i, n) for (i32 i = (i32)(n) - 1; i >= 0; --i)
#define ALL(x) begin(x), end(x)

using namespace std;

using u32 = unsigned int;
using u64 = unsigned long long;
using i32 = signed int;
using i64 = signed long long;
using f64 = double;
using f80 = long double;

template <typename T>
using Vec = vector<T>;

template <typename T>
bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T>
bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

#ifdef INT128

using u128 = __uint128_t;
using i128 = __int128_t;

istream &operator>>(istream &is, i128 &x) {
    i64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, i128 x) {
    os << (i64)x;
    return os;
}
istream &operator>>(istream &is, u128 &x) {
    u64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, u128 x) {
    os << (u64)x;
    return os;
}

#endif

[[maybe_unused]] constexpr i32 INF = 1000000100;
[[maybe_unused]] constexpr i64 INF64 = 3000000000000000100;
struct SetUpIO {
    SetUpIO() {
#ifdef FAST_IO
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
#endif
        cout << fixed << setprecision(15);
    }
} set_up_io;
// ============

#ifdef DEBUGF
#else
#define DBG(x) (void)0
#endif

int main() {
    i32 n, k;
    cin >> n >> k;
    Vec<Vec<i64>> r(n, Vec<i64>(k));
    REP(i, n) REP(j, k) {
        cin >> r[i][j];
    }
    Vec<Vec<i64>> v(n, Vec<i64>(k));
    REP(i, n) REP(j, k) {
        cin >> v[i][j];
    }
    Vec<Vec<i32>> idx(k, Vec<i32>(n));
    REP(i, k) {
        iota(ALL(idx[i]), 0);
        sort(ALL(idx[i]), [&](i32 x, i32 y) -> bool {
            return r[x][i] < r[y][i];
        });
    }
    DBG(idx);
    Vec<i32> it(k, 0);
    Vec<i32> cnt(n, 0);
    Vec<i64> p(k, 0);
    queue<i32> que;
    REP(i, k) {
        while (it[i] < n && r[idx[i][it[i]]][i] <= p[i]) {
            if (++cnt[idx[i][it[i]]] == k) {
                que.push(idx[i][it[i]]);
            }
            ++it[i];
        }
    }
    i32 ans = 0;
    while (!que.empty()) {
        ++ans;
        i32 t = que.front();
        que.pop();
        REP(i, k) {
            p[i] += v[t][i];
        }
        REP(i, k) {
            while (it[i] < n && r[idx[i][it[i]]][i] <= p[i]) {
                if (++cnt[idx[i][it[i]]] == k) {
                    que.push(idx[i][it[i]]);
                }
                ++it[i];
            }
        }
    }
    cout << ans << '\n';
}

• Subtask 1: 12 / 12
• Subtask 2: 28 / 28
• Subtask 3: 21 / 21
• Subtask 4: 39 / 39