Submission #1461124
Source Code Expand
#pragma region include #include <iostream> #include <iomanip> #include <stdio.h> #include <sstream> #include <algorithm> #include <cmath> #include <complex> #include <string> #include <cstring> #include <vector> #include <tuple> #include <bitset> #include <queue> #include <complex> #include <set> #include <map> #include <stack> #include <list> #include <fstream> #include <random> //#include <time.h> #include <ctime> #pragma endregion //#include ///////// #define REP(i, x, n) for(int i = x; i < n; ++i) #define rep(i,n) REP(i,0,n) #define ALL(X) X.begin(), X.end() ///////// #pragma region typedef typedef long long LL; typedef long double LD; typedef unsigned long long ULL; typedef std::pair<LL,LL> PLL;// typedef std::pair<int,int> PII;// #pragma endregion //typedef ////定数 const int INF = (int)1e9; const LL MOD = (LL)1e9+7; const LL LINF = (LL)1e18+20; const double PI = acos(-1.0); const double EPS = 1e-9; ///////// using namespace::std; void solve(){ int N; cin >> N; vector<int> A(N+1,0); int MAX = 0; for(int i=1;i<=N;++i){ cin >> A[i]; } LL ans = 0; for(int i=1;i<=N;++i){ int L,R; L = MAX + 1;//[0,i); R = A[i]; if( L < R ){ /* なるべくRを1にしたい(L以下) Lずつ削った時あまるのは [1,L-1] 一回は必ず削れるので L+L-1をけずればよい */ int cnt = (R-1)/L; ans += cnt; R = 1; } //A[i] = R; MAX = max(MAX,R); } cout << ans << endl; } #pragma region main signed main(void){ std::cin.tie(0); std::ios::sync_with_stdio(false); std::cout << std::fixed;//小数を10進数表示 cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別 solve(); } #pragma endregion //main()
Submission Info
Submission Time | |
---|---|
Task | D - Greedy customers |
User | akarin55 |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1803 Byte |
Status | AC |
Exec Time | 13 ms |
Memory | 640 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 | 640 KB |
02.txt | AC | 11 ms | 640 KB |
03.txt | AC | 13 ms | 640 KB |
04.txt | AC | 11 ms | 640 KB |
05.txt | AC | 9 ms | 640 KB |
06.txt | AC | 9 ms | 640 KB |
07.txt | AC | 8 ms | 640 KB |
08.txt | AC | 8 ms | 640 KB |
09.txt | AC | 8 ms | 640 KB |
10.txt | AC | 7 ms | 640 KB |
11.txt | AC | 7 ms | 640 KB |
12.txt | AC | 7 ms | 640 KB |
13.txt | AC | 11 ms | 640 KB |
14.txt | AC | 11 ms | 640 KB |
15.txt | AC | 11 ms | 640 KB |
16.txt | AC | 11 ms | 640 KB |
17.txt | AC | 11 ms | 640 KB |
18.txt | AC | 11 ms | 640 KB |
19.txt | AC | 11 ms | 640 KB |
20.txt | AC | 11 ms | 640 KB |
21.txt | AC | 9 ms | 640 KB |
22.txt | AC | 9 ms | 640 KB |
23.txt | AC | 9 ms | 640 KB |
24.txt | AC | 9 ms | 640 KB |
25.txt | AC | 9 ms | 640 KB |
26.txt | AC | 9 ms | 640 KB |
27.txt | AC | 9 ms | 640 KB |
28.txt | AC | 12 ms | 640 KB |
29.txt | AC | 7 ms | 640 KB |
30.txt | AC | 7 ms | 640 KB |
31.txt | AC | 7 ms | 640 KB |
32.txt | AC | 10 ms | 640 KB |
33.txt | AC | 10 ms | 640 KB |
34.txt | AC | 9 ms | 640 KB |
35.txt | AC | 9 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 |