Submission #1442137
Source Code Expand
#include <stdio.h> #include <stdlib.h> #include <string.h> #include <memory.h> #include <math.h> #include <assert.h> #include <queue> #include <map> #include <set> #include <string> #include <algorithm> #include <iostream> #include <functional> #include <unordered_map> #include <unordered_set> #include <list> #include <bitset> using namespace std; typedef pair<int, int> pii; typedef long long ll; #define Fi first #define Se second #define pb(x) push_back(x) #define sz(x) ((int)(x).size()) #define rep(i, n) for(int i=0;i<n;i++) #define all(x) (x).begin(), (x).end() typedef tuple<int, int, int> t3; typedef pair<ll, ll> pll; typedef long double ldouble; typedef pair<double, double> pdd; int n, A[200020]; void solve(){ scanf("%d", &n); for(int i=1;i<=n;i++) scanf("%d", A+i); ll ans = 0; for(int i=1, p=1;i<=n;i++) { int t = (A[i] - 1) / p; ans += t; if(A[i] == p) ++p; } printf("%lld\n", ans); } int main(){ int T = 1; // scanf("%d", &T); while(T--) { solve(); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Greedy customers |
User | molamola |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1060 Byte |
Status | WA |
Exec Time | 13 ms |
Memory | 640 KB |
Compile Error
./Main.cpp: In function ‘void solve()’: ./Main.cpp:36:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &n); ^ ./Main.cpp:37:40: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for(int i=1;i<=n;i++) scanf("%d", A+i); ^
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 13 ms | 640 KB |
02.txt | WA | 13 ms | 640 KB |
03.txt | WA | 13 ms | 640 KB |
04.txt | WA | 13 ms | 640 KB |
05.txt | WA | 10 ms | 640 KB |
06.txt | WA | 10 ms | 640 KB |
07.txt | WA | 9 ms | 640 KB |
08.txt | WA | 9 ms | 640 KB |
09.txt | WA | 9 ms | 640 KB |
10.txt | WA | 9 ms | 640 KB |
11.txt | WA | 9 ms | 640 KB |
12.txt | WA | 9 ms | 640 KB |
13.txt | WA | 12 ms | 640 KB |
14.txt | WA | 12 ms | 640 KB |
15.txt | WA | 12 ms | 640 KB |
16.txt | WA | 12 ms | 640 KB |
17.txt | AC | 12 ms | 640 KB |
18.txt | AC | 12 ms | 640 KB |
19.txt | AC | 12 ms | 640 KB |
20.txt | AC | 12 ms | 640 KB |
21.txt | WA | 11 ms | 640 KB |
22.txt | WA | 11 ms | 640 KB |
23.txt | AC | 11 ms | 640 KB |
24.txt | AC | 11 ms | 640 KB |
25.txt | AC | 11 ms | 640 KB |
26.txt | WA | 11 ms | 640 KB |
27.txt | WA | 10 ms | 640 KB |
28.txt | WA | 13 ms | 640 KB |
29.txt | AC | 9 ms | 640 KB |
30.txt | WA | 9 ms | 640 KB |
31.txt | WA | 9 ms | 640 KB |
32.txt | WA | 11 ms | 640 KB |
33.txt | WA | 11 ms | 640 KB |
34.txt | AC | 10 ms | 640 KB |
35.txt | AC | 10 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 | WA | 1 ms | 256 KB |
41.txt | AC | 1 ms | 256 KB |
42.txt | WA | 1 ms | 256 KB |
43.txt | WA | 1 ms | 256 KB |
44.txt | AC | 1 ms | 256 KB |
s1.txt | WA | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |