#include <bits/stdc++.h>
#include "grader.h"
#include "lang.h"
#define SZ 100
#define A 65536
#define ld long double
using namespace std;
int d[56][A];
void excerpt(int *E){
pair <int, int> mx={0,0};
for (int i=0;i<56;i++){
int cnt=0;
for (int j=0;j<SZ;j++)
cnt+=min(d[i][E[j]],1);
mx=max(mx,{cnt,i});
}
int res=language(mx.second);
for (int i=0;i<100;i++)
d[res][E[i]]++;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
166 ms |
2872 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
162 ms |
2860 KB |
Output is partially correct - 52.27% |