Submission #4030018
Source Code Expand
#include <iostream>
#include <cassert>
#include <climits>
#include <bitset>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
#include <tuple>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
long long int INF = 1e18;
long long int mod = 1000000007;
double Pi = 3.1415926535897932384626;
vector<ll> G[500005];
vector<P> tree[500010];
priority_queue <ll> pql;
priority_queue <P> pqp;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
priority_queue <P,vector<P>,greater<P> > pqps;
//small priority queue
//top pop
int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "RULD";
//↓,→,↑,←
#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<x<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<x;
#define re(i,n) for(i=0;i<n;i++);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define deba(x) cout<< #x << " = " << x <<endl
ll rui(ll number1,ll number2){
if(number2 == 0){
return 1;
}else{
ll number3 = rui(number1,number2 / 2);
number3 *= number3;
number3 %= mod;
if(number2%2==1){
number3 *= number1;
number3 %= mod;
}
return number3;
}
}
ll gcd(ll number1,ll number2){
if(number1 > number2){
swap(number1 , number2);
}
if(number1 == 0 || number1 == number2){
return number2;
}else{
return gcd(number2 % number1 , number1);
}
}
ll i,j,k,ii,jj,n,m;
ll a,b,c,d,e,g,h,r,num,sum,ans;
ll x[500005],y[500005],z[500005];
bool dame;
int main(){
cin >> n;
for(i=0;i<n;i++){
cin >> x[i];
}
num = 0;
ll maxnum = 0;
while(1){
ans += (x[num]-1)/(maxnum + 1);
if((x[num]-1)/(maxnum + 1) > 0 && num != 0){
x[num] = maxnum;
}else{
x[num] -= (maxnum + 1) * ((x[num]-1)/(maxnum + 1));
}
maxnum = max(maxnum,x[num]);
num++;
if(num == n)break;
for(i=0;i<n;i++){
//pe(x[i]);
}
//el;
}
p(ans);
return 0;
}
Submission Info
Submission Time |
|
Task |
D - Greedy customers |
User |
enjapma |
Language |
C++14 (GCC 5.4.1) |
Score |
700 |
Code Size |
2406 Byte |
Status |
AC |
Exec Time |
54 ms |
Memory |
29312 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
700 / 700 |
Status |
|
|
Set Name |
Test Cases |
Sample |
s1.txt, s2.txt |
All |
01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, s1.txt, s2.txt |
Case Name |
Status |
Exec Time |
Memory |
01.txt |
AC |
51 ms |
29312 KB |
02.txt |
AC |
51 ms |
29312 KB |
03.txt |
AC |
52 ms |
29312 KB |
04.txt |
AC |
51 ms |
29312 KB |
05.txt |
AC |
36 ms |
29312 KB |
06.txt |
AC |
36 ms |
29312 KB |
07.txt |
AC |
34 ms |
29312 KB |
08.txt |
AC |
33 ms |
29312 KB |
09.txt |
AC |
31 ms |
29312 KB |
10.txt |
AC |
31 ms |
29312 KB |
11.txt |
AC |
28 ms |
29312 KB |
12.txt |
AC |
28 ms |
29312 KB |
13.txt |
AC |
46 ms |
29312 KB |
14.txt |
AC |
46 ms |
29312 KB |
15.txt |
AC |
45 ms |
29312 KB |
16.txt |
AC |
45 ms |
29312 KB |
17.txt |
AC |
46 ms |
29312 KB |
18.txt |
AC |
46 ms |
29312 KB |
19.txt |
AC |
46 ms |
29312 KB |
20.txt |
AC |
46 ms |
29312 KB |
21.txt |
AC |
41 ms |
29312 KB |
22.txt |
AC |
41 ms |
29312 KB |
23.txt |
AC |
40 ms |
29312 KB |
24.txt |
AC |
40 ms |
29312 KB |
25.txt |
AC |
40 ms |
29312 KB |
26.txt |
AC |
39 ms |
29312 KB |
27.txt |
AC |
39 ms |
29312 KB |
28.txt |
AC |
54 ms |
29312 KB |
29.txt |
AC |
28 ms |
29312 KB |
30.txt |
AC |
27 ms |
29312 KB |
31.txt |
AC |
27 ms |
29312 KB |
32.txt |
AC |
42 ms |
29312 KB |
33.txt |
AC |
42 ms |
29312 KB |
34.txt |
AC |
35 ms |
29312 KB |
35.txt |
AC |
36 ms |
29312 KB |
36.txt |
AC |
11 ms |
27264 KB |
37.txt |
AC |
10 ms |
27264 KB |
38.txt |
AC |
10 ms |
27264 KB |
39.txt |
AC |
10 ms |
27264 KB |
40.txt |
AC |
10 ms |
27264 KB |
41.txt |
AC |
10 ms |
27264 KB |
42.txt |
AC |
10 ms |
27264 KB |
43.txt |
AC |
10 ms |
27264 KB |
44.txt |
AC |
10 ms |
27264 KB |
s1.txt |
AC |
10 ms |
27264 KB |
s2.txt |
AC |
11 ms |
27264 KB |