Submission #1445297
Source Code Expand
#include<iostream> #include<cstdio> #include<algorithm> #include<set> #include<map> #include<queue> #include<cassert> #define PB push_back #define MP make_pair #define sz(v) (in((v).size())) #define forn(i,n) for(in i=0;i<(n);++i) #define forv(i,v) forn(i,sz(v)) #define fors(i,s) for(auto i=(s).begin();i!=(s).end();++i) #define all(v) (v).begin(),(v).end() using namespace std; typedef long long in; typedef vector<in> VI; typedef vector<VI> VVI; in n,m; in bst=1e9; VVI pm; VI nxt; VI act; VI pct; int main(){ ios::sync_with_stdio(0); cin.tie(0); cin>>n>>m; pm.resize(n,VI(m)); nxt.resize(n,0); forn(i,n){ forn(j,m){ cin>>pm[i][j]; --pm[i][j]; } } act.resize(m,1); pct.resize(m,0); forn(i,n) ++pct[pm[i][0]]; in mx=-1; in argmx=-1; forn(i,m){ if(pct[i]>mx){ mx=pct[i]; argmx=i; } } bst=min(bst,mx); forn(z,n-1){ act[argmx]=0; forn(i,n){ while(!act[pm[i][nxt[i]]]) ++nxt[i]; } forn(i,m) pct[i]=0; forn(i,n) ++pct[pm[i][nxt[i]]]; mx=-1; argmx=-1; forn(i,m){ if(pct[i]>mx){ mx=pct[i]; argmx=i; } } bst=min(bst,mx); } cout<<bst<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Sports Festival |
User | w4yneb0t |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1273 Byte |
Status | RE |
Exec Time | 100 ms |
Memory | 1024 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 | 1 ms | 256 KB |
subtask_1_01.txt | AC | 1 ms | 256 KB |
subtask_1_02.txt | RE | 100 ms | 256 KB |
subtask_1_03.txt | WA | 1 ms | 256 KB |
subtask_1_04.txt | WA | 2 ms | 384 KB |
subtask_1_05.txt | WA | 1 ms | 256 KB |
subtask_1_06.txt | WA | 3 ms | 512 KB |
subtask_1_07.txt | WA | 3 ms | 512 KB |
subtask_1_08.txt | WA | 2 ms | 384 KB |
subtask_1_09.txt | WA | 2 ms | 256 KB |
subtask_1_10.txt | AC | 2 ms | 384 KB |
subtask_1_11.txt | AC | 2 ms | 384 KB |
subtask_1_12.txt | AC | 1 ms | 256 KB |
subtask_1_13.txt | AC | 3 ms | 512 KB |
subtask_1_14.txt | AC | 8 ms | 1024 KB |
subtask_1_15.txt | AC | 8 ms | 1024 KB |
subtask_1_16.txt | AC | 8 ms | 1024 KB |
subtask_1_17.txt | AC | 8 ms | 1024 KB |
subtask_1_18.txt | AC | 8 ms | 1024 KB |