# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
95838 | caesar2001 | Genetics (BOI18_genetics) | C++11 | 2131 ms | 791932 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 ll long long
#define lsb(x) (x & -x)
using namespace std;
inline void transpune(const vector<vector<ll>> &v, vector<vector<ll>> &ans, int n, int m) {
for(int i = 1; i <= n; i ++)
for(int j = 1; j <= m; j ++)
ans[j][i] = v[i][j];
}
inline void multiply(const vector<vector<ll>> &a, const vector<ll> &b, vector<ll> &ans, int n, int m) {
for(int i = 1; i <= n; i ++)
for(int k = 1; k <= m; k ++)
ans[i] += (a[i][k] * b[k]);
}
inline void add(vector<ll> &ans, const vector<ll> &a, int n) {
for(int i = 1; i <= n; i ++)
ans[i] += a[i];
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
//freopen("a.in", "r", stdin);
//freopen("a.out", "w", stdout);
# | 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... |