#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
map<int,int> exc[56][(1<<16)];
void excerpt(int *E)
{
int gue=0;
vector<int> ve;
int sc[56]={};
// int cnt[56]={};
for (int i=0;i<99;i++)
{
for (int j=0;j<56;j++)
if (exc[j][E[i]].find(E[i+1])!=exc[j][E[i]].end())
sc[j]+=exc[j][E[i]][E[i+1]];
}
for (int i=0;i<56;i++)
if (sc[i]>sc[gue])
gue=i;
int L=language(gue);
// cnt[L]++;
for (int j=0;j<99;j++)
exc[L][E[j]][E[j+1]]++;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3589 ms |
177416 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
3530 ms |
177328 KB |
Output is partially correct - 61.52% |