Submission #1842311
Source Code Expand
#include <algorithm> #include <climits> #include <cmath> #include <cstdio> #include <cstdlib> #include <ctime> #include <iostream> #include <sstream> #include <functional> #include <map> #include <string> #include <cstring> #include <vector> #include <queue> #include <stack> #include <deque> #include <set> #include <list> #include <numeric> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<ll,ll> P; const double PI = 3.14159265358979323846; const double EPS = 1e-12; const ll INF = 1LL<<29; const ll mod = 1e9+7; #define rep(i,n) for(int (i)=0;(i)<(ll)(n);++(i)) #define repd(i,n,d) for(ll (i)=0;(i)<(ll)(n);(i)+=(d)) #define all(v) (v).begin(), (v).end() #define pb(x) push_back(x) #define mp(x,y) make_pair((x),(y)) #define mset(m,v) memset((m),(v),sizeof(m)) #define chmin(X,Y) ((X)>(Y)?X=(Y),true:false) #define chmax(X,Y) ((X)<(Y)?X=(Y),true:false) #define fst first #define snd second #define UNIQUE(x) (x).erase(unique(all(x)),(x).end()) template<class T> ostream &operator<<(ostream &os, const vector<T> &v){int n=v.size();rep(i,n)os<<v[i]<<(i==n-1?"":" ");return os;} #define N 100000 int a[N]; int main(){ int n; scanf("%d", &n); rep(i, n) scanf("%d", a+i); ll res = 0; int mn = 0; rep(i, n){ ll t = mn+1; ll r = (a[i]-1)/t; res += r; if(r) a[i] = 1; mn = max(mn, a[i]); } cout<<res<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Greedy customers |
User | Lepton |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1430 Byte |
Status | AC |
Exec Time | 14 ms |
Memory | 640 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:44:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &n); ^ ./Main.cpp:45:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] rep(i, n) scanf("%d", a+i); ^
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 | 14 ms | 640 KB |
02.txt | AC | 14 ms | 640 KB |
03.txt | AC | 14 ms | 640 KB |
04.txt | AC | 14 ms | 640 KB |
05.txt | AC | 11 ms | 640 KB |
06.txt | AC | 11 ms | 640 KB |
07.txt | AC | 11 ms | 640 KB |
08.txt | AC | 11 ms | 640 KB |
09.txt | AC | 10 ms | 640 KB |
10.txt | AC | 10 ms | 640 KB |
11.txt | AC | 10 ms | 640 KB |
12.txt | AC | 10 ms | 640 KB |
13.txt | AC | 14 ms | 640 KB |
14.txt | AC | 14 ms | 640 KB |
15.txt | AC | 13 ms | 640 KB |
16.txt | AC | 14 ms | 640 KB |
17.txt | AC | 14 ms | 640 KB |
18.txt | AC | 14 ms | 640 KB |
19.txt | AC | 14 ms | 640 KB |
20.txt | AC | 14 ms | 640 KB |
21.txt | AC | 12 ms | 640 KB |
22.txt | AC | 12 ms | 640 KB |
23.txt | AC | 12 ms | 640 KB |
24.txt | AC | 12 ms | 640 KB |
25.txt | AC | 12 ms | 640 KB |
26.txt | AC | 12 ms | 640 KB |
27.txt | AC | 12 ms | 640 KB |
28.txt | AC | 14 ms | 640 KB |
29.txt | AC | 10 ms | 640 KB |
30.txt | AC | 10 ms | 640 KB |
31.txt | AC | 10 ms | 640 KB |
32.txt | AC | 13 ms | 640 KB |
33.txt | AC | 13 ms | 640 KB |
34.txt | AC | 11 ms | 640 KB |
35.txt | AC | 11 ms | 640 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 |