oj.uz

Submission #929226

# Submission time Handle Problem Language Result Execution time Memory
929226 2024-02-18T02:33:54 Z ono_de206 Topical (NOI23_topical) C++14
100 / 100
 404 ms 138060 KB 
#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.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 1012 KB Output is correct
4 Correct 127 ms 47176 KB Output is correct
5 Correct 150 ms 47112 KB Output is correct
6 Correct 130 ms 47132 KB Output is correct
7 Correct 143 ms 72616 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 452 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 2 ms 600 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 4 ms 1884 KB Output is correct
4 Correct 33 ms 14032 KB Output is correct
5 Correct 30 ms 13776 KB Output is correct
6 Correct 404 ms 138060 KB Output is correct
7 Correct 365 ms 135236 KB Output is correct
8 Correct 392 ms 138028 KB Output is correct
9 Correct 368 ms 135900 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 1012 KB Output is correct
4 Correct 127 ms 47176 KB Output is correct
5 Correct 150 ms 47112 KB Output is correct
6 Correct 130 ms 47132 KB Output is correct
7 Correct 143 ms 72616 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 452 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 600 KB Output is correct
16 Correct 2 ms 600 KB Output is correct
17 Correct 2 ms 600 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 4 ms 1884 KB Output is correct
23 Correct 33 ms 14032 KB Output is correct
24 Correct 30 ms 13776 KB Output is correct
25 Correct 404 ms 138060 KB Output is correct
26 Correct 365 ms 135236 KB Output is correct
27 Correct 392 ms 138028 KB Output is correct
28 Correct 368 ms 135900 KB Output is correct
29 Correct 240 ms 36692 KB Output is correct
30 Correct 208 ms 33560 KB Output is correct
31 Correct 247 ms 38284 KB Output is correct
32 Correct 137 ms 25820 KB Output is correct
33 Correct 164 ms 26708 KB Output is correct
34 Correct 205 ms 29788 KB Output is correct
35 Correct 225 ms 34544 KB Output is correct
36 Correct 202 ms 33364 KB Output is correct
37 Correct 222 ms 35492 KB Output is correct
38 Correct 98 ms 22428 KB Output is correct