Submission #6320240
Source Code Expand
#include<bits/stdc++.h>
using namespace std;
namespace Flandle_Scarlet
{
#define N 1010
#define MEM(x,a) memset(x,a,sizeof(x))
#define CLS(x) memset(x,0,sizeof(x))
int n,m;
int a[N][N];
void R1(int &x)
{
x=0;char c=getchar();int f=1;
while(c<'0' or c>'9') f=(c=='-')?-1:1,c=getchar();
while(c>='0' and c<='9') x=(x<<1)+(x<<3)+(c^48),c=getchar();
x=(f==1)?x:-x;
}
void Input()
{
R1(n),R1(m);
for(int i=1;i<=n;++i)
{
for(int j=1;j<=m;++j)
{
R1(a[i][j]);
}
}
}
struct node
{
int id;//identifier
int cnt;//favourite count
}sport[N];bool operator<(node a,node b){return a.cnt>b.cnt;}
bool vis[N];
void Soviet()
{
//choose all
for(int i=1;i<=n;++i)
{
++sport[a[i][1]].cnt;
sport[i].id=i;
}
int ans=0x3f3f3f3f;
for(int i=1;i<=m;++i)
{
sort(sport+1,sport+m+1);
//sport[1] have the max cnt
ans=min(ans,sport[1].cnt);
vis[sport[1].id]=1;//delete the most popular sport
CLS(sport);
for(int i=1;i<=m;++i)
{
sport[i].id=i;
}
for(int i=1;i<=n;++i)//for each player
{
for(int j=1;j<=m;++j)//find the favourite sport in all remaining sport
{
if (!vis[a[i][j]])
{
++sport[a[i][j]].cnt;
break;
}
}
}
}
printf("%d\n",ans);
}
void IsMyWife()
{
if (0)
{
freopen("","r",stdin);
freopen("","w",stdout);
}
Input();
Soviet();
}
};
int main()
{
Flandle_Scarlet::IsMyWife();
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Sports Festival |
User |
luogu_bot4 |
Language |
C++14 (GCC 5.4.1) |
Score |
700 |
Code Size |
2037 Byte |
Status |
AC |
Exec Time |
16 ms |
Memory |
1408 KB |
Compile Error
./Main.cpp: In function ‘void Flandle_Scarlet::IsMyWife()’:
./Main.cpp:75:34: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("","r",stdin);
^
./Main.cpp:76:35: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("","w",stdout);
^
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 |
640 KB |
subtask_1_03.txt |
AC |
2 ms |
512 KB |
subtask_1_04.txt |
AC |
2 ms |
640 KB |
subtask_1_05.txt |
AC |
1 ms |
640 KB |
subtask_1_06.txt |
AC |
3 ms |
1408 KB |
subtask_1_07.txt |
AC |
4 ms |
1408 KB |
subtask_1_08.txt |
AC |
2 ms |
1408 KB |
subtask_1_09.txt |
AC |
2 ms |
1408 KB |
subtask_1_10.txt |
AC |
2 ms |
384 KB |
subtask_1_11.txt |
AC |
4 ms |
512 KB |
subtask_1_12.txt |
AC |
2 ms |
256 KB |
subtask_1_13.txt |
AC |
4 ms |
640 KB |
subtask_1_14.txt |
AC |
7 ms |
1408 KB |
subtask_1_15.txt |
AC |
14 ms |
1408 KB |
subtask_1_16.txt |
AC |
8 ms |
1408 KB |
subtask_1_17.txt |
AC |
10 ms |
1408 KB |
subtask_1_18.txt |
AC |
16 ms |
1408 KB |