Submission #1449854
Source Code Expand
Copy
#include <iostream>#include <fstream>#include <cstdio>#include <cassert>#include <complex>#include <cmath>#include <algorithm>#include <vector>#include <string>#include <cstdlib>#include <cstring>#include <iomanip>#include <numeric>#include <sstream>#include <ctime>#include <cctype>#include <set>#include <map>#include <queue>#include <bitset>#include <deque>
#include <iostream> #include <fstream> #include <cstdio> #include <cassert> #include <complex> #include <cmath> #include <algorithm> #include <vector> #include <string> #include <cstdlib> #include <cstring> #include <iomanip> #include <numeric> #include <sstream> #include <ctime> #include <cctype> #include <set> #include <map> #include <queue> #include <bitset> #include <deque> #include <stack> #include <memory.h> using namespace std; #define ll long long int n,m; int love[305][305]; int u[500]; vector<int> v(1000,0); int main() { cin>>n>>m; while(1){ } for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ cin>>love[i][j]; love[i][j]--; } } int mx=-9; for(int i=0;i<n;i++){ v.clear(); for(int j=0;j<m;j++){ v[i]++; } mx=-9; for(int k=0;k<v.size();k++){ mx=max(v[i],mx); } u[i]=mx; } for(int i=0;i<n;i++){ if(u[i]==0){ u[i]=-999; } } sort(u,u+n); int ans=0; int res=0; int i=0; while(ans<n){ ans+=u[i]; res=max(res,u[i]); i++; } cout<<res; return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Two Trees |
User | ZHR2016 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1086 Byte |
Status | TLE |
Exec Time | 2107 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 1700 | ||||
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, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_30.txt, subtask_1_31.txt, subtask_1_32.txt, subtask_1_33.txt, subtask_1_34.txt, subtask_1_35.txt, subtask_1_36.txt, subtask_1_37.txt, subtask_1_38.txt, subtask_1_39.txt, subtask_1_40.txt, subtask_1_41.txt, subtask_1_42.txt, subtask_1_43.txt, subtask_1_44.txt, subtask_1_45.txt, subtask_1_46.txt, subtask_1_47.txt, subtask_1_48.txt, subtask_1_49.txt, subtask_1_50.txt, subtask_1_51.txt, subtask_1_52.txt, subtask_1_53.txt, subtask_1_54.txt, subtask_1_55.txt, subtask_1_56.txt, subtask_1_57.txt, subtask_1_58.txt, subtask_1_59.txt, subtask_1_60.txt, subtask_1_61.txt, subtask_1_62.txt, subtask_1_63.txt, subtask_1_64.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | TLE | 2103 ms | 256 KB |
sample_02.txt | TLE | 2103 ms | 256 KB |
sample_03.txt | TLE | 2103 ms | 256 KB |
subtask_1_01.txt | TLE | 2103 ms | 256 KB |
subtask_1_02.txt | TLE | 2103 ms | 256 KB |
subtask_1_03.txt | TLE | 2103 ms | 256 KB |
subtask_1_04.txt | TLE | 2103 ms | 256 KB |
subtask_1_05.txt | TLE | 2103 ms | 256 KB |
subtask_1_06.txt | TLE | 2103 ms | 256 KB |
subtask_1_07.txt | TLE | 2103 ms | 256 KB |
subtask_1_08.txt | TLE | 2103 ms | 256 KB |
subtask_1_09.txt | TLE | 2103 ms | 256 KB |
subtask_1_10.txt | TLE | 2103 ms | 256 KB |
subtask_1_11.txt | TLE | 2103 ms | 256 KB |
subtask_1_12.txt | TLE | 2107 ms | 256 KB |
subtask_1_13.txt | TLE | 2103 ms | 256 KB |
subtask_1_14.txt | TLE | 2103 ms | 256 KB |
subtask_1_15.txt | TLE | 2103 ms | 256 KB |
subtask_1_16.txt | TLE | 2103 ms | 256 KB |
subtask_1_17.txt | TLE | 2103 ms | 256 KB |
subtask_1_18.txt | TLE | 2103 ms | 256 KB |
subtask_1_19.txt | TLE | 2103 ms | 256 KB |
subtask_1_20.txt | TLE | 2103 ms | 256 KB |
subtask_1_21.txt | TLE | 2103 ms | 256 KB |
subtask_1_22.txt | TLE | 2103 ms | 256 KB |
subtask_1_23.txt | TLE | 2103 ms | 256 KB |
subtask_1_24.txt | TLE | 2103 ms | 256 KB |
subtask_1_25.txt | TLE | 2103 ms | 256 KB |
subtask_1_26.txt | TLE | 2103 ms | 256 KB |
subtask_1_27.txt | TLE | 2103 ms | 256 KB |
subtask_1_28.txt | TLE | 2103 ms | 256 KB |
subtask_1_29.txt | TLE | 2103 ms | 256 KB |
subtask_1_30.txt | TLE | 2103 ms | 256 KB |
subtask_1_31.txt | TLE | 2103 ms | 256 KB |
subtask_1_32.txt | TLE | 2103 ms | 256 KB |
subtask_1_33.txt | TLE | 2103 ms | 256 KB |
subtask_1_34.txt | TLE | 2103 ms | 256 KB |
subtask_1_35.txt | TLE | 2103 ms | 256 KB |
subtask_1_36.txt | TLE | 2103 ms | 256 KB |
subtask_1_37.txt | TLE | 2103 ms | 256 KB |
subtask_1_38.txt | TLE | 2103 ms | 256 KB |
subtask_1_39.txt | TLE | 2103 ms | 256 KB |
subtask_1_40.txt | TLE | 2103 ms | 256 KB |
subtask_1_41.txt | TLE | 2103 ms | 256 KB |
subtask_1_42.txt | TLE | 2103 ms | 256 KB |
subtask_1_43.txt | TLE | 2103 ms | 256 KB |
subtask_1_44.txt | TLE | 2103 ms | 256 KB |
subtask_1_45.txt | TLE | 2103 ms | 256 KB |
subtask_1_46.txt | TLE | 2103 ms | 256 KB |
subtask_1_47.txt | TLE | 2103 ms | 256 KB |
subtask_1_48.txt | TLE | 2103 ms | 256 KB |
subtask_1_49.txt | TLE | 2103 ms | 256 KB |
subtask_1_50.txt | TLE | 2103 ms | 256 KB |
subtask_1_51.txt | TLE | 2103 ms | 256 KB |
subtask_1_52.txt | TLE | 2103 ms | 256 KB |
subtask_1_53.txt | TLE | 2103 ms | 256 KB |
subtask_1_54.txt | TLE | 2103 ms | 256 KB |
subtask_1_55.txt | TLE | 2103 ms | 256 KB |
subtask_1_56.txt | TLE | 2103 ms | 256 KB |
subtask_1_57.txt | TLE | 2103 ms | 256 KB |
subtask_1_58.txt | TLE | 2103 ms | 256 KB |
subtask_1_59.txt | TLE | 2103 ms | 256 KB |
subtask_1_60.txt | TLE | 2103 ms | 256 KB |
subtask_1_61.txt | TLE | 2103 ms | 256 KB |
subtask_1_62.txt | TLE | 2103 ms | 256 KB |
subtask_1_63.txt | TLE | 2103 ms | 256 KB |
subtask_1_64.txt | TLE | 2103 ms | 256 KB |