제출 #511405

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
511405		600Mihnea	Languages (IOI10_languages)	C++17	0 / 100	10054 ms	13696 KiB

lang

#include <bits/stdc++.h>
#include "grader.h"
#include "lang.h"

using namespace std;

const int N = 100;
const int L = 56;
const int LIMIT = 1;
unordered_set<int> words[L];
int score[L];
bool first = 1;

void excerpt(int *a) {
  if (first) {
    first = 0;

  }
  for (int i = 0; i < N - 3; i++) {
    int x = a[i];
    int y = 111111111 * a[i] + a[i + 1];
    int z = (111111111 * a[i] + a[i + 1] * 111111111) + a[i + 2];
    for (int l = 0; l < L; l++) {
      score[l] += words[l].count(x);
      score[l] += words[l].count(y);
      score[l] += words[l].count(z);
    }
  }
  int highest = -1, prediction = -1;
  for (int l = 0; l < L; l++) {
    if (score[l] > highest) {
      highest = score[l];
      prediction = l;
    }
    score[l] = 0;
  }
  int solution = language(prediction);
  for (int i = 0; i < N - 3; i++) {
    int x = a[i];
    int y = 111111111 * a[i] + a[i + 1];
    int z = (111111111 * a[i] + a[i + 1] * 111111111) + a[i + 2];
    for (int l = 0; l < L; l++) {
      words[solution].insert(x);
      words[solution].insert(y);
      words[solution].insert(z);
    }
  }
}

• Subtask 1: 0 / 30
• Subtask 2: 0 / 80