Submission #3253869
Source Code Expand
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC optimize(3)
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC target("sse3","sse2","sse")
#pragma GCC target("avx","sse4","sse4.1","sse4.2","ssse3")
#pragma GCC target("f16c")
#pragma GCC optimize("inline","fast-math","unroll-loops","no-stack-protector")
#pragma GCC diagnostic error "-fwhole-program"
#pragma GCC diagnostic error "-fcse-skip-blocks"
#pragma GCC diagnostic error "-funsafe-loop-optimizations"
#pragma GCC diagnostic error "-std=c++14"
#include "bits/stdc++.h"
//#include "ext/pb_ds/tree_policy.hpp"
//#include "ext/pb_ds/assoc_container.hpp"
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fr(x) freopen(x,"r",stdin)
#define fw(x) freopen(x,"w",stdout)
#define iout(x) printf("%d\n",x)
#define lout(x) printf("%lld\n",x)
#define REP(x,l,u) for(ll x = l;x<u;x++)
#define RREP(x,l,u) for(ll x = l;x>=u;x--)
#define complete_unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define mst(x,a) memset(x,a,sizeof(x))
#define all(a) a.begin(),a.end()
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define MP make_pair
#define sqr(x) ((x)*(x))
#define lowbit(x) (x&(-x))
#define lson (ind<<1)
#define rson (ind<<1|1)
#define se second
#define fi first
#define dbg(x) cerr<<#x<<" = "<<(x)<<endl;
#define sz(x) ((int)x.size())
#define EX0 exit(0);
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
using namespace std;
typedef vector<ll> VLL;
typedef vector<int> VI;
const int block_size = 320;
typedef complex<ll> point;
const ll mod = 1e9+7;
const ll inf = 1e9+7;
const ld eps = 1e-9;
const db PI = atan(1)*4;
template<typename T>
inline int sign(const T&a) {
if(a<0)return -1;
if(a>0)return 1;
return 0;
}
template<typename T,typename S>inline bool upmin(T&a,const S&b){return a>b?a=b,1:0;}
template<typename T,typename S>inline bool upmax(T&a,const S&b){return a<b?a=b,1:0;}
template<typename T> inline void in(T &x) {
x = 0;
T f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
x *= f;
}
ll twop(int x) {
return 1LL<<x;
}
template<typename A,typename B > inline void in(A&x,B&y) {
in(x);
in(y);
}
template<typename A,typename B,typename C>inline void in(A&x,B&y,C&z) {
in(x);
in(y);
in(z);
}
template<typename A,typename B,typename C,typename D> inline void in(A&x,B&y,C&z,D&d) {
in(x);
in(y);
in(z);
in(d);
}
ll gcd(ll a,ll b){return b==0?a:gcd(b,a%b);}
namespace SOLVE {
void main(){
}
}
int n,m;
int pref[400][400];
bool choose[400];
vector<PII>player[400];
int exceed(int limit){
REP(i,0,m)if(sz(player[i]) > limit)return i;
return -1;
}
void print(){
REP(i,0,m){
cerr<<i<<": ";
for(auto person:player[i])cerr<<person.fi<<" ";
cerr<<endl;
}
}
bool check(int limit){
dbg(limit);
fill(choose, choose+m, 1);
REP(i,0,m){
player[i].clear();
}
REP(i,0,n){
player[pref[i][0]].PB(MP(i,0));
}
REP(i,0,m){
int res = exceed(limit);
if(res == -1)return true;
if(i == m-1)return false;
choose[res] = 0;
print();
for(auto person:player[res]){
while (!choose[pref[person.fi][person.se]]) {
person.se++;
}
player[pref[person.fi][person.se]].PB(person);
}
player[res].clear();
}
return false;
}
int main() {
in(n,m);
REP(i,0,n)REP(j,0,m){in(pref[i][j]);pref[i][j]--;}
int l = 1,r = m;
while (l<r) {
int mid = (l+r)/2;
if(check(mid)){
r = mid;
}else{
l = mid+1;
}
}
cout<<l;
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Sports Festival |
User |
samzhang |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
4303 Byte |
Status |
WA |
Exec Time |
1424 ms |
Memory |
1920 KB |
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 |
2 ms |
256 KB |
subtask_1_01.txt |
AC |
1 ms |
256 KB |
subtask_1_02.txt |
WA |
2 ms |
384 KB |
subtask_1_03.txt |
AC |
37 ms |
384 KB |
subtask_1_04.txt |
AC |
19 ms |
384 KB |
subtask_1_05.txt |
WA |
2 ms |
384 KB |
subtask_1_06.txt |
AC |
64 ms |
768 KB |
subtask_1_07.txt |
WA |
213 ms |
1024 KB |
subtask_1_08.txt |
WA |
49 ms |
768 KB |
subtask_1_09.txt |
WA |
2 ms |
768 KB |
subtask_1_10.txt |
AC |
2 ms |
256 KB |
subtask_1_11.txt |
AC |
168 ms |
512 KB |
subtask_1_12.txt |
AC |
2 ms |
256 KB |
subtask_1_13.txt |
AC |
93 ms |
384 KB |
subtask_1_14.txt |
AC |
189 ms |
768 KB |
subtask_1_15.txt |
AC |
1053 ms |
1536 KB |
subtask_1_16.txt |
AC |
200 ms |
768 KB |
subtask_1_17.txt |
AC |
410 ms |
896 KB |
subtask_1_18.txt |
AC |
1424 ms |
1920 KB |