Submission #922661

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
922661	2024-02-05T22:03:28 Z	perohero	Poi (IOI09_poi)	C++17	100 / 100	203 ms	19284 KB

poi

#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>

using namespace std;
template<typename T1, typename T2> inline void chkmin(T1 &a, T2 b) {if (a > b) a = b;}
template<typename T1, typename T2> inline void chkmax(T1 &a, T2 b) {if (a < b) a = b;}
#define files(FILENAME) read(FILENAME); write(FILENAME)
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define all(c) (c).begin(), (c).end()
#define sz(c) (int)(c).size()
#define left left228
#define right right228
#define y1 y1228
#define mp make_pair
#define pb push_back
#define y2 y2228
#define rank rank228
using ll = long long;
using ld = long double;
const string FILENAME = "input";
const int MAXN = 2228;

int n, t, k;
int a[MAXN][MAXN];
int score[MAXN], b[MAXN], cnt[MAXN];

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	//read(FILENAME);
	cin >> n >> t >> k;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= t; j++) {
			cin >> a[i][j];
			score[j] += (a[i][j] == 0);
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= t; j++) {
			if (a[i][j] == 1) {
				b[i] += score[j];
				cnt[i]++;
			}
		}
	}
	cout << b[k] << ' ';
	int place = 0;
	for (int i = 1; i <= n; i++) {
		if (i == k) {
			continue;
		}
		if (b[i] > b[k]) {
			place++;
			continue;
		}
		if (b[i] == b[k] && cnt[i] > cnt[k]) {
			place++;
			continue;
		}
		if (b[i] == b[k] && cnt[i] == cnt[k] && i < k) {
			place++;
		}
	}
	cout << place + 1 << '\n';
	return 0;
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	348 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	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2648 KB	Output is correct
10	Correct	2 ms	2392 KB	Output is correct
11	Correct	6 ms	4444 KB	Output is correct
12	Correct	10 ms	6716 KB	Output is correct
13	Correct	28 ms	6744 KB	Output is correct
14	Correct	50 ms	10832 KB	Output is correct
15	Correct	77 ms	12884 KB	Output is correct
16	Correct	75 ms	12880 KB	Output is correct
17	Correct	110 ms	14928 KB	Output is correct
18	Correct	125 ms	17008 KB	Output is correct
19	Correct	165 ms	19284 KB	Output is correct
20	Correct	203 ms	19036 KB	Output is correct