Submission #929226

#	Time	Username	Problem	Language	Result	Execution time	Memory
929226		ono_de206	Topical (NOI23_topical)	C++14	100 / 100	404 ms	138060 KiB

Main

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

#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second

// #define int long long

typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
// typedef pair<int, int> P;

template<typename T, typename U>
ostream & operator << (ostream &out, const pair<T, U> &c) {
	out << c.first << ' ' << c.second;
	return out;
}

template<typename T>
ostream & operator << (ostream &out, vector<T> &v) {
	const int sz = v.size();
	for (int i = 0; i < sz; i++) {
		if (i) out << ' ';
		out << v[i];
	}
	return out;
}

template<typename T>
istream & operator >> (istream &in, vector<T> &v) {
	for (T &x : v) in >> x;
	return in;
}

template<typename T, typename U>
	istream & operator >> (istream &in, pair<T, U> &c) {
	in >> c.first;
	in >> c.second;
	return in;
}

template<typename T>
void mxx(T &a, T b){if(b > a) a = b;}
template<typename T>
void mnn(T &a, T b){if(b < a) a = b;}

const int mxn = 1e6 + 10, MXLOG = 22, mod = 1e9 + 7, P = 1181, D = 1523, N = 2500;
const long long inf = 2e18 + 10;

void go() {
	int n, m;
	cin >> n >> m;
	vector<vector<int>> a(n, vector<int>(m)), b(n, vector<int>(m));
	vector<vector<pair<int, int>>> g(m);
	vector<int> sum(m), cnt(n);
	for(int i = 0; i < n; i++) {
		for(int j = 0; j < m; j++) {
			cin >> a[i][j];
			if(a[i][j] == 0) cnt[i]++;
			else g[j].eb(a[i][j], i);
		}
	}
	for(int j = 0; j < m; j++) {
		sort(g[j].rbegin(), g[j].rend());
	}
	for(int i = 0; i < n; i++) {
		for(int j = 0; j < m; j++) {
			cin >> b[i][j];
		}
	}
	queue<int> q;
	for(int i = 0; i < n; i++) {
		if(cnt[i] == m) q.push(i);
	}
	int ans = 0;
	while(q.size()) {
		int x = q.front();
		q.pop();
		ans++;
		for(int j = 0; j < m; j++) {
			sum[j] += b[x][j];
			while(g[j].size() && g[j].back().ff <= sum[j]) {
				int my = g[j].back().ss;
				cnt[my]++;
				if(cnt[my] == m) q.push(my);
				g[j].pop_back();
			}
		}
	}
	cout << ans << endl;
}

signed main() {
	fast;
	int t = 1;
	// cin >> t;
	while(t--) {
		go();
	}
	return 0;
}

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