제출 #131306

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
131306		dragonslayerit	Languages (IOI10_languages)	C++14	0 / 100	9067 ms	262148 KiB

lang

#include <stdlib.h>
#include <stdio.h>
#include <set>
#include <map>
#include <algorithm>
#include <stdint.h>
#include <unordered_map>
#include <set>
     
#include "grader.h"
#include "lang.h"
     
#define SZ 100
     
std::unordered_map<uint64_t,int> had[56];

int seen[56];
     
void excerpt(int *E) {
  std::multiset<int> distinct;
  for(int i=0;i<100-2;i++){
    distinct.insert(uint64_t(E[i])<<24|uint64_t(E[i+1])<<16|uint64_t(E[i+2]));
  }
  double sim[56]={};
  for(int l=0;l<56;l++){
    if(!seen[l]) continue;
    for(int c:distinct){
      sim[l]+=had[l][c];
    }
    sim[l]/=(seen[l]);
  }
  int guess=std::max_element(sim,sim+56)-sim;
  int ans=language(guess);
  for(int c:distinct){
    had[ans][c]++;
  }
  seen[ans]++;
}

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