Submission #3240011
Source Code Expand
#include <iostream> #include <stdio.h> #include <fstream> #include <algorithm> #include <string> #include <map> #include <set> #include <queue> #include <stack> #include <vector> #include <limits.h> #include <math.h> #include <functional> #include <bitset> #define repeat(i,n) for (long long i = 0; (i) < (n); ++ (i)) #define debug(x) cerr << #x << ": " << x << '\n' #define debugArray(x,n) for(long long i = 0; (i) < (n); ++ (i)) cerr << #x << "[" << i << "]: " << x[i] << '\n' #define debugArrayP(x,n) for(long long i = 0; (i) < (n); ++ (i)) cerr << #x << "[" << i << "]: " << x[i].first<< " " << x[i].second << '\n' using namespace std; typedef long long ll; typedef pair<int,int> Pii; typedef vector<int> vint; typedef vector<ll> vll; const ll INF = LLONG_MAX/10; const ll MOD = 1e9+7; int main(){ ll N;cin >> N; vll A(N); repeat(i,N){ cin >> A[i]; } ll ans = 0; ll maxA = 0; repeat(i,N){ ans += (A[i]-1)/(maxA+1); if(i==0||A[i] == maxA+1){ maxA++; } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Greedy customers |
User | hashiryo |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1082 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 | 41 ms | 1024 KB |
02.txt | AC | 41 ms | 1024 KB |
03.txt | AC | 41 ms | 1024 KB |
04.txt | AC | 41 ms | 1024 KB |
05.txt | AC | 26 ms | 1024 KB |
06.txt | AC | 26 ms | 1024 KB |
07.txt | AC | 23 ms | 1024 KB |
08.txt | AC | 23 ms | 1024 KB |
09.txt | AC | 20 ms | 1024 KB |
10.txt | AC | 20 ms | 1024 KB |
11.txt | AC | 18 ms | 1024 KB |
12.txt | AC | 18 ms | 1024 KB |
13.txt | AC | 35 ms | 1024 KB |
14.txt | AC | 35 ms | 1024 KB |
15.txt | AC | 35 ms | 1024 KB |
16.txt | AC | 35 ms | 1024 KB |
17.txt | AC | 35 ms | 1024 KB |
18.txt | AC | 36 ms | 1024 KB |
19.txt | AC | 35 ms | 1024 KB |
20.txt | AC | 36 ms | 1024 KB |
21.txt | AC | 31 ms | 1024 KB |
22.txt | AC | 31 ms | 1024 KB |
23.txt | AC | 30 ms | 1024 KB |
24.txt | AC | 30 ms | 1024 KB |
25.txt | AC | 30 ms | 1024 KB |
26.txt | AC | 30 ms | 1024 KB |
27.txt | AC | 33 ms | 1024 KB |
28.txt | AC | 44 ms | 1024 KB |
29.txt | AC | 18 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 | 25 ms | 1024 KB |
35.txt | AC | 25 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 |