# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
84941 | ToadDaveski | Gift (IZhO18_nicegift) | C++11 | 882 ms | 94084 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.
#include <bits/stdc++.h>
#define ll long long
#define fr first
#define sc second
using namespace std;
vector <vector <pair <ll,ll> > > q;
ll a[2000001];
map <ll,ll> poz;
vector <ll> ans;
int main()
{
//ios_base::sync_with_stdio(0);
ll n,k,i,j,ma=0;
cin>>n>>k;
ll sum=0,part;
for(i=1;i<=n;i++)
{
scanf("%lld", a + i);
sum+=a[i];
ma=max(ma,a[i]);
}
part=sum/k;
if (sum%k || part<ma )
{
cout<<-1;
return 0;
}
sum=0;
vector <pair <ll,ll> > temp;
temp.clear();
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |