oj.uz

Submission #933081

# Submission time Handle Problem Language Result Execution time Memory
933081 2024-02-25T01:26:32 Z Jasonwei08 Topical (NOI23_topical) C++17
100 / 100
 324 ms 176320 KB 
#include <bits/stdc++.h>
#define int long long
#define re(a, b, c, d) for (auto a = b; a <= c; a += d)
#define de(a, b, c, d) for (auto a = b; a >= c; a -= d)
#define ms (a); memset (a, 0, sizeof a);
#define imax INT_MAX
#define imin INT_MIN
#define wh(a) while (a --)
#define PII pair <int, int>
#define F first
#define S second
#define pb push_back
#define eb emplace_back
template <typename T> bool chkmin (T &a, T b) {
	return (b < a) ? a = b, 1 : 0;
}
template <typename T> bool chkmax (T &a, T b) {
	return (b > a) ? a = b, 1 : 0;
}
using namespace std;
const int N = 1e6 + 5;
int T, n, k, c[N], d[N], f[N];
vector <PII> g[N];
signed main () {
	cout << fixed << setprecision (0);
	ios :: sync_with_stdio (0), cin.tie (0), cout.tie (0);
	cin >> n >> k;
	int a[n + 5][k + 5], b[n + 5][k + 5];
	memset (a, 0, sizeof a);
	memset (b, 0, sizeof b);
	re (i, 1, n, 1) re (j, 1, k, 1) cin >> a[i][j], g[j].pb ({a[i][j], i});
	re (i, 1, n, 1) re (j, 1, k, 1) cin >> b[i][j];
	re (i, 1, k, 1)sort (g[i].begin(), g[i].end());
	int res = 0;
	while (1) {
		int fl = 0;
		re (i, 1, k, 1) {
			while (1) {
				if (c[i] >= n || f[i] < g[i][c[i]].F) break;
				int h = g[i][c[i]].S;
				d[h]++;
				if (d[h] == k) {
					re (j, 1, k, 1)	f[j] += b[h][j];
					fl = 1;
					res++;
				}
				c[i]++;
			}
		}
		if (! fl) break;
	}
	cout << res;
	return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 25176 KB Output is correct
2 Correct 7 ms 25176 KB Output is correct
3 Correct 8 ms 26460 KB Output is correct
4 Correct 233 ms 175628 KB Output is correct
5 Correct 232 ms 176288 KB Output is correct
6 Correct 233 ms 176320 KB Output is correct
7 Correct 193 ms 156344 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 25180 KB Output is correct
2 Correct 6 ms 25180 KB Output is correct
3 Correct 6 ms 25180 KB Output is correct
4 Correct 6 ms 25180 KB Output is correct
5 Correct 6 ms 25212 KB Output is correct
6 Correct 7 ms 25228 KB Output is correct
7 Correct 8 ms 25436 KB Output is correct
8 Correct 8 ms 25484 KB Output is correct
9 Correct 7 ms 25436 KB Output is correct
10 Correct 8 ms 25436 KB Output is correct
11 Correct 8 ms 25432 KB Output is correct
12 Correct 8 ms 25436 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 25176 KB Output is correct
2 Correct 6 ms 25224 KB Output is correct
3 Correct 9 ms 26592 KB Output is correct
4 Correct 42 ms 37076 KB Output is correct
5 Correct 33 ms 37268 KB Output is correct
6 Correct 316 ms 142656 KB Output is correct
7 Correct 298 ms 156080 KB Output is correct
8 Correct 324 ms 157752 KB Output is correct
9 Correct 298 ms 156516 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 25176 KB Output is correct
2 Correct 7 ms 25176 KB Output is correct
3 Correct 8 ms 26460 KB Output is correct
4 Correct 233 ms 175628 KB Output is correct
5 Correct 232 ms 176288 KB Output is correct
6 Correct 233 ms 176320 KB Output is correct
7 Correct 193 ms 156344 KB Output is correct
8 Correct 6 ms 25180 KB Output is correct
9 Correct 6 ms 25180 KB Output is correct
10 Correct 6 ms 25180 KB Output is correct
11 Correct 6 ms 25180 KB Output is correct
12 Correct 6 ms 25212 KB Output is correct
13 Correct 7 ms 25228 KB Output is correct
14 Correct 8 ms 25436 KB Output is correct
15 Correct 8 ms 25484 KB Output is correct
16 Correct 7 ms 25436 KB Output is correct
17 Correct 8 ms 25436 KB Output is correct
18 Correct 8 ms 25432 KB Output is correct
19 Correct 8 ms 25436 KB Output is correct
20 Correct 6 ms 25176 KB Output is correct
21 Correct 6 ms 25224 KB Output is correct
22 Correct 9 ms 26592 KB Output is correct
23 Correct 42 ms 37076 KB Output is correct
24 Correct 33 ms 37268 KB Output is correct
25 Correct 316 ms 142656 KB Output is correct
26 Correct 298 ms 156080 KB Output is correct
27 Correct 324 ms 157752 KB Output is correct
28 Correct 298 ms 156516 KB Output is correct
29 Correct 235 ms 80212 KB Output is correct
30 Correct 230 ms 74504 KB Output is correct
31 Correct 260 ms 80568 KB Output is correct
32 Correct 199 ms 70912 KB Output is correct
33 Correct 187 ms 67156 KB Output is correct
34 Correct 212 ms 70396 KB Output is correct
35 Correct 245 ms 77136 KB Output is correct
36 Correct 206 ms 73400 KB Output is correct
37 Correct 226 ms 76032 KB Output is correct
38 Correct 172 ms 69616 KB Output is correct