Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 14456b8

Browse files
Add submissions for JUNE17
1 parent e3f50d2 commit 14456b8

File tree

7 files changed

+968
-0
lines changed

7 files changed

+968
-0
lines changed

‎LongChallenge/June17/GOODSET.cpp

Lines changed: 69 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,69 @@
1+
/*
2+
* Deleted code is debugged code :)
3+
*/
4+
#include <bits/stdc++.h>
5+
#define ll long long
6+
#define ull unsigned long long
7+
#define vi vector<ll>
8+
#define pp pair<ll,ll>
9+
#define mp make_pair
10+
#define PI acos(-1.0)
11+
#define all(v) v.begin(),v.end()
12+
#define pb push_back
13+
#define FOR(i,a,b) for(i=a;i<b;i++)
14+
#define FREV(i,a,b) for(i=a;i>=b;i--)
15+
#define SULL(n) scanf("%llu", &n)
16+
#define INF 1e18
17+
#define MOD 1000000007
18+
19+
#ifndef ONLINE_JUDGE
20+
#define gc getchar
21+
#define pc putchar
22+
#else
23+
#define gc getchar_unlocked
24+
#define pc putchar_unlocked
25+
#endif
26+
27+
using namespace std;
28+
29+
int read_int() {
30+
char c = gc();
31+
while((c < '0' || c > '9') && c != '-') c = gc();
32+
int ret = 0, neg = 0;
33+
if (c == '-') neg = 1, c = gc();
34+
while(c >= '0' && c <= '9') {
35+
ret = 10 * ret + c - 48;
36+
c = gc();
37+
}
38+
return neg ? -ret : ret;
39+
}
40+
41+
ll read_ll() {
42+
char c = gc();
43+
while((c < '0' || c > '9') && c != '-') c = gc();
44+
ll ret = 0;
45+
int neg = 0;
46+
if (c == '-') neg = 1, c = gc();
47+
while(c >= '0' && c <= '9') {
48+
ret = 10 * ret + c - 48;
49+
c = gc();
50+
}
51+
return neg ? -ret : ret;
52+
}
53+
54+
/*******************************************RANDOM STUFF BEGINS HERE**************************************************/
55+
56+
int main() {
57+
ll i,j,t,n;
58+
t = read_ll();
59+
while(t--) {
60+
n = read_ll();
61+
j = 1;
62+
FOR(i,0,n) {
63+
printf("%lld ", j);
64+
j += 2;
65+
}
66+
printf("\n");
67+
}
68+
return 0;
69+
}

‎LongChallenge/June17/NEO01.cpp

Lines changed: 96 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,96 @@
1+
/*
2+
* Deleted code is debugged code :)
3+
*/
4+
#include <bits/stdc++.h>
5+
#define ll long long
6+
#define ull unsigned long long
7+
#define vi vector<ll>
8+
#define pp pair<ll,ll>
9+
#define mp make_pair
10+
#define PI acos(-1.0)
11+
#define all(v) v.begin(),v.end()
12+
#define pb push_back
13+
#define FOR(i,a,b) for(i=a;i<b;i++)
14+
#define FREV(i,a,b) for(i=a;i>=b;i--)
15+
#define SULL(n) scanf("%llu", &n)
16+
#define INF 1e18
17+
#define MOD 1000000007
18+
19+
#ifndef ONLINE_JUDGE
20+
#define gc getchar
21+
#define pc putchar
22+
#else
23+
#define gc getchar_unlocked
24+
#define pc putchar_unlocked
25+
#endif
26+
27+
using namespace std;
28+
29+
int read_int() {
30+
char c = gc();
31+
while((c < '0' || c > '9') && c != '-') c = gc();
32+
int ret = 0, neg = 0;
33+
if (c == '-') neg = 1, c = gc();
34+
while(c >= '0' && c <= '9') {
35+
ret = 10 * ret + c - 48;
36+
c = gc();
37+
}
38+
return neg ? -ret : ret;
39+
}
40+
41+
ll read_ll() {
42+
char c = gc();
43+
while((c < '0' || c > '9') && c != '-') c = gc();
44+
ll ret = 0;
45+
int neg = 0;
46+
if (c == '-') neg = 1, c = gc();
47+
while(c >= '0' && c <= '9') {
48+
ret = 10 * ret + c - 48;
49+
c = gc();
50+
}
51+
return neg ? -ret : ret;
52+
}
53+
54+
/*******************************************RANDOM STUFF BEGINS HERE**************************************************/
55+
56+
bool comp(ll a, ll b) {
57+
return a > b;
58+
}
59+
60+
ll a[100005], prefix[100005];
61+
62+
int main() {
63+
ll i,j,t,n,contrib,res;
64+
t = read_ll();
65+
while(t--) {
66+
n = read_ll();
67+
FOR(i,0,n) {
68+
a[i] = read_ll();
69+
}
70+
sort(a,a+n,comp);
71+
72+
prefix[0] = a[0];
73+
FOR(i,1,n) {
74+
prefix[i] = prefix[i-1] + a[i];
75+
}
76+
// all negative
77+
if (a[0] <= 0) {
78+
printf("%lld\n", prefix[n-1]);
79+
continue;
80+
}
81+
// all positive
82+
if (a[n-1] >= 0) {
83+
printf("%lld\n", prefix[n-1] * n);
84+
continue;
85+
}
86+
FOR(i,1,n) {
87+
contrib = prefix[i-1] + (i+1) * a[i];
88+
if (contrib < 0 && contrib < a[i]) {
89+
break;
90+
}
91+
}
92+
res = prefix[i-1] * i + (prefix[n-1] - prefix[i-1]);
93+
printf("%lld\n", res);
94+
}
95+
return 0;
96+
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /