Submission #5697511
Source Code Expand
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <set>
#include <queue>
#include <vector>
using namespace std;
struct node{
int cnt,id;
}ath[100005];
int used[100005];
int a[305][305];
bool cmp(node a,node b){
return a.cnt>b.cnt;
}
int main(){
// freopen("sports.in","r",stdin);
// freopen("sports.out","w",stdout);
int n,m,i,j,k,o,p,l;
scanf("%d %d",&n,&m);
for(i=1;i<=m;i++)ath[i].id=i;
for(i=1;i<=n;i++)for(j=1;j<=m;j++){
scanf("%d",&a[i][j]);
if(j==1)ath[a[i][j]].cnt++;
}
int ans=1<<30;
int xm=m;
while(xm--){
sort(ath+1,ath+1+m,cmp);
ans=min(ans,ath[1].cnt);
used[ath[1].id]=1;
for(i=1;i<=m;i++)ath[i].id=i,ath[i].cnt=0;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
if(used[a[i][j]]==0){
ath[a[i][j]].cnt++;
break;
}
}
printf("%d\n",ans);
return 0;
}
Submission Info
Submission Time
2019-05-30 11:03:12+0900
Task
B - Sports Festival
User
luogu_bot4
Language
C++14 (GCC 5.4.1)
Score
700
Code Size
889 Byte
Status
AC
Exec Time
20 ms
Memory
640 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:22:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d",&n,&m);
^
./Main.cpp:25:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
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
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
2 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
4 ms
640 KB
subtask_1_07.txt
AC
5 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
4 ms
256 KB
subtask_1_11.txt
AC
5 ms
384 KB
subtask_1_12.txt
AC
3 ms
256 KB
subtask_1_13.txt
AC
6 ms
384 KB
subtask_1_14.txt
AC
12 ms
640 KB
subtask_1_15.txt
AC
18 ms
640 KB
subtask_1_16.txt
AC
12 ms
640 KB
subtask_1_17.txt
AC
14 ms
640 KB
subtask_1_18.txt
AC
20 ms
640 KB