Submission #8559765
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i < n; i++)
#define elif else if
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll MOD2 = 998244353;
const ll INF = 1e15;
int main(){
int N, M, A, ans;
cin >> N >> M;
queue<int> que[N];
rep(i, N){
rep(j, M) {
cin >> A;
que[i].push(A);
}
}
priority_queue<pair<int, int> > pque[M];
int cnt[M+1];
bool used[M+1];
fill_n(cnt, M+1, 0);
fill_n(used, M+1, false);
rep(i, N) cnt[que[i].front()]++;
rep2(i, 1, M+1) pque[0].push(P(cnt[i], i));
ans = pque[0].top().first;
rep(i, M-1){
P p = pque[i].top();
int j = p.second;
cnt[j] = 0;
used[j] = true;
rep(k, N){
if(que[k].front() == j){
while(used[que[k].front()]) que[k].pop();
cnt[que[k].front()]++;
}
}
rep2(k, 1, M+1) pque[i+1].push(P(cnt[k], k));
ans = min(ans, pque[i+1].top().first);
}
cout << ans << endl;
}
Submission Info
Submission Time |
|
Task |
B - Sports Festival |
User |
tokusakurai |
Language |
C++14 (GCC 5.4.1) |
Score |
700 |
Code Size |
1179 Byte |
Status |
AC |
Exec Time |
23 ms |
Memory |
1920 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 |
384 KB |
subtask_1_04.txt |
AC |
3 ms |
384 KB |
subtask_1_05.txt |
AC |
1 ms |
256 KB |
subtask_1_06.txt |
AC |
6 ms |
512 KB |
subtask_1_07.txt |
AC |
7 ms |
512 KB |
subtask_1_08.txt |
AC |
3 ms |
512 KB |
subtask_1_09.txt |
AC |
1 ms |
384 KB |
subtask_1_10.txt |
AC |
6 ms |
1536 KB |
subtask_1_11.txt |
AC |
7 ms |
1536 KB |
subtask_1_12.txt |
AC |
5 ms |
1536 KB |
subtask_1_13.txt |
AC |
10 ms |
1664 KB |
subtask_1_14.txt |
AC |
23 ms |
1920 KB |
subtask_1_15.txt |
AC |
23 ms |
1920 KB |
subtask_1_16.txt |
AC |
23 ms |
1920 KB |
subtask_1_17.txt |
AC |
23 ms |
1920 KB |
subtask_1_18.txt |
AC |
23 ms |
1920 KB |