1015 | 2022. 02. 23 17:47:02 | CzDani | Kert (75 pont) | cpp14 | Elfogadva 75/75 | 231ms | 25788 KiB |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define int long long
int n, m, p, ans1, ans2, ans3;
vector<vector<int> > v;
signed main() {
cin >> n >> m >> p;
v.resize(n+1, vector<int>(m+1));
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> v[i][j];
}
}
for (int i = 1; i <= n; i++) {
int db = 0, t = 0;;
for (int l = 1; l <= m; l++) {
if (v[i][l] == t) {
db++;
ans1 = max(ans1, db);
}
else {
t = v[i][l];
db = 1;
ans1 = max(ans1, db);
}
}
}
for (int i = 1; i <= n; i++) {
sort(v[i].begin(), v[i].end());
bool jo = false;
int db = 0, t = 0;
for (int j = 1; j <= m; j++) {
if (v[i][j] == t) {
db++;
}
else {
t = v[i][j];
db = 1;
}
if (db > m / 2) {
jo = true;
}
}
if (jo) {
ans3++;
}
}
cout << ans3 << endl << ans1;
}
Részfeladat | Összpont | Teszt | Verdikt | Idő | Memória | ||
---|---|---|---|---|---|---|---|
base | 75/75 | ||||||
1 | Elfogadva | 0/0 | 2ms | 1748 KiB | |||
2 | Elfogadva | 0/0 | 224ms | 13864 KiB | |||
3 | Elfogadva | 4/4 | 1ms | 5764 KiB | |||
4 | Elfogadva | 4/4 | 1ms | 5768 KiB | |||
5 | Elfogadva | 4/4 | 1ms | 5768 KiB | |||
6 | Elfogadva | 4/4 | 1ms | 5788 KiB | |||
7 | Elfogadva | 4/4 | 1ms | 5792 KiB | |||
8 | Elfogadva | 4/4 | 1ms | 5784 KiB | |||
9 | Elfogadva | 4/4 | 2ms | 5808 KiB | |||
10 | Elfogadva | 4/4 | 4ms | 6028 KiB | |||
11 | Elfogadva | 6/6 | 2ms | 5884 KiB | |||
12 | Elfogadva | 6/6 | 8ms | 6316 KiB | |||
13 | Elfogadva | 6/6 | 23ms | 7260 KiB | |||
14 | Elfogadva | 6/6 | 199ms | 17616 KiB | |||
15 | Elfogadva | 6/6 | 196ms | 23356 KiB | |||
16 | Elfogadva | 6/6 | 231ms | 25788 KiB | |||
17 | Elfogadva | 7/7 | 115ms | 23848 KiB |