# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
598868 | idiot123 | Mutating DNA (IOI21_dna) | C++17 | 121 ms | 13104 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>
#include "dna.h"
using namespace std;
int minSwaps(array<array<int, 3>, 3> a){
int res = 0;
int x = min(a[0][1], a[1][0]);
res += x;
a[0][1] -= x;
a[1][0] -= x;
x = min(a[0][2], a[2][0]);
res += x;
a[0][2] -= x;
a[2][0] -= x;
x = min(a[1][2], a[2][1]);
res += x;
a[1][2] -= x;
a[2][1] -= x;
if(a[0][1] + a[0][2] != a[1][0] + a[2][0] || a[1][0] + a[1][2] != a[0][1] + a[0][2] || a[2][0] + a[2][1] != a[0][2] + a[1][2])return -1;
res += 2 * (a[0][1] + a[0][2] + a[1][0] + a[1][2] + a[2][0] + a[2][1])/3;
return res;
}
class Tree{
private:
int lrSize = 2;
vector<array<array<int, 3>, 3>> v;
void update(int pos){
# | 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... |