제출 #760485

#제출 시각아이디문제언어결과실행 시간메모리
760485SanguineChameleonLanguages (IOI10_languages)C++17
0 / 100
2005 ms262144 KiB
#include <stdlib.h>
#include <stdio.h>

#include "grader.h"
#include "lang.h"

#define SZ 100

#include <bits/stdc++.h>
using namespace std;

unordered_map<long long, int> cnt[56][4];
long long score[56];
int weight[4];

void excerpt(int *E) {
	weight[0] = 1;
	weight[1] = 0;
	weight[2] = 0;
	weight[3] = 1;
	for (int i = 0; i < 56; i++) {
		score[i] = 0;
	}
	for (int len = 1; len <= 4; len++) {
		for (int i = 0; i < 101 - len; i++) {
			unsigned long long h = 0;
			for (int j = 0; j < len; j++) {
				h = h << 16 | E[i + j];
			}
			if (len == 1 || len == 4) {
				for (int j = 0; j < 56; j++) {
					score[j] += cnt[j][len - 1][h] * weight[len - 1];
				}
			}
		}
	}
	pair<long long, int> best = make_pair(-1, -1);
	for (int i = 0; i < 56; i++) {
		best = max(best, make_pair(score[i], i));
	}
	int id = language(best.second);
	for (int len = 1; len <= 4; len++) {
		for (int i = 0; i < 101 - len; i++) {
			unsigned long long h = 0;
			for (int j = 0; j < len; j++) {
				h = h << 16 | E[i + j];
			}
			if (len == 1 || len == 4) {
				cnt[id][len - 1][h]++;
			}
		}
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...