Submission #1662553
Source Code Expand
#include <bits/stdc++.h> // iostream is too mainstream #include <cstdio> // bitch please #include <iostream> #include <algorithm> #include <cstdlib> #include <vector> #include <set> #include <map> #include <queue> #include <stack> #include <list> #include <cmath> #include <iomanip> #include <time.h> #define dibs reserve #define OVER9000 1234567890123456789LL #define ALL_THE(CAKE,LIE) for(auto LIE =CAKE.begin(); LIE != CAKE.end(); LIE++) #define tisic 47 #define soclose 1e-8 #define chocolate win // so much chocolate #define patkan 9 #define ff first #define ss second #define abs(x) ((x < 0)?-(x):x) #define uint unsigned int #define dbl long double #define pi 3.14159265358979323846 using namespace std; // mylittledoge typedef long long cat; #ifdef DONLINE_JUDGE // palindromic tree is better than splay tree! #define lld I64d #endif int main() { cin.sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(10); int N; cin >> N; long long ans; cin >> ans; ans--; int minP =2; for(int i =0; i < N-1; i++) { int a; cin >> a; if(a == minP) { minP++; continue; } if(a < minP) continue; ans +=(a-1)/minP; } cout << ans << "\n"; return 0;} // look at my code // my code is amazing
Submission Info
Submission Time | |
---|---|
Task | D - Greedy customers |
User | xellos |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1291 Byte |
Status | AC |
Exec Time | 12 ms |
Memory | 256 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 | 11 ms | 256 KB |
02.txt | AC | 11 ms | 256 KB |
03.txt | AC | 11 ms | 256 KB |
04.txt | AC | 11 ms | 256 KB |
05.txt | AC | 9 ms | 256 KB |
06.txt | AC | 9 ms | 256 KB |
07.txt | AC | 8 ms | 256 KB |
08.txt | AC | 8 ms | 256 KB |
09.txt | AC | 7 ms | 256 KB |
10.txt | AC | 8 ms | 256 KB |
11.txt | AC | 7 ms | 256 KB |
12.txt | AC | 7 ms | 256 KB |
13.txt | AC | 11 ms | 256 KB |
14.txt | AC | 11 ms | 256 KB |
15.txt | AC | 11 ms | 256 KB |
16.txt | AC | 11 ms | 256 KB |
17.txt | AC | 11 ms | 256 KB |
18.txt | AC | 11 ms | 256 KB |
19.txt | AC | 11 ms | 256 KB |
20.txt | AC | 11 ms | 256 KB |
21.txt | AC | 9 ms | 256 KB |
22.txt | AC | 9 ms | 256 KB |
23.txt | AC | 9 ms | 256 KB |
24.txt | AC | 9 ms | 256 KB |
25.txt | AC | 9 ms | 256 KB |
26.txt | AC | 9 ms | 256 KB |
27.txt | AC | 9 ms | 256 KB |
28.txt | AC | 12 ms | 256 KB |
29.txt | AC | 7 ms | 256 KB |
30.txt | AC | 7 ms | 256 KB |
31.txt | AC | 7 ms | 256 KB |
32.txt | AC | 10 ms | 256 KB |
33.txt | AC | 10 ms | 256 KB |
34.txt | AC | 9 ms | 256 KB |
35.txt | AC | 9 ms | 256 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 |