Submission #1446765
Source Code Expand
#include <bits/stdc++.h>
#define MAXN (310)
int n, m;
int a[MAXN][MAXN], cnt[MAXN];
void getcnt(std::set<int> &set){
memset(cnt, 0, sizeof(cnt));
for(int i = 1; i <= n; ++ i){
std::vector<std::pair<int, int> > tmp;
for(auto u : set){
tmp.push_back({a[i][u], u});
}
std::sort(tmp.begin(), tmp.end());
++ cnt[tmp[0].second];
}
}
bool check(int x){
std::set<int> set;
for(int i = 1; i <= m; ++ i){
set.insert(i);
}
int now = n;
while(true){
getcnt(set);
bool flag = true;
std::vector<int> vec;
for(auto u : set){
if(cnt[u] > x){
flag = false;
vec.push_back(u);
}
}
if(flag) return true;
for(auto u : vec){
set.erase(u);
-- now;
}
if(!now) return false;
}
}
int main(){
scanf("%d%d", &n, &m);
for(int i = 1; i <= n; ++ i){
for(int j = 1; j <= m; ++ j){
int aij;
scanf("%d", &aij);
a[i][aij] = j;
}
}
int left = 1, right = n, ans = 0;
while(left <= right){
int mid = left + right >> 1;
if(check(mid)){
ans = mid;
right = mid - 1;
}
else{
left = mid + 1;
}
}
printf("%d\n", ans);
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Sports Festival |
User |
clatisus |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
1158 Byte |
Status |
RE |
Exec Time |
2103 ms |
Memory |
640 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:46:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &n, &m);
^
./Main.cpp:50:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &aij);
^
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 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 |
RE |
95 ms |
384 KB |
subtask_1_03.txt |
RE |
99 ms |
256 KB |
subtask_1_04.txt |
RE |
98 ms |
384 KB |
subtask_1_05.txt |
RE |
95 ms |
384 KB |
subtask_1_06.txt |
RE |
105 ms |
640 KB |
subtask_1_07.txt |
RE |
157 ms |
640 KB |
subtask_1_08.txt |
RE |
100 ms |
640 KB |
subtask_1_09.txt |
RE |
95 ms |
640 KB |
subtask_1_10.txt |
AC |
4 ms |
256 KB |
subtask_1_11.txt |
AC |
134 ms |
384 KB |
subtask_1_12.txt |
AC |
2 ms |
256 KB |
subtask_1_13.txt |
AC |
101 ms |
384 KB |
subtask_1_14.txt |
AC |
78 ms |
640 KB |
subtask_1_15.txt |
TLE |
2103 ms |
640 KB |
subtask_1_16.txt |
AC |
88 ms |
640 KB |
subtask_1_17.txt |
AC |
580 ms |
640 KB |
subtask_1_18.txt |
TLE |
2103 ms |
640 KB |