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 <bits/stdc++.h>
#include "grader.h"
#include "lang.h"
#define SZ 100
#define A 65536LL
#define ld long double
#define MOD 458047
using namespace std;
int g,G,a[SZ][4],d[56][MOD],p[4]={1,5,1,10},c[56];
void excerpt(int *E){
pair <int, int> mx={0,0};
for (int i=0;i<SZ-3;i++){
if (G)
a[i][0]=E[i];
for (int j=1;j<4;j++)
a[i][j]=((j?a[i][j-1]:E[i])*A+E[i+j])%MOD;
}
for (int i=0;i<56;i++){
int cnt=0;
for (int j=0;j<SZ-3;j++)
for (int k=0;k<4;k++)
cnt+=min(d[i][a[j][k]],p[k])*p[k];
mx=max(mx,{cnt,i});
}
int res=language(mx.second);
c[res]++;
for (int i=0;i<SZ-3;i++)
for (int j=0;j<4;j++)
d[res][a[i][j]]++;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |