Submission #6369750
Source Code Expand
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<functional>
#include<vector>
#include<queue>
#include<stack>
#include<set>
#include<map>
using namespace std;
#define MOD 1000000007
#define f(i,n) for(int i=0;i<int(n);i++)
#define N 500
int n, m;
int a[N][N];
bool b[N];
int c[N];
int cou(void) {
int k, km;
k = 0;
km = 0;
f(i, N)c[i] = 0;
f(i, n) {
f(j, m) {
if (b[a[i][j]]) {
c[a[i][j]]++;
if (km < c[a[i][j]]) {
km = c[a[i][j]];
k = a[i][j];
}
break;
}
}
}
return k;
}
int main() {
int x, ans;
scanf("%d %d", &n,&m);
f(i, n) {
f(j, m) {
scanf("%d", &a[i][j]);
a[i][j]--;
}
}
f(i, N)b[i] = false;
f(i, m)b[i] = true;
ans = n;
f(i,m){
x = cou();
ans = min(ans, c[x]);
b[x] = false;
}
printf("%d\n", ans);
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Sports Festival |
User |
mechanicalpenciI |
Language |
C++14 (GCC 5.4.1) |
Score |
700 |
Code Size |
912 Byte |
Status |
AC |
Exec Time |
19 ms |
Memory |
768 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:48:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &n,&m);
^
./Main.cpp:51:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &a[i][j]);
^
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
700 / 700 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt, sample_03.txt |
All |
sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
1 ms |
128 KB |
sample_02.txt |
AC |
1 ms |
128 KB |
sample_03.txt |
AC |
1 ms |
128 KB |
subtask_1_01.txt |
AC |
1 ms |
128 KB |
subtask_1_02.txt |
AC |
1 ms |
384 KB |
subtask_1_03.txt |
AC |
1 ms |
256 KB |
subtask_1_04.txt |
AC |
1 ms |
384 KB |
subtask_1_05.txt |
AC |
1 ms |
384 KB |
subtask_1_06.txt |
AC |
3 ms |
768 KB |
subtask_1_07.txt |
AC |
4 ms |
768 KB |
subtask_1_08.txt |
AC |
2 ms |
768 KB |
subtask_1_09.txt |
AC |
1 ms |
768 KB |
subtask_1_10.txt |
AC |
1 ms |
256 KB |
subtask_1_11.txt |
AC |
3 ms |
256 KB |
subtask_1_12.txt |
AC |
1 ms |
128 KB |
subtask_1_13.txt |
AC |
4 ms |
384 KB |
subtask_1_14.txt |
AC |
9 ms |
768 KB |
subtask_1_15.txt |
AC |
17 ms |
768 KB |
subtask_1_16.txt |
AC |
10 ms |
768 KB |
subtask_1_17.txt |
AC |
12 ms |
768 KB |
subtask_1_18.txt |
AC |
19 ms |
768 KB |