Submission #1272554
Source Code Expand
#include <iostream> #include <iomanip> #include <cstdio> #include <string> #include <cstring> #include <deque> #include <list> #include <queue> #include <stack> #include <vector> #include <utility> #include <algorithm> #include <map> #include <set> #include <complex> #include <cmath> #include <limits> #include <cfloat> #include <climits> #include <ctime> #include <cassert> #include <numeric> using namespace std; #define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++) #define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++) #define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--) #define all(v) begin(v), end(v) #define pb(a) push_back(a) #define fr first #define sc second #define INF 2000000000 #define int long long int #define X real() #define Y imag() #define EPS (1e-10) #define EQ(a,b) (abs((a) - (b)) < EPS) #define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) ) #define LE(n, m) ((n) < (m) + EPS) #define LEQ(n, m) ((n) <= (m) + EPS) #define GE(n, m) ((n) + EPS > (m)) #define GEQ(n, m) ((n) + EPS >= (m)) typedef vector<int> VI; typedef vector<VI> MAT; typedef pair<int, int> pii; typedef long long ll; typedef complex<double> P; typedef pair<P, P> L; typedef pair<P, double> C; int dx[]={1, -1, 0, 0}; int dy[]={0, 0, 1, -1}; int const MOD = 1000000007; ll mod_pow(ll x, ll n) {return (!n)?1:(mod_pow((x*x)%MOD,n/2)*((n&1)?x:1))%MOD;} int madd(int a, int b) {return (a + b) % MOD;} int msub(int a, int b) {return (a - b + MOD) % MOD;} int mmul(int a, int b) {return (a * b) % MOD;} int minv(int a) {return mod_pow(a, MOD-2);} int mdiv(int a, int b) {return mmul(a, minv(b));} namespace std { bool operator<(const P& a, const P& b) { return a.X != b.X ? a.X < b.X : a.Y < b.Y; } } int n, a[100010]; signed main() { cin >> n; repq(i,1,n) cin >> a[i]; int ans = 0, mi = 1; repq(i,1,n) { if(a[i] < mi) continue; else if(a[i] == mi) mi++; else { ans += (a[i] - 1) / mi; a[i] -= (a[i] - 1) / mi * mi; if(a[i] == mi) a[i] = 1; mi = max(mi, a[i] + 1); } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Greedy customers |
User | tsutaj |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 2207 Byte |
Status | AC |
Exec Time | 44 ms |
Memory | 1024 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 | 42 ms | 1024 KB |
02.txt | AC | 42 ms | 1024 KB |
03.txt | AC | 42 ms | 1024 KB |
04.txt | AC | 42 ms | 1024 KB |
05.txt | AC | 26 ms | 1024 KB |
06.txt | AC | 27 ms | 1024 KB |
07.txt | AC | 24 ms | 1024 KB |
08.txt | AC | 23 ms | 1024 KB |
09.txt | AC | 19 ms | 1024 KB |
10.txt | AC | 19 ms | 1024 KB |
11.txt | AC | 17 ms | 1024 KB |
12.txt | AC | 17 ms | 1024 KB |
13.txt | AC | 35 ms | 1024 KB |
14.txt | AC | 40 ms | 1024 KB |
15.txt | AC | 38 ms | 1024 KB |
16.txt | AC | 35 ms | 1024 KB |
17.txt | AC | 35 ms | 1024 KB |
18.txt | AC | 35 ms | 1024 KB |
19.txt | AC | 35 ms | 1024 KB |
20.txt | AC | 35 ms | 1024 KB |
21.txt | AC | 31 ms | 1024 KB |
22.txt | AC | 31 ms | 1024 KB |
23.txt | AC | 28 ms | 1024 KB |
24.txt | AC | 29 ms | 1024 KB |
25.txt | AC | 29 ms | 1024 KB |
26.txt | AC | 29 ms | 1024 KB |
27.txt | AC | 31 ms | 1024 KB |
28.txt | AC | 44 ms | 1024 KB |
29.txt | AC | 16 ms | 1024 KB |
30.txt | AC | 17 ms | 1024 KB |
31.txt | AC | 18 ms | 1024 KB |
32.txt | AC | 31 ms | 1024 KB |
33.txt | AC | 31 ms | 1024 KB |
34.txt | AC | 24 ms | 1024 KB |
35.txt | AC | 24 ms | 1024 KB |
36.txt | AC | 1 ms | 256 KB |
37.txt | AC | 1 ms | 256 KB |
38.txt | AC | 1 ms | 256 KB |
39.txt | AC | 1 ms | 256 KB |
40.txt | AC | 1 ms | 256 KB |
41.txt | AC | 1 ms | 256 KB |
42.txt | AC | 1 ms | 256 KB |
43.txt | AC | 1 ms | 256 KB |
44.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |