# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
273968 | AKaan37 | Fishing Game (RMI19_fishing) | C++17 | 3 ms | 512 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.
//Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< lo,lo > PII;
#define int long long
#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n*2;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;
int n,m,b[li],a[li],k,flag,t;
int cev;
string s;
vector<int> v;
inline int mul(int x,int y){
return (x%mod)*(y%mod)%mod;
}
main(void){
scanf("%lld %lld",&n,&t);
while(t--){
cev=n*3;
FOR{
scanf("%lld",&a[i]);
}
FOR{
for(int j=1;j<i;j++){
if(a[j]==a[i])cev--;
}
}
FOR{
scanf("%lld",&a[i]);
}
FOR{
for(int j=1;j<i;j++){
if(a[j]==a[i])cev--;
}
}
FOR{
scanf("%lld",&a[i]);
}
FOR{
for(int j=1;j<i;j++){
if(a[j]==a[i])cev--;
}
}
int cev1=1;
while(cev){
cev1=mul(cev1,cev);
cev--;
}
printf("%lld\n",cev1);
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |