oj.uz

Submission #8475

# Submission time Handle Problem Language Result Execution time Memory
8475 2014-09-14T13:55:29 Z gs13023 Languages (IOI10_languages) C++
79 / 100
 2285 ms 44764 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 f1(int a,int b)
{
	return ((a<<6)^b)%MOD;
}
long long f2(int a,int b,int c)
{
	return ((a<<12)^(b<<6)^c)%MOD;
}
void excerpt(int *E)
{
	int ans=0,ansp=0;
	int 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])]*1000;
			if(j>1)pos[i]+=lang_flow2[i][f2(E[j-2],E[j-1],E[j])]*10001;
		}
		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])]++;
		}
	}
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2285 ms 44620 KB Output is correct

Subtask #2
49.0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 2070 ms 44764 KB Output is partially correct - 73.26%