# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1079342 | boris_mihov | JOIRIS (JOI16_joiris) | C++17 | 1 ms | 348 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 <unordered_map>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
#include <ctime>
#include <map>
typedef long long llong;
const int MAXN = 50 + 10;
const int INF = 1e9;
int n, k;
int a[MAXN];
int cnt[MAXN];
std::vector <std::pair <int,int>> ops;
void solve()
{
int sum = 0;
for (int i = 1 ; i <= n ; ++i)
{
sum += a[i];
}
sum %= n;
bool isOk = false;
for (int i = 1 ; i <= n ; ++i)
{
# | 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... |