Submission #1693570
Source Code Expand
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#include<typeinfo>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef int Def;
typedef pair<Def,Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def,pii> pip;
typedef vector<pip>vip;
//#define mt make_tuple
//typedef tuple<pii,int,int> tp;
//typedef vector<tp> vt;
template<typename A,typename B>bool cmin(A &a,const B &b){return a>b?(a=b,true):false;}
template<typename A,typename B>bool cmax(A &a,const B &b){return a<b?(a=b,true):false;}
//template<class C>constexpr int size(const C &c){return (int)c.size();}
//template<class T,size_t N> constexpr int size(const T (&xs)[N])noexcept{return (int)N;}
const double PI=acos(-1);
const double EPS=1e-7;
Def inf=sizeof(Def)==sizeof(long long)?9e18:1e9;
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
int dp[42][1<<18][2];
int main(){
int n,m;
cin>>n>>m;
vvi in(n,vi(m));
rep(i,n)rep(j,m)cin>>in[i][j];
vi now(n),used(m);
int out=inf;
rep(q,m){
vp cnt(m);
rep(i,m)cnt[i].second=i;
rep(i,n)cnt[in[i][now[i]]-1].first++;
sort(all(cnt));
out=min(out,cnt[m-1].first);
used[cnt[m-1].second]=true;
rep(i,n)while(now[i]!=m&&used[in[i][now[i]]-1])now[i]++;
}
cout<<out<<endl;
}
Submission Info
Submission Time |
|
Task |
B - Sports Festival |
User |
ixmel_rd |
Language |
C++14 (GCC 5.4.1) |
Score |
700 |
Code Size |
1811 Byte |
Status |
AC |
Exec Time |
24 ms |
Memory |
640 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 |
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 |
256 KB |
subtask_1_03.txt |
AC |
2 ms |
256 KB |
subtask_1_04.txt |
AC |
3 ms |
256 KB |
subtask_1_05.txt |
AC |
1 ms |
256 KB |
subtask_1_06.txt |
AC |
6 ms |
384 KB |
subtask_1_07.txt |
AC |
7 ms |
384 KB |
subtask_1_08.txt |
AC |
3 ms |
256 KB |
subtask_1_09.txt |
AC |
1 ms |
256 KB |
subtask_1_10.txt |
AC |
5 ms |
256 KB |
subtask_1_11.txt |
AC |
7 ms |
256 KB |
subtask_1_12.txt |
AC |
4 ms |
256 KB |
subtask_1_13.txt |
AC |
10 ms |
384 KB |
subtask_1_14.txt |
AC |
24 ms |
640 KB |
subtask_1_15.txt |
AC |
23 ms |
640 KB |
subtask_1_16.txt |
AC |
24 ms |
640 KB |
subtask_1_17.txt |
AC |
24 ms |
640 KB |
subtask_1_18.txt |
AC |
22 ms |
640 KB |