Submission #1868411
Source Code Expand
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define forE(i,x) for(int i=head[x];i!=-1;i=ne[i])
using namespace std;
typedef long long i64;
typedef unsigned long long u64;
typedef unsigned u32;
typedef pair<int,int> pin;
#define mk(a,b) make_pair(a,b)
#define lowbit(x) ((x)&(-(x)))
#define sqr(a) ((a)*(a))
#define clr(a) (memset((a),0,sizeof(a)))
#define ls ((x)<<1)
#define rs (((x)<<1)|1)
#define mid (((l)+(r))>>1)
#define pb push_back
#define w1 first
#define w2 second
inline void read(int &x){
x=0;int f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
x*=f;
}
inline void judge(){
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
}
/*******************************head*******************************/
const int maxn=305;
int a[maxn][maxn],n,m;
bool flag[maxn];
int cnt[maxn];
inline void re_count(){
memset(cnt,0,sizeof(cnt));
rep(i,1,n){
rep(j,1,m)if(flag[a[i][j]]){
cnt[a[i][j]]++;break;
}
}
}
int main(){
read(n);read(m);
rep(i,1,n)rep(j,1,m)read(a[i][j]);
int ans=n;rep(i,1,m)flag[i]=1;
rep(x,1,m){
re_count();
int maxi=0;
rep(i,1,m)maxi=max(maxi,cnt[i]);
ans=min(ans,maxi);
rep(i,1,m)if(cnt[i]==maxi){
flag[i]=0;break;
}
}cout<<ans<<endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Sports Festival |
User |
Scape |
Language |
C++14 (GCC 5.4.1) |
Score |
700 |
Code Size |
1417 Byte |
Status |
AC |
Exec Time |
15 ms |
Memory |
640 KB |
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 |
256 KB |
sample_02.txt |
AC |
1 ms |
256 KB |
sample_03.txt |
AC |
1 ms |
256 KB |
subtask_1_01.txt |
AC |
1 ms |
256 KB |
subtask_1_02.txt |
AC |
1 ms |
384 KB |
subtask_1_03.txt |
AC |
1 ms |
256 KB |
subtask_1_04.txt |
AC |
2 ms |
384 KB |
subtask_1_05.txt |
AC |
1 ms |
384 KB |
subtask_1_06.txt |
AC |
2 ms |
640 KB |
subtask_1_07.txt |
AC |
3 ms |
640 KB |
subtask_1_08.txt |
AC |
2 ms |
640 KB |
subtask_1_09.txt |
AC |
1 ms |
640 KB |
subtask_1_10.txt |
AC |
2 ms |
256 KB |
subtask_1_11.txt |
AC |
3 ms |
256 KB |
subtask_1_12.txt |
AC |
2 ms |
256 KB |
subtask_1_13.txt |
AC |
3 ms |
384 KB |
subtask_1_14.txt |
AC |
6 ms |
640 KB |
subtask_1_15.txt |
AC |
13 ms |
640 KB |
subtask_1_16.txt |
AC |
6 ms |
640 KB |
subtask_1_17.txt |
AC |
8 ms |
640 KB |
subtask_1_18.txt |
AC |
15 ms |
640 KB |