Submission #1724869
Source Code Expand
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<set>
#include<cmath>
#include<cstdlib>
#include<iostream>
#include<map>
#define Rep(i,x,y) for (int i=x,_Lim=y;i<=_Lim;i++)
#define Dep(i,x,y) for (int i=x,_Lim=y;i>=_Lim;i--)
#define mk(a,b) make_pair(a,b)
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
int Stv[1<<8];
inline int read(){
int f=1,res=0,ch=getchar();
while (ch<'0' || ch>'9'){
if (ch=='-') f=-1;ch=getchar();
}
while (ch>='0' && ch<='9') res=res*10+ch-48,ch=getchar();
return f*res;
}
const int N=305;
int n,m,Dat[N][N],B[N],Pos[N],Ind[N];
int main(){
n=read(),m=read();
Rep(i,1,n) Rep(j,1,m) Dat[i][j]=read();
Rep(i,1,n) B[Dat[i][1]]++,Pos[i]=1;
int Ans=n;
Rep(k,1,m){
int pos=0,maxval=0;
Rep(i,1,m) if (B[i]>maxval){
pos=i;maxval=B[i];
}
Ind[pos]=true;
Rep(i,1,n) if (Dat[i][Pos[i]]==pos){
Pos[i]++;
while (Ind[Dat[i][Pos[i]]]) Pos[i]++;
B[Dat[i][Pos[i]]]++;
}
B[pos]=0;
if (pos==0) break;
Ans=min(Ans,maxval);
}
printf("%d\n",Ans);
}
/*
4 5
5 1 3 4 2
2 5 3 1 4
2 3 1 4 5
2 5 4 3 1
*/
Submission Info
Submission Time |
|
Task |
B - Sports Festival |
User |
vjudge1 |
Language |
C++14 (GCC 5.4.1) |
Score |
700 |
Code Size |
1106 Byte |
Status |
AC |
Exec Time |
4 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 |
1 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 |
2 ms |
640 KB |
subtask_1_08.txt |
AC |
1 ms |
640 KB |
subtask_1_09.txt |
AC |
1 ms |
640 KB |
subtask_1_10.txt |
AC |
1 ms |
256 KB |
subtask_1_11.txt |
AC |
2 ms |
256 KB |
subtask_1_12.txt |
AC |
1 ms |
256 KB |
subtask_1_13.txt |
AC |
2 ms |
384 KB |
subtask_1_14.txt |
AC |
4 ms |
640 KB |
subtask_1_15.txt |
AC |
4 ms |
640 KB |
subtask_1_16.txt |
AC |
4 ms |
640 KB |
subtask_1_17.txt |
AC |
4 ms |
640 KB |
subtask_1_18.txt |
AC |
4 ms |
640 KB |