Submission #1162947
Source Code Expand
#include <iostream> #include <cstdio> #include <algorithm> #include <string> #include <vector> #include <queue> #include <map> #include <set> #include <functional> #include <cmath> #include <complex> #include <cctype> #include <cassert> #include <sstream> #include <ctime> using namespace std; #define FOR(i,a,b) for(int i=(a);i<(b);i++) #define REP(i,n) FOR(i,0,n) #define ALL(v) (v).begin(),(v).end() template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; } template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; } typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<int, pii> P; typedef vector<pii> vp; #define INF (1<<29) #define INFL (1ll<<60) #define EPS (1e-8) #define PI (acos(-1)) const ll MOD = 1000000007ll; int n; int a[112345]; int main() { cin >> n; REP(i, n) scanf("%d", a + i); ll ans = 0, ma = 1; REP(i, n) { if (a[i] < ma) continue; ll now = (a[i] + ma - 1) / ma - 1; ans += now; if (now >= 1) { a[i] -= ma * (now - 1); a[i] = 1; } if (a[i] == ma) ma++; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Greedy customers |
User | tkmst201 |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1251 Byte |
Status | AC |
Exec Time | 14 ms |
Memory | 640 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:43:30: 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 | 13 ms | 640 KB |
02.txt | AC | 13 ms | 640 KB |
03.txt | AC | 13 ms | 640 KB |
04.txt | AC | 13 ms | 640 KB |
05.txt | AC | 11 ms | 640 KB |
06.txt | AC | 11 ms | 640 KB |
07.txt | AC | 10 ms | 640 KB |
08.txt | AC | 10 ms | 640 KB |
09.txt | AC | 9 ms | 640 KB |
10.txt | AC | 9 ms | 640 KB |
11.txt | AC | 9 ms | 640 KB |
12.txt | AC | 9 ms | 640 KB |
13.txt | AC | 13 ms | 640 KB |
14.txt | AC | 13 ms | 640 KB |
15.txt | AC | 13 ms | 640 KB |
16.txt | AC | 13 ms | 640 KB |
17.txt | AC | 13 ms | 640 KB |
18.txt | AC | 13 ms | 640 KB |
19.txt | AC | 13 ms | 640 KB |
20.txt | AC | 13 ms | 640 KB |
21.txt | AC | 12 ms | 640 KB |
22.txt | AC | 12 ms | 640 KB |
23.txt | AC | 11 ms | 640 KB |
24.txt | AC | 11 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 | 9 ms | 640 KB |
30.txt | AC | 9 ms | 640 KB |
31.txt | AC | 10 ms | 640 KB |
32.txt | AC | 12 ms | 640 KB |
33.txt | AC | 12 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 |