Submission #1693173
Source Code Expand
#include<cstdio> #include<algorithm> using namespace std; inline char tc(void){ static char fl[10000],*A=fl,*B=fl; return A==B&&(B=(A=fl)+fread(fl,1,10000,stdin),A==B)?EOF:*A++; } inline int read(void){ int a=0;static char c; while((c=tc())<'0'||c>'9'); while(c>='0'&&c<='9')a=a*10+c-'0',c=tc(); return a; } int n,m,a[301][301],ans=2e9,sum[301],now[301],mx,b[301]; int main(void){ register int i,j; n=read(),m=read(); for(i=1;i<=n;++i){ for(j=1;j<=m;++j) a[i][j]=read(); ++sum[a[i][1]],now[i]=1; } for(i=1;i<=n;++i) if(sum[a[i][1]]>sum[mx]) mx=a[i][1]; ans=min(ans,sum[mx]); for(i=1;i<m;++i){ b[mx]=1,mx=0; for(j=1;j<=n;++j){ int s=0; if(b[a[j][now[j]]]) --sum[a[j][now[j]]]; while(b[a[j][now[j]]]) ++now[j],s=1; sum[a[j][now[j]]]+=s; if(sum[a[j][now[j]]]>sum[mx]) mx=a[j][now[j]]; } ans=min(ans,sum[mx]); } printf("%d",ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Sports Festival |
User | Axcosin |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 943 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 512 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 | 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 | 256 KB |
subtask_1_03.txt | AC | 1 ms | 256 KB |
subtask_1_04.txt | AC | 1 ms | 256 KB |
subtask_1_05.txt | AC | 1 ms | 256 KB |
subtask_1_06.txt | AC | 1 ms | 512 KB |
subtask_1_07.txt | AC | 1 ms | 512 KB |
subtask_1_08.txt | AC | 1 ms | 512 KB |
subtask_1_09.txt | AC | 1 ms | 512 KB |
subtask_1_10.txt | AC | 1 ms | 256 KB |
subtask_1_11.txt | AC | 1 ms | 256 KB |
subtask_1_12.txt | AC | 1 ms | 128 KB |
subtask_1_13.txt | AC | 1 ms | 256 KB |
subtask_1_14.txt | AC | 2 ms | 512 KB |
subtask_1_15.txt | AC | 2 ms | 512 KB |
subtask_1_16.txt | AC | 2 ms | 512 KB |
subtask_1_17.txt | AC | 2 ms | 512 KB |
subtask_1_18.txt | AC | 2 ms | 512 KB |