oj.uz

Submission #270966

# Submission time Handle Problem Language Result Execution time Memory
270966 2020-08-18T04:18:21 Z TMJN Languages (IOI10_languages) C++17
55 / 100
 2981 ms 12128 KB 
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;

int k[56][66666];
map<long long,vector<int>>mpv;
int C[56];

void excerpt(int *E) {
	pair<double,int>mx={0,0};
	int c[56];
	for(int i=0;i<56;i++){
		c[i]=0;
	}
	for(int i=0;i<100;i++){
		for(int j=0;j<56;j++){
			c[j]+=k[j][E[i]];
		}
	}
	for(int i=0;i<99;i++){
		for(int j:mpv[E[i]*66666+E[i+1]]){
			c[j]+=10;
		}
	}
	for(int i=0;i<56;i++){
		if(C[i]==0)continue;
		mx=max(mx,{(double)c[i]/C[i],i});
	}
	int l=language(mx.second);
	C[l]++;
	for(int i=0;i<100;i++){
		k[l][E[i]]++;
	}
	for(int i=0;i<99;i++){
		mpv[E[i]*66666+E[i+1]].push_back(l);
	}
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2943 ms 12096 KB Output is correct

Subtask #2
25.0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 2981 ms 12128 KB Output is partially correct - 52.19%