# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
988908 | LilPluton | Prosjek (COCI14_prosjek) | C++14 | 1 ms | 604 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define OPT ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pii pair<int,int>
#define fi first
#define se second
#define int long long
#define vi vector<int>
#define all(a) a.begin(),a.end()
#define pb push_back
#define MAX(a,b,c) max(a,max(b,c))
#define MIN(a,b,c) min(a,min(b,c))
using namespace std;
void USACO(string filename){
freopen((filename+".in").c_str(),"r",stdin);
freopen((filename+".out").c_str(),"w",stdout);
}
struct BIT
{
int n;
vector<int> ft;
void init(int N)
{
n = N + 5;
ft.assign(n + 5, 0);
}
void add(int pos, int val)
{
for (pos = pos + 1; pos <= n; pos += pos & -pos) ft[pos] += val;
}
int get(int pos, int res = 0)
{
for (pos = pos + 1; pos > 0; pos -= pos & -pos) res += ft[pos];
return res;
}
};
struct DSU{
vector<int>par;
vector<int>sz;
int n;
DSU (int _n)
{
n = _n;
par.resize(n + 1, 0);
sz.resize(n + 1,1);
for(int i = 1; i <= n; ++i)
par[i] = i;
}
int _find(int v)
{
if(par[v] == v)
return v;
return par[v] = _find(par[v]);
}
void _union(int a, int b)
{
a = par[a];
b = par[b];
if(a != b)
{
if(sz[a] < sz[b])
swap(a,b);
par[b] = a;
sz[a] += sz[b];
}
}
};
signed main()
{
int n;
cin >> n;
vector<int>b(n),a(n), p(n);
for(int i = 0; i < n; ++i)
{
cin >> b[i];
if(i == 0)
{
a[i] = b[i];
p[i] = a[i];
}
else
{
int s = b[i] * (i + 1);
a[i] = s - p[i - 1];
p[i] = p[i - 1] + a[i];
}
}
for(int i : a)
cout << i << ' ';
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |