oj.uz

Submission #8502

# Submission time Handle Problem Language Result Execution time Memory
8502 2014-09-15T00:11:49 Z gs13023 Languages (IOI10_languages) C++
89 / 100
 3862 ms 65748 KB 
#include<cstdio>
#include<string.h>
#include"grader.h"
#include"lang.h"
#define MOD 65536
int lang_freq[60][70000];
long long lang_flow1[60][70000];
long long lang_flow2[60][70000];
long long lang_flow3[60][70000];
int did[60];
long long f1(int a,int b)
{
    return ((a<<4)^b)%MOD;
}
long long f2(int a,int b,int c)
{
    return ((a<<8)^(b<<4)^c)%MOD;
}
long long f3(int a,int b,int c,int d)
{
    return ((a<<12)^(b<<8)^(c<<4)^d)%MOD;
}
void excerpt(int *E)
{
    int ans=0;
    long long ansp=0;
    long long pos[60]={0};
    for(int i=0;i<56;i++)
    {
        for(int j=0;j<100;j++)
        {
            pos[i]+=lang_freq[i][E[j]];
            if(j>0)pos[i]+=lang_flow1[i][f1(E[j-1],E[j])]*10000;
            if(j>1)pos[i]+=lang_flow2[i][f2(E[j-2],E[j-1],E[j])]*10000001;
            if(j>2)pos[i]+=lang_flow3[i][f3(E[j-3],E[j-2],E[j-1],E[j])]*100000000;
        }
      	pos[i]/=did[i]+1;
        if(ansp<pos[i])ansp=pos[i],ans=i;
    }
    int lang=language(ans);
    for(int i=0;i<100;i++)
    {
        lang_freq[lang][E[i]]++;
        if(i>0)
        {
            lang_flow1[lang][f1(E[i-1],E[i])]++;
        }
        if(i>1)
        {
            lang_flow2[lang][f2(E[i-2],E[i-1],E[i])]++;
        }
        if(i>2)
        {
            lang_flow3[lang][f3(E[i-3],E[i-2],E[i-1],E[i])]++;
        }
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3126 ms 65748 KB Output is correct

Subtask #2
59.0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 3862 ms 65684 KB Output is partially correct - 81.47%