Submission #1870632
Source Code Expand
#include <cstdio> int a[305][305],b[305],cnt[305]; bool u[305]; int main(){ int n,m; scanf("%d%d\n",&n,&m); for (int i=1;i<=n;i++) for (int j=1;j<=m;j++) scanf("%d",&a[i][j]); int ans=n;u[0]=1; for (int i=1;i<=m;i++){ for (int j=1;j<=m;j++) cnt[j]=0; for (int j=1;j<=n;j++){ for (;u[a[j][b[j]]];b[j]++); cnt[a[j][b[j]]]++; } int k=0; for (int j=1;j<=m;j++) k=cnt[j]>cnt[k]?j:k; ans=cnt[k]<ans?cnt[k]:ans; u[k]=1; } printf("%d\n",ans); }
Submission Info
Submission Time | |
---|---|
Task | B - Sports Festival |
User | aufeas |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 486 Byte |
Status | AC |
Exec Time | 8 ms |
Memory | 512 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:6:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d\n",&n,&m); ^ ./Main.cpp:8:46: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for (int j=1;j<=m;j++) 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 | 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 | 3 ms | 512 KB |
subtask_1_07.txt | AC | 3 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 | 2 ms | 256 KB |
subtask_1_12.txt | AC | 3 ms | 256 KB |
subtask_1_13.txt | AC | 3 ms | 256 KB |
subtask_1_14.txt | AC | 8 ms | 512 KB |
subtask_1_15.txt | AC | 8 ms | 512 KB |
subtask_1_16.txt | AC | 8 ms | 512 KB |
subtask_1_17.txt | AC | 8 ms | 512 KB |
subtask_1_18.txt | AC | 8 ms | 512 KB |