#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
map<int,int> exc[56][(1<<16)];
map<int,int> exc1[56];
int cnt[56]={};
void excerpt(int *E)
{
int gue=0;
vector<int> ve;
double sc[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]+=(double)exc[j][E[i]][E[i+1]];
}
for (int i=0;i<100;i++)
for (int j=0;j<56;j++)
{
if (exc1[j].find(E[i])!=exc1[j].end())
sc[j]+=(double)exc1[j][E[i]]*2;
}
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]]++;
for (int j=0;j<100;j++)
exc1[L][E[j]]++;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
6311 ms |
178060 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
6307 ms |
178444 KB |
Output isn't correct - 29.56% |
2 |
Halted |
0 ms |
0 KB |
- |