제출 #235416

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
235416		dolphingarlic	Languages (IOI10_languages)	C++14	0 / 100	10109 ms	141904 KiB

lang

#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

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

const int sz = 100, langs = 56;
const ll chr = 65535;

inline long double sq(long double X) { return X * X; }

unordered_map<ll, long double> prev_trigrams[langs];
int prev_cnt[langs];

void excerpt(int *E) {
   unordered_map<ll, long double> curr_trigrams;
   FOR(i, 2, sz) {
      curr_trigrams[(E[i - 2] << 32) + (E[i - 1] << 16) + E[i]]++;
   }
   
   int best_lang = 0;
   long double best_diff = 1e18;
   FOR(i, 0, langs) if (prev_cnt[i]) {
      long double curr_diff = 0;
      for (pair<ll, long double> j : curr_trigrams) {
         curr_diff += sq(j.second - (prev_trigrams[i][j.first] / prev_cnt[i]));
      }
      if (curr_diff < best_diff) {
         best_diff = curr_diff;
         best_lang = i;
      }
   }

   int correct = language(best_lang);
   prev_cnt[correct]++;
   for (pair<ll, long double> i : curr_trigrams) {
      prev_trigrams[correct][i.first] += i.second;
   }
}

컴파일 시 표준 에러 (stderr) 메시지

lang.cpp: In function 'void excerpt(int*)':
lang.cpp:20:34: warning: left shift count >= width of type [-Wshift-count-overflow]
       curr_trigrams[(E[i - 2] << 32) + (E[i - 1] << 16) + E[i]]++;
                                  ^~

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