Submission #8548731
Source Code Expand
#include<cstdio> #include<queue> using namespace std; int n,m,x,ans,tot[310]; bool vis[310]; queue<int> que[310]; int main(){ scanf("%d%d",&n,&m); for (int i=1;i<=n;i++){ for (int j=1;j<=m;j++){ scanf("%d",&x); if (j==1) tot[x]++; que[i].push(x); } } int mx=0,j=0; for (int i=1;i<=m;i++) if (tot[i]>mx){ mx=tot[i]; j=i;} ans=mx; vis[j]=true; for (int k=1;k<m;k++){ for (int i=1;i<=n;i++) if (que[i].front()==j){ que[i].pop(); while (vis[que[i].front()]) que[i].pop(); tot[que[i].front()]++; } mx=0; j=0; for (int i=1;i<=m;i++) if (!vis[i]&&tot[i]>mx){ mx=tot[i]; j=i;} ans=min(ans,mx); vis[j]=true; } printf("%d\n",ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Sports Festival |
User | vjudge2 |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 687 Byte |
Status | AC |
Exec Time | 10 ms |
Memory | 768 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:8:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d",&n,&m); ^ ./Main.cpp:11:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&x); ^
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 | 384 KB |
sample_02.txt | AC | 1 ms | 384 KB |
sample_03.txt | AC | 1 ms | 384 KB |
subtask_1_01.txt | AC | 1 ms | 384 KB |
subtask_1_02.txt | AC | 1 ms | 384 KB |
subtask_1_03.txt | AC | 2 ms | 384 KB |
subtask_1_04.txt | AC | 2 ms | 384 KB |
subtask_1_05.txt | AC | 1 ms | 384 KB |
subtask_1_06.txt | AC | 3 ms | 384 KB |
subtask_1_07.txt | AC | 4 ms | 384 KB |
subtask_1_08.txt | AC | 2 ms | 384 KB |
subtask_1_09.txt | AC | 1 ms | 384 KB |
subtask_1_10.txt | AC | 2 ms | 512 KB |
subtask_1_11.txt | AC | 3 ms | 512 KB |
subtask_1_12.txt | AC | 2 ms | 512 KB |
subtask_1_13.txt | AC | 4 ms | 512 KB |
subtask_1_14.txt | AC | 9 ms | 768 KB |
subtask_1_15.txt | AC | 10 ms | 768 KB |
subtask_1_16.txt | AC | 9 ms | 768 KB |
subtask_1_17.txt | AC | 9 ms | 768 KB |
subtask_1_18.txt | AC | 9 ms | 768 KB |