oj.uz

Submission #914733

# Submission time Handle Problem Language Result Execution time Memory
914733 2024-01-22T15:32:19 Z abcvuitunggio Languages (IOI10_languages) C++17
99 / 100
 3692 ms 100808 KB 
#include <bits/stdc++.h>
#include "grader.h"
#include "lang.h"
#define MOD 458047
using namespace std;
int a[97][4],d[56][MOD],p[4]={1,7,2,9};
void excerpt(int *E){
    pair <int, int> mx={0,0};
    for (int i=0;i<97;i++){
        a[i][0]=E[i];
        for (int j=1;j<4;j++)
            a[i][j]=(a[i][j-1]*65536LL+E[i+j])%MOD;
    }
    for (int i=0;i<56;i++){
        int cnt=0;
        for (int j=0;j<97;j++)
            for (int k=0;k<4;k++)
                cnt+=min(d[i][a[j][k]],k)*p[k];
        mx=max(mx,{cnt,i});
    }
    int res=language(mx.second);
    for (int i=0;i<97;i++)
        for (int j=0;j<4;j++)
            d[res][a[i][j]]++;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3692 ms 100808 KB Output is correct

Subtask #2
69.0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 3652 ms 100744 KB Output is partially correct - 90.93%