Submission #148528

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
1485282019-09-01 04:36:36rkm0959 (#200)FunctionCup Museum (FXCUP4_museum)C++17
100 / 100
110 ms18564 KiB
#include <bits/stdc++.h>
#define L long long
using namespace std;
int n;
int a[7][200020];
L cnt[1000010];
L CountSimilarPairs(vector<int>B, vector<int>T, vector<int> G){
int i,j;
L ret=0;
n=B.size();
for(i=0;i<n;i++)
{
B[i]--;
T[i]--;
G[i]--;
a[0][i]=B[i];
a[1][i]=T[i];
a[2][i]=G[i];
a[3][i]=B[i]*10000+T[i]*100+G[i];
a[4][i]=B[i]*100+T[i];
a[5][i]=T[i]*100+G[i];
a[6][i]=G[i]*100+B[i];
}
for(i=0;i<7;i++)
{
for(j=0;j<n;j++)
{
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...