# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1169998 | vibeduck | Topical (NOI23_topical) | C++20 | 1093 ms | 24012 KiB |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define int long long
#define all(x) (x).begin(), (x).end()
typedef long double ld;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;
typedef vector<vector<ll>> vvll;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef map<int, int> mii;
typedef unordered_map<int, int> umii;
const int mod = 1e9 + 7;
const int inf = INTMAX_MAX;
const bool tc = false;
int sub(vi &x, vi &y) {
// x <= y
for (int i = 0; i < x.size(); i++) {
if (x[i] > y[i]) return 0;
}
return 1;
}
void add(vi &x, vi &y) {
for (int i = 0; i < x.size(); i++) x[i] += y[i];
}
inline void solve() {
int n, k;
cin >> n >> k;
vector<pair<vi, vi>> mds(n); vi done(n);
for (int i = 0; i < n; i++) {
for (int _ = 0; _ < k; _++) {
int x; cin >> x;
mds[i].fi.pb(x);
}
}
for (int i = 0; i < n; i++) {
for (int _ = 0; _ < k; _++) {
int x; cin >> x;
mds[i].se.pb(x);
}
}
vi cur(k);
for (int _ = 0; _ < n; _++) {
for (int i = 0; i < n; i++) {
if (done[i]) continue;
if (!sub(mds[i].fi, cur)) continue;
done[i] = 1; add(cur, mds[i].se);
}
}
cout << accumulate(all(done), (int)0) << '\n';
}
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
signed main() {
ios::sync_with_stdio(false);
cout.tie(0);
cin.tie(0);
//setIO();
int t = 1;
if (tc) {
cin >> t;
}
while (t--) {
solve();
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |