Submission #851770

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
851770	2023-09-20T14:57:31 Z	lovrot	Poi (IOI09_poi)	C++17	100 / 100	258 ms	20208 KB

poi

#include <cstdio> 
#include <algorithm> 

using namespace std;

const int N = 2010;

int n, m, p, B[N][N];

int SO[N], SC[N], AC[N];
int I[N];

int main() {
	scanf("%d%d%d", &n, &m, &p);
	for(int i = 0; i < n; ++i) 
		for(int j = 0; j < m; ++j) {
			scanf("%d", &B[i][j]);
			SO[j] += B[i][j];
			AC[i] += B[i][j];
		}
	for(int i = 0; i < n; ++i) {
		I[i] = i;
		for(int j = 0; j < m; ++j) SC[i] += B[i][j] * (n - SO[j]);
	}
	sort(I, I + n, [](int a, int b) { 
		return SC[a] > SC[b] || (SC[a] == SC[b] && AC[a] > AC[b]) || (SC[a] == SC[b] && AC[a] == AC[b] && a < b);
	});
	printf("%d ", SC[p - 1]);
	for(int i = 0; i < n; ++i) 
		if(I[i] == p - 1) printf("%d\n", i + 1);
	return 0;
}

Compilation message

poi.cpp: In function 'int main()':
poi.cpp:14:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |  scanf("%d%d%d", &n, &m, &p);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
poi.cpp:17:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |    scanf("%d", &B[i][j]);
      |    ~~~~~^~~~~~~~~~~~~~~~

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 ms	600 KB	Output is correct
7	Correct	1 ms	604 KB	Output is correct
8	Correct	1 ms	604 KB	Output is correct
9	Correct	1 ms	856 KB	Output is correct
10	Correct	3 ms	3164 KB	Output is correct
11	Correct	9 ms	3416 KB	Output is correct
12	Correct	14 ms	5720 KB	Output is correct
13	Correct	45 ms	8352 KB	Output is correct
14	Correct	56 ms	10576 KB	Output is correct
15	Correct	98 ms	13396 KB	Output is correct
16	Correct	106 ms	13392 KB	Output is correct
17	Correct	158 ms	16384 KB	Output is correct
18	Correct	176 ms	16464 KB	Output is correct
19	Correct	236 ms	19796 KB	Output is correct
20	Correct	258 ms	20208 KB	Output is correct