Submission #1820458
Source Code Expand
#include<cstdio>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<map>
#include<cstring>
#include<complex>
#include<cmath>
#include<algorithm>
#include<list>
#include<functional>
#define mp make_pair
#define X first
#define Y second
#define INF 1987654321987654321
#define PI 3.14159265358979323846264
#define MOD 20091101
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset(a,0,sizeof(a));
#define MEM_1(a) memset(a,-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef complex<double> base;
ll POW(ll a, ll b) { if (b == 0)return 1; if (b == 1)return a; if (b & 1)return (a*POW(a, b - 1)) % MOD; ll t = POW(a, b / 2); return (t*t) % MOD; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
int dx[] = { 0,-1,1,0 }, dy[] = { 1,0,0,-1 };//동북남서
int a[100000];
int main() {
int n;
scanf("%d", &n);
fup(i, 0, n - 1, 1)
scanf("%d", a + i);
int now = 2;
ll ans = a[0] - 1;
fup(i, 1, n - 1, 1)
{
if (a[i] == now)
now++;
else
ans += (a[i] - 1) / now;
}
printf("%lld", ans);
}
Submission Info
Submission Time
2017-12-02 03:09:51+0900
Task
D - Greedy customers
User
cheetose
Language
C++14 (GCC 5.4.1)
Score
700
Code Size
1557 Byte
Status
AC
Exec Time
13 ms
Memory
640 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:48:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
^
./Main.cpp:50:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
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
10 ms
640 KB
06.txt
AC
10 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
12 ms
640 KB
14.txt
AC
12 ms
640 KB
15.txt
AC
12 ms
640 KB
16.txt
AC
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
AC
11 ms
640 KB
22.txt
AC
11 ms
640 KB
23.txt
AC
10 ms
640 KB
24.txt
AC
10 ms
640 KB
25.txt
AC
10 ms
640 KB
26.txt
AC
11 ms
640 KB
27.txt
AC
11 ms
640 KB
28.txt
AC
13 ms
640 KB
29.txt
AC
9 ms
640 KB
30.txt
AC
9 ms
640 KB
31.txt
AC
9 ms
640 KB
32.txt
AC
11 ms
640 KB
33.txt
AC
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
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