From 3a89fc707253f75f46fd5a4822817f1fd5156c40 Mon Sep 17 00:00:00 2001 From: Omar Magdy Date: Mon, 30 May 2022 00:18:17 +0200 Subject: Made that every problem is its own folder to make building the code a smooth operation with a shortcut --- contests/Round#790/10-10-2022(Div4)/B.cpp | 25 -------------- contests/Round#790/10-10-2022(Div4)/B/B.cpp | 25 ++++++++++++++ contests/Round#790/10-10-2022(Div4)/C.cpp | 28 ---------------- contests/Round#790/10-10-2022(Div4)/C/C.cpp | 28 ++++++++++++++++ contests/Round#790/10-10-2022(Div4)/D.cpp | 51 ----------------------------- contests/Round#790/10-10-2022(Div4)/D/D.cpp | 51 +++++++++++++++++++++++++++++ 6 files changed, 104 insertions(+), 104 deletions(-) delete mode 100644 contests/Round#790/10-10-2022(Div4)/B.cpp create mode 100644 contests/Round#790/10-10-2022(Div4)/B/B.cpp delete mode 100644 contests/Round#790/10-10-2022(Div4)/C.cpp create mode 100644 contests/Round#790/10-10-2022(Div4)/C/C.cpp delete mode 100644 contests/Round#790/10-10-2022(Div4)/D.cpp create mode 100644 contests/Round#790/10-10-2022(Div4)/D/D.cpp (limited to 'contests/Round#790/10-10-2022(Div4)') diff --git a/contests/Round#790/10-10-2022(Div4)/B.cpp b/contests/Round#790/10-10-2022(Div4)/B.cpp deleted file mode 100644 index a9e3a04..0000000 --- a/contests/Round#790/10-10-2022(Div4)/B.cpp +++ /dev/null @@ -1,25 +0,0 @@ -#include - -using namespace std; - -int main () { - int tt; - cin >> tt; - while(tt--) { - int n, c; - int ans = 0; - cin >> n; - vector v(n); - for(int &x : v) { - cin >> x; - } - int mn = *min_element(v.begin(), v.end()); - for(int i = 0; i < v.size(); i++) { - if(v[i] != mn){ - ans += v[i] - mn; - } - } - cout << ans << endl; - } - -} diff --git a/contests/Round#790/10-10-2022(Div4)/B/B.cpp b/contests/Round#790/10-10-2022(Div4)/B/B.cpp new file mode 100644 index 0000000..a9e3a04 --- /dev/null +++ b/contests/Round#790/10-10-2022(Div4)/B/B.cpp @@ -0,0 +1,25 @@ +#include + +using namespace std; + +int main () { + int tt; + cin >> tt; + while(tt--) { + int n, c; + int ans = 0; + cin >> n; + vector v(n); + for(int &x : v) { + cin >> x; + } + int mn = *min_element(v.begin(), v.end()); + for(int i = 0; i < v.size(); i++) { + if(v[i] != mn){ + ans += v[i] - mn; + } + } + cout << ans << endl; + } + +} diff --git a/contests/Round#790/10-10-2022(Div4)/C.cpp b/contests/Round#790/10-10-2022(Div4)/C.cpp deleted file mode 100644 index 68eda3d..0000000 --- a/contests/Round#790/10-10-2022(Div4)/C.cpp +++ /dev/null @@ -1,28 +0,0 @@ -#include - -using namespace std; - -int main () { - int tt; - cin >> tt; - while(tt--) { - int n, m; - cin >> n >> m; - vector v(n); - vector ans; - for(auto &s : v) { - cin >> s; - } - for(int i = 0; i < v.size() - 1;i++) { - for(int j = i + 1;j < v.size();j++){ - int sum = 0; - for(int k = 0; k < v[i].size(); k++) { - sum+=abs(v[i][k] - v[j][k]); - } - ans.push_back(sum); - } - } - cout << *min_element(ans.begin(), ans.end()) << endl; - } - -} diff --git a/contests/Round#790/10-10-2022(Div4)/C/C.cpp b/contests/Round#790/10-10-2022(Div4)/C/C.cpp new file mode 100644 index 0000000..68eda3d --- /dev/null +++ b/contests/Round#790/10-10-2022(Div4)/C/C.cpp @@ -0,0 +1,28 @@ +#include + +using namespace std; + +int main () { + int tt; + cin >> tt; + while(tt--) { + int n, m; + cin >> n >> m; + vector v(n); + vector ans; + for(auto &s : v) { + cin >> s; + } + for(int i = 0; i < v.size() - 1;i++) { + for(int j = i + 1;j < v.size();j++){ + int sum = 0; + for(int k = 0; k < v[i].size(); k++) { + sum+=abs(v[i][k] - v[j][k]); + } + ans.push_back(sum); + } + } + cout << *min_element(ans.begin(), ans.end()) << endl; + } + +} diff --git a/contests/Round#790/10-10-2022(Div4)/D.cpp b/contests/Round#790/10-10-2022(Div4)/D.cpp deleted file mode 100644 index 6ee775c..0000000 --- a/contests/Round#790/10-10-2022(Div4)/D.cpp +++ /dev/null @@ -1,51 +0,0 @@ -#include - -using namespace std; - -int main () { - int tt; - cin >> tt; - while(tt--) { - int r, c; - cin >> r >> c; - vector> grid(r, vector(c)); - for(auto &v : grid) { - for(auto &x : v){ - cin >> x; - } - } - vector res; - int ans = 0; - for(int i = 0; i < r; i++) { - for(int j = 0; j < c; j++) { - ans += grid[i][j]; - int r1 = i, r2 = i, r3 = i, r4 = i; - int c1 = j, c2 = j, c3 = j, c4 =j; - while(r1+1 <= r - 1 && c1 + 1 <= c - 1) { - r1++; - c1++; - ans+= grid[r1][c1]; - } - while(r2+1 <= r - 1 && c2 - 1 >= 0) { - r2++; - c2--; - ans+= grid[r2][c2]; - } - while(r3-1 >= 0 && c3 + 1 <= c - 1) { - r3--; - c3++; - ans+= grid[r3][c3]; - } - while(r4-1 >= 0 && c4 - 1 >= 0) { - r4--; - c4--; - ans+= grid[r4][c4]; - cout << "r4 " << r4 << " c4 " << c4 << endl; - } - res.push_back(ans); - ans = 0; - } - } - cout << *max_element(res.begin(), res.end()) << endl; - } -} diff --git a/contests/Round#790/10-10-2022(Div4)/D/D.cpp b/contests/Round#790/10-10-2022(Div4)/D/D.cpp new file mode 100644 index 0000000..6ee775c --- /dev/null +++ b/contests/Round#790/10-10-2022(Div4)/D/D.cpp @@ -0,0 +1,51 @@ +#include + +using namespace std; + +int main () { + int tt; + cin >> tt; + while(tt--) { + int r, c; + cin >> r >> c; + vector> grid(r, vector(c)); + for(auto &v : grid) { + for(auto &x : v){ + cin >> x; + } + } + vector res; + int ans = 0; + for(int i = 0; i < r; i++) { + for(int j = 0; j < c; j++) { + ans += grid[i][j]; + int r1 = i, r2 = i, r3 = i, r4 = i; + int c1 = j, c2 = j, c3 = j, c4 =j; + while(r1+1 <= r - 1 && c1 + 1 <= c - 1) { + r1++; + c1++; + ans+= grid[r1][c1]; + } + while(r2+1 <= r - 1 && c2 - 1 >= 0) { + r2++; + c2--; + ans+= grid[r2][c2]; + } + while(r3-1 >= 0 && c3 + 1 <= c - 1) { + r3--; + c3++; + ans+= grid[r3][c3]; + } + while(r4-1 >= 0 && c4 - 1 >= 0) { + r4--; + c4--; + ans+= grid[r4][c4]; + cout << "r4 " << r4 << " c4 " << c4 << endl; + } + res.push_back(ans); + ans = 0; + } + } + cout << *max_element(res.begin(), res.end()) << endl; + } +} -- cgit v1.2.3