QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#342957#21608. 行列式RoFtaCD#TL 0ms0kbC++14895b2024-03-01 20:08:332024-03-01 20:08:34

Judging History

你现在查看的是最新测评结果

  • [2024-03-01 20:08:34]
  • 评测
  • 测评结果:TL
  • 用时:0ms
  • 内存:0kb
  • [2024-03-01 20:08:33]
  • 提交

answer

#include <bits/stdc++.h>
#define each(i,a,b) for(int i=(a);i<=(b);++i)
#define eachr(i,a,b) for(int i=(a);i>=(b);--i)

using namespace std;
typedef long long ll;
const int N=625;

inline int rd(){
    int w=1,r=0;char c=getchar();
    while(!isdigit(c)) (c=='-')and(w=-1),c=getchar();
    while(isdigit(c)) r=r*10+(c^48),c=getchar();
    return r*w;
}
int n,p,a[N][N];

int det(){
    int res=1;
    each(i,1,n){
        each(j,i+1,n){
            while(a[i][i]){
                int d=a[j][i]/a[i][i];
                each(k,i,n) a[j][k]=(a[j][k]-1ll*d*a[i][k]%p+p)%p;
                swap(a[i],a[j]),res*=-1;
            }
            swap(a[i],a[j]),res*=-1;
        }
    }
    each(i,1,n) res=1ll*res*a[i][i]%p;
    return (res+p)%p;
}

int main(){
    n=rd(),p=rd();
    each(i,1,n) each(j,1,n) a[i][j]=rd()%p;
    printf("%d\n",det());
    return 0;
}

詳細信息

Test #1:

score: 0
Time Limit Exceeded

input:

494
507979999 844753235 308697058 577366689 725069158 935333779 504374900 25818576 590205152 640101368 622693010 938297920 872742027 301114974 734834637 556531110 842083217 975440662 921805913 100862321 393656903 213191224 795146059 30475198 812681603 711143306 28681751 642978178 605226383 94538558 ...

output:


result: