// author : anhtun_hi , nqg
#include <bits/stdc++.h>
#define ll long long
#define ii pair<ll, ll>
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define reset(h, v) memset(h, v, sizeof h)
#define Forv(i, a) for(auto& i : a)
#define For(i, a, b) for(int i = a; i <= b; ++i)
#define Ford(i, a, b) for(int i = a; i >= b; --i)
#define c_bit(i) __builtin_popcountll(i)
#define Bit(mask, i) ((mask >> i) & 1LL)
#define onbit(mask, i) ((mask) bitor (1LL << i))
#define offbit(mask, i) ((mask) &~ (1LL << i))
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
using namespace std;
namespace std {
template <typename T, int D>
struct _vector : public vector <_vector <T, D - 1>> {
static_assert(D >= 1, "Dimension must be positive!");
template <typename... Args>
_vector(int n = 0, Args... args) : vector <_vector <T, D - 1>> (n, _vector <T, D - 1> (args...)) {}
};
template <typename T> struct _vector <T, 1> : public vector <T> {
_vector(int n = 0, const T& val = T()) : vector <T> (n, val) {}
};
template <class A, class B> bool minimize(A &a, B b){return a > b ? a = b, true : false;}
template <class A, class B> bool maximize(A &a, B b){return a < b ? a = b, true : false;}
}
const int dx[] = {0, 0, +1, -1}, dy[] = {-1, +1, 0, 0}, LOG = 20, base = 311, inf = 1e9 + 5;
const int MAXN = 1e6 + 5;
const ll mod = 1e9 + 7;
const ll oo = 1e18;
//#define int long long
int n, k;
vector<vector<ll>> r, u;
namespace sub1{
bool check(){ return n == 1; }
void Solve(){
int ans = 1;
For(i, 1, k) if(r[1][i] > 0) ans &= 0;
cout << (ans == 1) ? 1 : 0 << '\n';
}
}
namespace sub2{
bool check() { return n <= 100 && k <= 100; }
bool del[MAXN];
void Solve(){
vector<int> rate(k + 1);
int ans = 0;
while (true){
bool on = false;
For(i, 1, n) if(!del[i]){
bool ok = true;
For(j, 1, k) ok &= (rate[j] >= r[i][j]);
if(ok) {
++ans;
For(j, 1, k) rate[j] += u[i][j];
on = true;
del[i] = true;
break;
}
}
if (!on) break;
}
cout << ans << '\n';
}
}
namespace sub3{
bool check() {return k == 1;}
ii a[MAXN];
void Solve(){
For(i, 1, n) a[i] = {r[i][1], u[i][1]};
sort(a + 1, a + n + 1);
int ans = 0; ll sum = 0;
For(i, 1, n) {
if (sum >= a[i].fi) ++ ans, sum += a[i].se;
else break;
}
cout << ans << '\n';
}
}
void Solve() {
cin >> n >> k;
r.resize(n + 5, vector<ll>(k + 5));
u.resize(n + 5, vector<ll>(k + 5));
For(i, 1, n) For(j, 1, k) cin >> r[i][j];
For(i, 1, n) For(j, 1, k) cin >> u[i][j];
if(sub1::check()) sub1::Solve();
else if (sub2::check()) sub2::Solve();
else sub3::Solve();
}
signed main() {
cin.tie(0) -> sync_with_stdio(0);
if(fopen("NOI23_topical.inp", "r")) {
freopen("NOI23_topical.inp", "r", stdin);
freopen("NOI23_topical.out", "w", stdout);
}
int t = 1;
// cin >> t;
while(t --) Solve();
return 0;
}
Compilation message
Main.cpp: In function 'void sub1::Solve()':
Main.cpp:46:43: warning: second operand of conditional expression has no effect [-Wunused-value]
46 | cout << (ans == 1) ? 1 : 0 << '\n';
| ^
Main.cpp:46:36: warning: third operand of conditional expression has no effect [-Wunused-value]
46 | cout << (ans == 1) ? 1 : 0 << '\n';
| ~~^~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:104:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
104 | freopen("NOI23_topical.inp", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:105:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
105 | freopen("NOI23_topical.out", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
336 KB |
Output is correct |
| 2 |
Correct |
1 ms |
336 KB |
Output is correct |
| 3 |
Correct |
3 ms |
1360 KB |
Output is correct |
| 4 |
Correct |
162 ms |
113844 KB |
Output is correct |
| 5 |
Correct |
164 ms |
113840 KB |
Output is correct |
| 6 |
Correct |
172 ms |
113812 KB |
Output is correct |
| 7 |
Correct |
143 ms |
107968 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
336 KB |
Output is correct |
| 2 |
Correct |
1 ms |
336 KB |
Output is correct |
| 3 |
Correct |
1 ms |
336 KB |
Output is correct |
| 4 |
Correct |
1 ms |
336 KB |
Output is correct |
| 5 |
Correct |
1 ms |
604 KB |
Output is correct |
| 6 |
Correct |
1 ms |
336 KB |
Output is correct |
| 7 |
Incorrect |
3 ms |
832 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
336 KB |
Output is correct |
| 2 |
Correct |
1 ms |
336 KB |
Output is correct |
| 3 |
Correct |
4 ms |
2384 KB |
Output is correct |
| 4 |
Correct |
36 ms |
20552 KB |
Output is correct |
| 5 |
Correct |
35 ms |
20460 KB |
Output is correct |
| 6 |
Correct |
359 ms |
202948 KB |
Output is correct |
| 7 |
Correct |
386 ms |
201472 KB |
Output is correct |
| 8 |
Correct |
387 ms |
203128 KB |
Output is correct |
| 9 |
Correct |
373 ms |
201548 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
336 KB |
Output is correct |
| 2 |
Correct |
1 ms |
336 KB |
Output is correct |
| 3 |
Correct |
3 ms |
1360 KB |
Output is correct |
| 4 |
Correct |
162 ms |
113844 KB |
Output is correct |
| 5 |
Correct |
164 ms |
113840 KB |
Output is correct |
| 6 |
Correct |
172 ms |
113812 KB |
Output is correct |
| 7 |
Correct |
143 ms |
107968 KB |
Output is correct |
| 8 |
Correct |
1 ms |
336 KB |
Output is correct |
| 9 |
Correct |
1 ms |
336 KB |
Output is correct |
| 10 |
Correct |
1 ms |
336 KB |
Output is correct |
| 11 |
Correct |
1 ms |
336 KB |
Output is correct |
| 12 |
Correct |
1 ms |
604 KB |
Output is correct |
| 13 |
Correct |
1 ms |
336 KB |
Output is correct |
| 14 |
Incorrect |
3 ms |
832 KB |
Output isn't correct |
| 15 |
Halted |
0 ms |
0 KB |
- |
