# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
437024 | model_code | Mutating DNA (IOI21_dna) | C++17 | 111 ms | 19788 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 <iostream>
#include <string>
#include <cassert>
using namespace std;
const int MAX = 4;
struct Matrix
{
int a[MAX][MAX];
Matrix()
{
for (int i=0;i<MAX;i++)
for (int j=0;j<MAX;j++)
a[i][j] = 0;
}
void add(const Matrix &o)
{
for (int i=0;i<MAX;i++)
for (int j=0;j<MAX;j++)
a[i][j] += o.a[i][j];
}
void sub(const Matrix &o)
{
for (int i=0;i<MAX;i++)
for (int j=0;j<MAX;j++)
a[i][j] -= o.a[i][j];
# | 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... |