Submission #1327022

#	Time	Username	Problem	Language	Result	Execution time	Memory
1327022		windowwife	Languages (IOI10_languages)	C++20	0 / 100	2 ms	824 KiB

lang

#ifndef rtgsp
#include "grader.h"
#endif // rtgsp

#ifdef rtgsp
int language (int L)
{
    return L;
}
#endif // rtgsp

#include<bits/stdc++.h>
#define ll long long
#define task ""
using namespace std;
const int maxn = 1e6 + 2, mod = 999983;
int n, cnt[56][mod], ok[4][maxn], p[4] = {8, 3, 8, 6};

void excerpt (int* E)
{
    for (int j = 1; j <= 4; j++)
    {
        for (int i = 0; i < 100 - j + 1; i++)
        {
            ll h = 0;
            for (int k = i; k < i + j; k++)
            {
                h = (h * 65536 + E[k]) % mod;
            }
            ok[i][j - 1] = h;
        }
    }
    pair<ll, int> ans = {0, -1};
    for (int l = 0; l < 56; l++)
    {
        ll cur = 0;
        for (int j = 0; j < 4; j++)
        {
            for (int i = 0; i < 100 - j; i++)
            {
                cur += cnt[l][ok[i][j]] * p[j];
            }
        }
        ans = max(ans, make_pair(cur, l));
    }
    int res = language(ans.second);
    for (int j = 0; j < 4; j++)
        for (int i = 0; i < 100 - j; i++)
            ++cnt[res][ok[i][j]];
}

#ifdef rtgsp
int main()
{
    //freopen(task".INP", "r", stdin);
    //freopen(task".OUT", "w", stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

}
#endif // rtgsp

• Subtask 1: 0 / 30
• Subtask 2: 0 / 70