oj.uz

Submission #72339

# Submission time Handle Problem Language Result Execution time Memory
72339 2018-08-26T07:15:57 Z BBBSNG(#2263, youngyojun, sebinkim, dlalswp25) Nectar with Coconut Jelly (FXCUP3_nectar) C++17
15 / 100
 46 ms 652 KB 
#include <bits/stdc++.h>
#define rf(x) (x)=0;while(*p<48)p++;while(47<*p)(x)=((x)<<3)+((x)<<1)+(*p++&15);
//#define rf(x) (x)=0;while(*p<48)im=*p=='-';while(47<*p)(x)=((x)<<3)+((x)<<1)+(*p++&15);if(im)(x)=-(x);
#define pb push_back
#define eb emplace_back
#define sz(V) ((int)(V).size())
#define allv(V) ((V).begin()),((V).end())
#define befv(V) ((V)[(sz(V)-2)])
#define sorv(V) sort(allv(V))
#define revv(V) reverse(allv(V))
#define univ(V) (V).erase(unique(allv(V)),(V).end())
#define clv(V) (V).clear()
#define upmin(a,b) (a)=min((a),(b))
#define upmax(a,b) (a)=max((a),(b))
#define rb(x) ((x)&(-(x)))
#define cb(x) (x)=(!(x))
#define INF (0x3f3f3f3f)
#define INFLL (0x3f3f3f3f3f3f3f3fll)
#define INFST (0x7f7f7f7f)
#define INFLLST (0x7f7f7f7f7f7f7f7fll)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<ld, ld> pdd;
typedef complex<ld> base;
const ld EPS = (ld)1e-7;
const ld PI = acos(0) * 2;
bool isZero(const ld& x) { return abs(x) <= EPS; }
int sign(const ld& x) { return isZero(x) ? 0 : (0 < x ? 1 : -1); }
ll gcd(ll a, ll b) { for(;b;a%=b,swap(a,b)){} return abs(a); }
pll operator + (const pll& a, const pll& b) { return pll(a.first+b.first, a.second+b.second); }
pll operator - (const pll& a, const pll& b) { return pll(a.first-b.first, a.second-b.second); }
pll operator * (const pll& a, const ll& b) { return pll(a.first*b, a.second*b); }
ll operator * (const pll& a, const pll& b) { return a.first*b.second - b.first*a.second; }
ll ccw(const pll& a, const pll& b, const pll& c) { return a*b + b*c + c*a; }
void fg(vector<int> G[], int a, int b) { G[a].pb(b); G[b].pb(a); }
void fg(vector<pii> G[], int a, int b, int c) { G[a].pb({b, c}); G[b].pb({a, c}); }

const int MAXN = 1005;

ll A[MAXN];

int N, J, R, T;

int main() {
	cin >> N >> J >> R >> T;
	for(int i = 1; i <= N; i++) A[i] = J;

	for(int t = 1; t <= T; t++) {
		for(int i = N-1; i; i--) {
			ll x = (A[i] + R - 1) / R;
			A[i] -= x;
			A[i+1] += x;
		}
	}

	for(int i = 1; i <= N; i++)
		printf("%lld\n", A[i]);
	return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 528 KB Output is correct
6 Correct 3 ms 528 KB Output is correct
7 Correct 26 ms 588 KB Output is correct
8 Correct 40 ms 588 KB Output is correct
9 Correct 46 ms 588 KB Output is correct

Subtask #2
0 / 85.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 528 KB Output is correct
6 Correct 3 ms 528 KB Output is correct
7 Correct 26 ms 588 KB Output is correct
8 Correct 40 ms 588 KB Output is correct
9 Correct 46 ms 588 KB Output is correct
10 Runtime error 2 ms 652 KB Execution killed with signal 11 (could be triggered by violating memory limits)
11 Halted 0 ms 0 KB -