Submission #432518

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
432518	2021-06-18T10:50:09 Z	rainboy	Poi (IOI09_poi)	C	100 / 100	493 ms	15928 KB

poi

#include <stdio.h>

#define N	2000
#define T	2000

int main() {
	static int aa[N][T], kk[T], ss[N], tt[N];
	int n, t, p, i, j, rank;

	scanf("%d%d%d", &n, &t, &p), p--;
	for (i = 0; i < n; i++)
		for (j = 0; j < t; j++) {
			scanf("%d", &aa[i][j]);
			if (aa[i][j])
				kk[j]++;
		}
	for (i = 0; i < n; i++)
		for (j = 0; j < t; j++)
			if (aa[i][j])
				ss[i] += n - kk[j], tt[i]++;
	rank = 0;
	for (i = 0; i < n; i++)
		if (ss[i] > ss[p] || ss[i] == ss[p] && (tt[i] > tt[p] || tt[i] == tt[p] && i <= p))
			rank++;
	printf("%d %d\n", ss[p], rank);
	return 0;
}

Compilation message

poi.c: In function 'main':
poi.c:23:75: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   23 |   if (ss[i] > ss[p] || ss[i] == ss[p] && (tt[i] > tt[p] || tt[i] == tt[p] && i <= p))
      |                                                            ~~~~~~~~~~~~~~~^~~~~~~~~
poi.c:23:39: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   23 |   if (ss[i] > ss[p] || ss[i] == ss[p] && (tt[i] > tt[p] || tt[i] == tt[p] && i <= p))
      |                        ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
poi.c:10:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |  scanf("%d%d%d", &n, &t, &p), p--;
      |  ^~~~~~~~~~~~~~~~~~~~~~~~~~~
poi.c:13:4: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |    scanf("%d", &aa[i][j]);
      |    ^~~~~~~~~~~~~~~~~~~~~~

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	0 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	460 KB	Output is correct
7	Correct	1 ms	588 KB	Output is correct
8	Correct	1 ms	588 KB	Output is correct
9	Correct	2 ms	716 KB	Output is correct
10	Correct	7 ms	1100 KB	Output is correct
11	Correct	15 ms	1868 KB	Output is correct
12	Correct	25 ms	2960 KB	Output is correct
13	Correct	96 ms	5412 KB	Output is correct
14	Correct	96 ms	7520 KB	Output is correct
15	Correct	169 ms	9668 KB	Output is correct
16	Correct	192 ms	10404 KB	Output is correct
17	Correct	282 ms	11992 KB	Output is correct
18	Correct	331 ms	13484 KB	Output is correct
19	Correct	437 ms	15856 KB	Output is correct
20	Correct	493 ms	15928 KB	Output is correct