oj.uz

Submission #914676

# Submission time Handle Problem Language Result Execution time Memory
914676 2024-01-22T14:05:06 Z abcvuitunggio Languages (IOI10_languages) C++17
97 / 100
 2182 ms 239804 KB 
#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 a[SZ][3],d[56][MOD][3];
void excerpt(int *E){
    pair <int, int> mx={0,0};
    for (int i=0;i<SZ-2;i++){
        a[i][0]=E[i];
        for (int j=1;j<3;j++)
            a[i][j]=(a[i][j-1]*A+E[i+j])%MOD;
    }
    for (int i=0;i<56;i++){
        int cnt=0;
        for (int j=0;j<SZ-2;j++)
            for (int k=0;k<3;k++)
                cnt+=min(d[i][a[j][k]][k],1<<k)*(1<<k);
        mx=max(mx,{cnt,i});
    }
    int res=language(mx.second);
    for (int i=0;i<SZ-2;i++)
        for (int j=0;j<3;j++)
            d[res][a[i][j]][j]++;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2110 ms 239576 KB Output is correct

Subtask #2
67.0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 2182 ms 239804 KB Output is partially correct - 88.83%