oj.uz

Submission #404855

# Submission time Handle Problem Language Result Execution time Memory
404855 2021-05-15T07:08:25 Z Jasiekstrz Languages (IOI10_languages) C++17
100 / 100
 9327 ms 183900 KB 
#include<bits/stdc++.h>
#include "lang.h"
#include "grader.h"
#define fi first
#define se second
using namespace std;
const long long MOD=1e9+7,B=65537;
const int N=100;
const int K=5;
map<pair<int,long long>,set<int>> mp;
pair<int,long long> hsh(int E[],int d)
{
	long long ans=0;
	for(int i=0;i<=d;i++)
		ans=(ans*B+E[i])%MOD;
	return make_pair(d,ans);
}
vector<pair<int,long long>> all_fragments(int E[])
{
	vector<pair<int,long long>> tmp;
	for(int d=0;d<K;d++)
	{
		for(int i=0;i+d<N;i++)
			tmp.push_back(hsh(E+i,d));
	}
	return tmp;
}
void excerpt(int E[])
{
	vector<pair<int,long long>> t=all_fragments(E);
	vector<int> cnt(56,0);
	for(auto v:t)
	{
		for(auto l:mp[v])
			cnt[l]++;
	}
	int mx=0,g=0;
	for(int i=0;i<56;i++)
	{
		if(cnt[i]>mx)
		{
			mx=cnt[i];
			g=i;
		}
	}
	int lang=language(g);
	for(auto v:t)
		mp[v].insert(lang);
	return;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 9327 ms 183900 KB Output is correct

Subtask #2
70.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 9314 ms 183892 KB Output is correct - 91.01%