# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
385603 | patrikpavic2 | Gift (IZhO18_nicegift) | C++17 | 1253 ms | 94620 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 <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#include <set>
#define X first
#define Y second
#define PB push_back
using namespace std;
const int N = 2e6 + 500;
typedef long long ll;
int n, k;
ll sm, A[N];
vector < pair < ll, int > > swp;
vector < ll > kv;
int main(){
scanf("%d%d", &n, &k);
for(int i = 1;i <= n;i++){
scanf("%lld", A + i);
sm += A[i];
}
if(sm % k != 0){
printf("-1\n");
return 0;
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... |