# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
347084 | andrii | Gift (IZhO18_nicegift) | C++14 | 2115 ms | 345164 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 pll pair<ll, ll>
#define x first
#define y second
using namespace std;
typedef long long ll;
const ll N = 1e6+228;
const ll inf = 0x3fff3fff3fff3fff;
pll a[N];
vector<pair<ll, vector<ll>>> qrs;
ll us[N];
signed main(){
cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
ll n, k, sai=0;
cin >> n >> k;
for(ll i = 0;i<n;i++){
cin >> a[i].x;
a[i].y=i;
sai+=a[i].x;
}
sort(a, a+n, greater<pll>());
if(a[0].x==a[n-1].x){
//cout<<qrs.size()<<'\n';
ll lcm = (n*k)/__gcd(n, k);
ll c = lcm/n;
ll tt = sai/(c*n);
for(ll i = 0;i<n;i++) a[i].x/=tt;
set<pll, greater<pll>> allow;
for(ll i = 0;i<n;i++) allow.insert({a[i].x, i});
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... |