// M
#include<bits/stdc++.h>
#include "grader.h"
using namespace std;
typedef unsigned long long ll;
const int N = 56, K = 0, Base = 1 << 16;
int C[N];
map < ll , int > MP;
void excerpt(int * E)
{
memset(C, 0, sizeof(C));
for (int i = 0; i + K <= 100; i ++)
{
ll hsh = 0;
for (int j = i; j < i + K; j ++)
hsh = hsh * Base + E[j];
if (MP.count(hsh))
C[MP[hsh]] ++;
}
int Lang = 0;
for (int i = 0; i < N; i ++)
if (C[i] > C[Lang])
Lang = i;
Lang = language(Lang);
for (int i = 0; i + K <= 100; i ++)
{
ll hsh = 0;
for (int j = i; j < i + K; j ++)
hsh = hsh * Base + E[j];
MP[hsh] = Lang;
}
return ;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
154 ms |
360 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
151 ms |
376 KB |
Output isn't correct - 1.81% |