Submission #1287979

#	Time	Username	Problem	Language	Result	Execution time	Memory
1287979		vahagng	Topical (NOI23_topical)	C++20	12 / 100	119 ms	39604 KiB

Main

//----------vahagng----------//
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;

// template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif

void print(long long t) { cerr << t; }
void print(int t) { cerr << t; }
void print(string t) { cerr << t; }
void print(char t) { cerr << t; }
void print(double t) { cerr << t; }
void print(long double t) { cerr << t; }
void print(unsigned long long t) { cerr << t; }

template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[], V n) { cerr << "["; for (int i = 0; i < n; i++) { cerr << v[i] << " "; } cerr << "]"; }
template <class T, class V> void print(pair <T, V> p) { cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}"; }
template <class T> void print(vector <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(set <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(multiset <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T, class V> void print(map <T, V> v) { cerr << "[ "; for (auto i : v) { print(i); cerr << " "; } cerr << "]"; }

#define ll long long
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define ld long double
#define sz(v) v.size()
#define endl '\n'

const ll inf = 2e18, mod = 1e9 + 7, mod2 = 998244353;

void SetIO(string str = "") {
    if (str != "") {
        freopen((str + ".in").c_str(), "r", stdin);
        freopen((str + ".out").c_str(), "w", stdout);
    }
    else {
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    }
}

void FastIO() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
}

const int N = 1e6 + 10, M = 1e7 + 10;

mt19937 rnd(chrono::system_clock::now().time_since_epoch().count());

ll binpow(ll a, ll b) {
    ll res = 1;
    while (b) {
        if (b & 1) {
            res = (res * a) % mod;
        }
        b >>= 1;
        a = (a * a) % mod;
    }
    return res;
}

ll n, p[N], k, A[N], B[N], ord[N];

void solve(int tc) {
    cin >> n >> k;
    vector<vector<ll>>a(n+1, vector<ll>(k+1));
    vector<vector<ll>>b(n+1, vector<ll>(k+1));
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= k; j++){
            cin >> a[i][j];
        }
    }
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= k; j++){
            cin >> b[i][j];
        }
    }
    if(n == 1){
        if(*max_element(a[1].begin() + 1, a[1].end()) == 0){
            cout << 1 << endl;
            return;
        }
        cout << 0 << endl;
        return;
    }
    if(k == 1){
        for(int i = 1; i <= n; i++){
            A[i] = a[i][1];
            ord[i] = i;
        }
        for(int i = 1; i <= n; i++){
            B[i] = b[i][1];
        }
        sort(ord + 1, ord + n + 1, [](int i, int j){
            if(A[i] == A[j]){
                return B[i] > B[j];
            }
            return A[i] < A[j];
        });
        ll ans = 0;
        for(int i = 1; i <= n; i++){
            if(p[1] >= A[i]) ans++, p[1] += B[i];
            else continue;
        }
        cout << ans << endl;
    }
    ll ans = 0;
    queue<int>q;
    set<int>st;
    for(int i = 1; i <= n; i++){
        bool flag = 1;
        for(int j = 1; j <= k; j++){
            flag &= (a[i][j] == 0);
        }
        if(flag) q.push(i);
        else st.insert(i);
    }
    while(!q.empty()){
        auto i = q.front();
        q.pop();
        ans++;
        for(int j = 1; j <= k; j++){
            p[j] += b[i][j];
        }
        vector<int>del;
        for(auto j : st){
            bool flag = 1;
            for(int z = 1; z <= k; z++){
                flag &= (p[z] >= a[j][z]);
            }
            if(flag) del.push_back(j), q.push(j);
        }
        for(auto j : del) st.erase(j);
    }
    cout << ans << endl;
}


void precalc() {
    
}

int main() {
    // SetIO("teamwork");
    FastIO();
    int test_case = 1;
    // cin >> test_case;
    precalc();
    int cnt = 1;
    while (test_case--) {
        solve(cnt++);
    }
    return 0;
}

Compilation message (stderr)

Main.cpp: In function 'void SetIO(std::string)':
Main.cpp:47:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |         freopen((str + ".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:48:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |         freopen((str + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:51:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |         freopen("input.txt", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:52:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |         freopen("output.txt", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

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