Submission #673428

# Submission time Handle Problem Language Result Execution time Memory
673428 2022-12-20T15:24:08 Z rainboy Naan (JOI19_naan) C
29 / 100
37 ms 12036 KB
#include <stdio.h>

#define N	2000
#define M	2000

int main() {
	static int ww[N][M + 1], pp[N][N + 1], qq[N][N + 1], ii[N];
	int n, m, g, g_, g1, i, j, d, tmp;

	scanf("%d%d", &n, &m);
	for (i = 0; i < n; i++)
		for (j = 1; j <= m; j++) {
			scanf("%d", &ww[i][j]);
			ww[i][j] += ww[i][j - 1];
		}
	for (i = 0; i < n; i++) {
		pp[0][0] = 0, qq[0][0] = 1, pp[0][n] = m, qq[0][n] = 1;
		for (g = 1, j = 0; g < n; g++) {
			while (j < m && (long long) ww[i][j + 1] * n < (long long) ww[i][m] * g)
				j++;
			d = ww[i][j + 1] - ww[i][j];
			pp[i][g] = (long long) j * n * d + (long long) ww[i][m] * g - (long long) ww[i][j] * n, qq[i][g] = n * d;
		}
	}
	for (i = 0; i < n; i++)
		ii[i] = i;
	for (g = 0; g + 1 < n; g++) {
		g1 = g;
		for (g_ = g + 1; g_ < n; g_++)
			if ((long long) pp[ii[g1]][g + 1] * qq[ii[g_]][g + 1] > (long long) pp[ii[g_]][g + 1] * qq[ii[g1]][g + 1])
				g1 = g_;
		tmp = ii[g], ii[g] = ii[g1], ii[g1] = tmp;
	}
	for (g = 0; g + 1 < n; g++)
		printf("%d %d\n", pp[ii[g]][g + 1], qq[ii[g]][g + 1]);
	for (g = 0; g < n; g++)
		printf("%d ", ii[g] + 1);
	printf("\n");
	return 0;
}

Compilation message

naan.c: In function 'main':
naan.c:10:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |  scanf("%d%d", &n, &m);
      |  ^~~~~~~~~~~~~~~~~~~~~
naan.c:13:4: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |    scanf("%d", &ww[i][j]);
      |    ^~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 296 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 296 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 2 ms 352 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 2 ms 304 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 304 KB Output is correct
25 Correct 1 ms 308 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 296 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 300 KB Output is correct
23 Correct 1 ms 296 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 296 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 352 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 2 ms 304 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 2 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 2 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 304 KB Output is correct
40 Correct 1 ms 308 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Incorrect 37 ms 12036 KB Integer parameter [name=A_i] equals to -2024391405, violates the range [1, 2000000000000]
44 Halted 0 ms 0 KB -