From 790b29f4c3e9f37c47162e25873a126d77ca97dc Mon Sep 17 00:00:00 2001 From: Shambhav Goswami <56958751+shambhavgo@users.noreply.github.com> Date: Mon, 5 Oct 2020 00:21:29 +0530 Subject: [PATCH 1/5] Update A.cpp --- Normal Contests/632/A.cpp | 31 ++++++++++++++++++++++++++++--- 1 file changed, 28 insertions(+), 3 deletions(-) diff --git a/Normal Contests/632/A.cpp b/Normal Contests/632/A.cpp index 19c8bca..3a99766 100644 --- a/Normal Contests/632/A.cpp +++ b/Normal Contests/632/A.cpp @@ -1,5 +1,30 @@ #include +using namespace std;#include using namespace std; +#define inp(k) ll k;cin>>k; +#define in2(n, k) ll n, k; cin>>n;cin>>k; +#define ll long long +#define dl double +#define ch char +#define f(i,a,b) for(ll i=a;i=b;i--) +#define Godspeed ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); +#define vpl vector< pair > +#define vpi vector< pair > +#define vi vector +#define vl vector +#define vdl vector
+#define vch vector +#define pll pair +#define pb push_back +#define mp make_pair +#define fr first +#define se second +#define PI 3.14159265 +bool comp(pair &a,pair &b) +{ + return a.second > b.second; +} int main() { int t; @@ -8,9 +33,9 @@ int main() { int a,b; cin>>a>>b; - for(int i=0;i Date: Mon, 5 Oct 2020 00:32:50 +0530 Subject: [PATCH 2/5] Create dj.cpp --- Special Contests/Good Bye 2019/dj.cpp | 88 +++++++++++++++++++++++++++ 1 file changed, 88 insertions(+) create mode 100644 Special Contests/Good Bye 2019/dj.cpp diff --git a/Special Contests/Good Bye 2019/dj.cpp b/Special Contests/Good Bye 2019/dj.cpp new file mode 100644 index 0000000..535de7b --- /dev/null +++ b/Special Contests/Good Bye 2019/dj.cpp @@ -0,0 +1,88 @@ +#include +using namespace std; +#define inp(k) ll k;cin>>k; +#define in2(n, k) ll n, k; cin>>n;cin>>k; +#define ll long long +#define dl double +#define ch char +#define f(i,a,b) for(ll i=a;i=b;i--) +#define Godspeed ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); +#define vpl vector< pair > +#define vpi vector< pair > +#define vi vector +#define vl vector +#define vdl vector
+#define vch vector +#define pll pair +#define pb push_back +#define mp make_pair +#define fr first +#define se second +#define PI 3.14159265 +bool comp(pair &a,pair &b) +{ + return a.second > b.second; +} +#include +#include + +#define V 9 + +int minDistance(int dist[], bool sptSet[]) +{ + int min = INT_MAX, min_index; + + for (int v = 0; v < V; v++) + if (sptSet[v] == false && dist[v] <= min) + min = dist[v], min_index = v; + + return min_index; +} +//main jadoogar hai mera naam goga + +void printSolution(int dist[]) +{ + printf("Vertex \t\t Distance from Source\n"); + for (int i = 0; i < V; i++) + printf("%d \t\t %d\n", i, dist[i]); +} +//mujh jaisa nahin koi hoga +void dijkstra(int graph[V][V], int src) +{ + int dist[V]; + + bool sptSet[V]; + + for (int i = 0; i < V; i++) + dist[i] = INT_MAX, sptSet[i] = false; dist[src] = 0; + + for (int count = 0; count < V - 1; count++) { + int u = minDistance(dist, sptSet); sptSet[u] = true; + for (int v = 0; v < V; v++) + + if (!sptSet[v] && graph[u][v] && dist[u] != INT_MAX + && dist[u] + graph[u][v] < dist[v]) dist[v] = dist[u] + graph[u][v]; + } + + printSolution(dist); +} +//main jadoogar hai mera naam goga +//mujh jaisa nahin koi hoga + +int main() +{ + int graph[V][V] = { { 0, 4, 0, 0, 0, 0, 0, 8, 0 }, + { 4, 0, 8, 0, 0, 0, 0, 11, 0 }, + { 0, 8, 0, 7, 0, 4, 0, 0, 2 }, + { 0, 0, 7, 0, 9, 14, 0, 0, 0 }, + { 0, 0, 0, 9, 0, 10, 0, 0, 0 }, + { 0, 0, 4, 14, 10, 0, 2, 0, 0 }, + { 0, 0, 0, 0, 0, 2, 0, 1, 6 }, + { 8, 11, 0, 0, 0, 0, 1, 0, 7 }, + { 0, 0, 2, 0, 0, 0, 6, 7, 0 } }; + + dijkstra(graph, 0); + + return 0; +} From 6bdc96a75a52e4ead633a0c888a732323b3f7316 Mon Sep 17 00:00:00 2001 From: Shambhav Goswami <56958751+shambhavgo@users.noreply.github.com> Date: Mon, 5 Oct 2020 00:34:18 +0530 Subject: [PATCH 3/5] Delete dj.cpp --- Special Contests/Good Bye 2019/dj.cpp | 88 --------------------------- 1 file changed, 88 deletions(-) delete mode 100644 Special Contests/Good Bye 2019/dj.cpp diff --git a/Special Contests/Good Bye 2019/dj.cpp b/Special Contests/Good Bye 2019/dj.cpp deleted file mode 100644 index 535de7b..0000000 --- a/Special Contests/Good Bye 2019/dj.cpp +++ /dev/null @@ -1,88 +0,0 @@ -#include -using namespace std; -#define inp(k) ll k;cin>>k; -#define in2(n, k) ll n, k; cin>>n;cin>>k; -#define ll long long -#define dl double -#define ch char -#define f(i,a,b) for(ll i=a;i=b;i--) -#define Godspeed ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); -#define vpl vector< pair > -#define vpi vector< pair > -#define vi vector -#define vl vector -#define vdl vector
-#define vch vector -#define pll pair -#define pb push_back -#define mp make_pair -#define fr first -#define se second -#define PI 3.14159265 -bool comp(pair &a,pair &b) -{ - return a.second > b.second; -} -#include -#include - -#define V 9 - -int minDistance(int dist[], bool sptSet[]) -{ - int min = INT_MAX, min_index; - - for (int v = 0; v < V; v++) - if (sptSet[v] == false && dist[v] <= min) - min = dist[v], min_index = v; - - return min_index; -} -//main jadoogar hai mera naam goga - -void printSolution(int dist[]) -{ - printf("Vertex \t\t Distance from Source\n"); - for (int i = 0; i < V; i++) - printf("%d \t\t %d\n", i, dist[i]); -} -//mujh jaisa nahin koi hoga -void dijkstra(int graph[V][V], int src) -{ - int dist[V]; - - bool sptSet[V]; - - for (int i = 0; i < V; i++) - dist[i] = INT_MAX, sptSet[i] = false; dist[src] = 0; - - for (int count = 0; count < V - 1; count++) { - int u = minDistance(dist, sptSet); sptSet[u] = true; - for (int v = 0; v < V; v++) - - if (!sptSet[v] && graph[u][v] && dist[u] != INT_MAX - && dist[u] + graph[u][v] < dist[v]) dist[v] = dist[u] + graph[u][v]; - } - - printSolution(dist); -} -//main jadoogar hai mera naam goga -//mujh jaisa nahin koi hoga - -int main() -{ - int graph[V][V] = { { 0, 4, 0, 0, 0, 0, 0, 8, 0 }, - { 4, 0, 8, 0, 0, 0, 0, 11, 0 }, - { 0, 8, 0, 7, 0, 4, 0, 0, 2 }, - { 0, 0, 7, 0, 9, 14, 0, 0, 0 }, - { 0, 0, 0, 9, 0, 10, 0, 0, 0 }, - { 0, 0, 4, 14, 10, 0, 2, 0, 0 }, - { 0, 0, 0, 0, 0, 2, 0, 1, 6 }, - { 8, 11, 0, 0, 0, 0, 1, 0, 7 }, - { 0, 0, 2, 0, 0, 0, 6, 7, 0 } }; - - dijkstra(graph, 0); - - return 0; -} From 1d9e37d9990c571476dfc50f4fc425db6c3311e3 Mon Sep 17 00:00:00 2001 From: Shambhav Goswami <56958751+shambhavgo@users.noreply.github.com> Date: Mon, 5 Oct 2020 00:41:06 +0530 Subject: [PATCH 4/5] Create D.cpp --- Normal Contests/645/D.cpp | 48 +++++++++++++++++++++++++++++++++++++++ 1 file changed, 48 insertions(+) create mode 100644 Normal Contests/645/D.cpp diff --git a/Normal Contests/645/D.cpp b/Normal Contests/645/D.cpp new file mode 100644 index 0000000..8c30f50 --- /dev/null +++ b/Normal Contests/645/D.cpp @@ -0,0 +1,48 @@ +#include +using namespace std; +#define inp(k) ll k;cin>>k; +#define in2(n, k) ll n, k; cin>>n;cin>>k; +#define ll long long +#define dl double +#define ch char +#define f(i,a,b) for(ll i=a;i=b;i--) +#define Godspeed ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); +#define vpl vector< pair > +#define vpi vector< pair > +#define vi vector +#define vl vector +#define vdl vector
+#define vch vector +#define pll pair +#define pb push_back +#define mp make_pair +#define fr first +#define se second +#define PI 3.14159265 +bool comp(pair &a,pair &b) +{ + return a.second > b.second; +} +#define int long long + +//main jadoogar hai mera naam goga + +signed main() { + int n, len; + cin >> n >> len; + vector A(2 * n); + for (int i = 0; i < n; i++) { + cin >> A[i]; + A[n + i] = A[i]; + } + n *= 2; + +//mujh jaisa nahin koi hoga + + vector B = {0}, C = {0}; + for (int i = 0; i < n; i++) B.push_back(B.back() + A[i]); + for (int i = 0; i < n; i++) C.push_back(C.back() + (A[i] * (A[i] + 1)) / 2);int ans = 0; + for (int i = 0; i < n; i++) {if (B[i + 1] >= len) {int z = upper_bound(B.begin(), B.end(), B[i + 1] - len) - B.begin();int cnt = C[i + 1] - C[z];int days = B[i + 1] - B[z];int too = len - days;cnt += ((A[z - 1] * (A[z - 1] + 1)) / 2);cnt -= (((A[z - 1] - too) * (A[z - 1] - too + 1)) / 2);ans = max(ans, cnt);}} + cout << ans; +} From 77cf676c540edb383df656ee914d79dc6c387d82 Mon Sep 17 00:00:00 2001 From: Shambhav Goswami <56958751+shambhavgo@users.noreply.github.com> Date: Mon, 5 Oct 2020 00:42:34 +0530 Subject: [PATCH 5/5] Delete D.cpp --- Normal Contests/645/D.cpp | 48 --------------------------------------- 1 file changed, 48 deletions(-) delete mode 100644 Normal Contests/645/D.cpp diff --git a/Normal Contests/645/D.cpp b/Normal Contests/645/D.cpp deleted file mode 100644 index 8c30f50..0000000 --- a/Normal Contests/645/D.cpp +++ /dev/null @@ -1,48 +0,0 @@ -#include -using namespace std; -#define inp(k) ll k;cin>>k; -#define in2(n, k) ll n, k; cin>>n;cin>>k; -#define ll long long -#define dl double -#define ch char -#define f(i,a,b) for(ll i=a;i=b;i--) -#define Godspeed ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); -#define vpl vector< pair > -#define vpi vector< pair > -#define vi vector -#define vl vector -#define vdl vector
-#define vch vector -#define pll pair -#define pb push_back -#define mp make_pair -#define fr first -#define se second -#define PI 3.14159265 -bool comp(pair &a,pair &b) -{ - return a.second > b.second; -} -#define int long long - -//main jadoogar hai mera naam goga - -signed main() { - int n, len; - cin >> n >> len; - vector A(2 * n); - for (int i = 0; i < n; i++) { - cin >> A[i]; - A[n + i] = A[i]; - } - n *= 2; - -//mujh jaisa nahin koi hoga - - vector B = {0}, C = {0}; - for (int i = 0; i < n; i++) B.push_back(B.back() + A[i]); - for (int i = 0; i < n; i++) C.push_back(C.back() + (A[i] * (A[i] + 1)) / 2);int ans = 0; - for (int i = 0; i < n; i++) {if (B[i + 1] >= len) {int z = upper_bound(B.begin(), B.end(), B[i + 1] - len) - B.begin();int cnt = C[i + 1] - C[z];int days = B[i + 1] - B[z];int too = len - days;cnt += ((A[z - 1] * (A[z - 1] + 1)) / 2);cnt -= (((A[z - 1] - too) * (A[z - 1] - too + 1)) / 2);ans = max(ans, cnt);}} - cout << ans; -}