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 <stdlib.h>
#include <stdio.h>
#include <bits/stdc++.h>
#include "grader.h"
#include "lang.h"
#define SZ 100
using namespace std;
typedef pair<int,int> Pa;
typedef pair<int,pair<int,int> > Th;
set<int> O[60];//one element
set<Pa> D[60];
set<Th> T[60];
int ans[60],E[110];
void excerpt(int *e) {
int mx=0;
memset(ans,0,sizeof(ans));
for (int i=0;i<SZ;i++)E[i]=e[i];
for (int i=0;i<SZ;i++)
for (int j=0;j<56;j++)
if (O[j].find(E[i])!=O[j].end())ans[j]+=1;
for (int i=0;i<SZ-1;i++)
for (int j=0;j<56;j++)
if (D[j].find(make_pair(E[i],E[i+1]))!=D[j].end())ans[j]+=5;
for (int i=0;i<56;i++)
if (ans[i]>ans[mx])mx=i;
int s = language(mx);
for (int i=0;i<SZ;i++){
O[s].insert(E[i]);
D[s].insert(make_pair(E[i],E[i+1]));
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |