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 0e98402

Browse files
Add SPOJ submissions
1 parent f768998 commit 0e98402

File tree

3 files changed

+201
-0
lines changed

3 files changed

+201
-0
lines changed
File renamed without changes.

‎SPOJ/aggrcow.cpp

Lines changed: 101 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,101 @@
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 READ(a,i,n) FOR(i,0,n) { a[i] = read_ll();}
16+
#define DEBUG(x) cerr<<"In file "<< __FILE__ <<" at line "<< __LINE__ <<" :: "<< #x <<" = "<<x<<endl
17+
#define SULL(n) scanf("%llu", &n)
18+
#define INF 1e18
19+
#define MOD 1000000007
20+
21+
#ifndef ONLINE_JUDGE
22+
#define gc getchar
23+
#define pc putchar
24+
#else
25+
#define gc getchar_unlocked
26+
#define pc putchar_unlocked
27+
#endif
28+
29+
using namespace std;
30+
31+
int read_int() {
32+
char c = gc();
33+
while((c < '0' || c > '9') && c != '-') c = gc();
34+
int ret = 0, neg = 0;
35+
if (c == '-') neg = 1, c = gc();
36+
while(c >= '0' && c <= '9') {
37+
ret = 10 * ret + c - 48;
38+
c = gc();
39+
}
40+
return neg ? -ret : ret;
41+
}
42+
43+
ll read_ll() {
44+
char c = gc();
45+
while((c < '0' || c > '9') && c != '-') c = gc();
46+
ll ret = 0;
47+
int neg = 0;
48+
if (c == '-') neg = 1, c = gc();
49+
while(c >= '0' && c <= '9') {
50+
ret = 10 * ret + c - 48;
51+
c = gc();
52+
}
53+
return neg ? -ret : ret;
54+
}
55+
56+
/*******************************************RANDOM STUFF BEGINS HERE**************************************************/
57+
58+
vector<ll> stalls;
59+
60+
bool check_for_x(ll x, ll n, ll c) {
61+
ll i, cow_count = 1, lastpos = stalls[0];
62+
FOR(i,1,n) {
63+
if (stalls[i] - lastpos >= x) {
64+
cow_count += 1;
65+
if (cow_count == c)
66+
return true;
67+
lastpos = stalls[i];
68+
}
69+
}
70+
return false;
71+
}
72+
73+
ll solve(ll n, ll c) {
74+
ll mid, res, beg = 0, last = stalls[n-1] - stalls[0] + 1;
75+
while (beg <= last) {
76+
mid = beg + (last-beg)/2;
77+
if (check_for_x(mid, n, c)) {
78+
res = mid;
79+
beg = mid + 1;
80+
}
81+
else
82+
last = mid - 1;
83+
}
84+
return res;
85+
}
86+
87+
int main() {
88+
ll i,j,t,n,c;
89+
t = read_ll();
90+
while (t--) {
91+
n = read_ll();
92+
c = read_ll();
93+
stalls.resize(n);
94+
FOR(i,0,n) {
95+
stalls[i] = read_ll();
96+
}
97+
sort(all(stalls));
98+
cout << solve(n,c) << "\n";
99+
}
100+
return 0;
101+
}

‎SPOJ/ballot.cpp

Lines changed: 100 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,100 @@
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 READ(a,i,n) FOR(i,0,n) { a[i] = read_ll();}
16+
#define DEBUG(x) cerr<<"In file "<< __FILE__ <<" at line "<< __LINE__ <<" :: "<< #x <<" = "<<x<<endl
17+
#define SULL(n) scanf("%llu", &n)
18+
#define INF 1e18
19+
#define MOD 1000000007
20+
21+
#ifndef ONLINE_JUDGE
22+
#define gc getchar
23+
#define pc putchar
24+
#else
25+
#define gc getchar_unlocked
26+
#define pc putchar_unlocked
27+
#endif
28+
29+
using namespace std;
30+
31+
int read_int() {
32+
char c = gc();
33+
while((c < '0' || c > '9') && c != '-') c = gc();
34+
int ret = 0, neg = 0;
35+
if (c == '-') neg = 1, c = gc();
36+
while(c >= '0' && c <= '9') {
37+
ret = 10 * ret + c - 48;
38+
c = gc();
39+
}
40+
return neg ? -ret : ret;
41+
}
42+
43+
ll read_ll() {
44+
char c = gc();
45+
while((c < '0' || c > '9') && c != '-') c = gc();
46+
ll ret = 0;
47+
int neg = 0;
48+
if (c == '-') neg = 1, c = gc();
49+
while(c >= '0' && c <= '9') {
50+
ret = 10 * ret + c - 48;
51+
c = gc();
52+
}
53+
return neg ? -ret : ret;
54+
}
55+
56+
/*******************************************RANDOM STUFF BEGINS HERE**************************************************/
57+
58+
vector<ll> people;
59+
60+
bool check_for_x(ll x, ll n, ll b) {
61+
ll i, box_count = 0;
62+
FOR(i,0,n) {
63+
box_count += people[i]/x + (people[i]%x?1:0);
64+
if (box_count > b)
65+
return false;
66+
}
67+
return true;
68+
}
69+
70+
ll solve(ll n, ll b) {
71+
ll mid, res, beg = 1, last = *max_element(all(people));
72+
while (beg <= last) {
73+
mid = beg + (last-beg)/2;
74+
if (check_for_x(mid, n, b)) {
75+
res = mid;
76+
last = mid - 1;
77+
}
78+
else {
79+
beg = mid + 1;
80+
}
81+
}
82+
return res;
83+
}
84+
85+
int main() {
86+
ll i,j,t,n,b;
87+
while (1) {
88+
n = read_ll();
89+
b = read_ll();
90+
if (n == -1 and b == -1)
91+
break;
92+
93+
people.resize(n);
94+
FOR(i,0,n) {
95+
people[i] = read_ll();
96+
}
97+
cout << solve(n,b) << "\n";
98+
}
99+
return 0;
100+
}

0 commit comments

Comments
(0)

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