# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
21419 | gs14004 | Quaternion inverse (kriii2_Q) | C++11 | 316 ms | 2412 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>
using namespace std;
typedef long long lint;
typedef long double llf;
typedef pair<int, int> pi;
int inv[100005], mod;
vector<vector<int>> aug;
vector<int> sol;
void solve(){
vector<int> basis[4];
vector<int> sol2 = {0, 0, 0, 0};
for(int i=0; i<4; i++){
bool ok = 0;
for(int j=0; j<4; j++){
if(aug[i][j]){
if(basis[j].empty()){
basis[j] = aug[i];
sol2[j] = sol[i];
ok = 1;
break;
}
else{
int c = mod - 1ll * aug[i][j] * inv[basis[j][j]] % mod;
for(int k=0; k<4; k++){
aug[i][k] += 1ll * c * basis[j][k] % mod;
aug[i][k] %= mod;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |