# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
150253 | Aliensoft (#200) | FunctionCup Museum (FXCUP4_museum) | C++17 | 1107 ms | 132600 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 "museum.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
vector<ll>cveta[110];
map<pair<ll,ll>,ll>used;
ll cnt=0;
void op(vector<int>&nuj)
{
for(ll i=0;i<(ll)nuj.size()-1;i++)
{
for(ll j=i+1;j<(ll)nuj.size();j++)
{
if(nuj[i]==nuj[j] && !used[make_pair(i,j)])
{
used[make_pair(i,j)]=1;
cnt++;
}
}
}
}
long long CountSimilarPairs(vector<int> B,vector<int> T,vector<int> G)
{
int N = B.size();
op(B);
op(T);
op(G);
return cnt;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |