oj.uz

Submission #434376

# Submission time Handle Problem Language Result Execution time Memory
434376 2021-06-21T05:30:06 Z KoD Languages (IOI10_languages) C++17
101 / 100
 3909 ms 221740 KB 
#include <bits/stdc++.h>
#include "grader.h"
#include "lang.h"

constexpr int SIZE = 100;
constexpr int LANG = 56;
constexpr int LEN = 4;
constexpr int MOD = 1000003;
constexpr double COEFF[] = {1.0, 4.0, 2.0, 20.0};
int appeared[LANG][MOD];
int whole[MOD];

void excerpt(int *E) {
    double point[LANG] = {};
    unsigned long long hash[SIZE] = {};
    for (int k = 0; k < LEN; ++k) {
        for (int i = 0; i < SIZE - k; ++i) {
            hash[i] = (hash[i] << 16) ^ E[i + k];
            const int t = hash[i] % MOD;
            for (int j = 0; j < LANG; ++j) {
                if (appeared[j][t]) {
                    point[j] += COEFF[k] * appeared[j][t] / whole[t];
                }
            }
        }
    }
    const int type = language(std::max_element(point, point + LANG) - point);
    std::memset(hash, 0, sizeof(hash));
    for (int k = 0; k < LEN; ++k) {
        for (int i = 0; i < SIZE - k; ++i) {
            hash[i] = (hash[i] << 16) ^ E[i + k];
            const int t = hash[i] % MOD;
            appeared[type][t] += 1;
            whole[t] += 1;
        }
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3909 ms 221740 KB Output is correct

Subtask #2
71.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 3772 ms 221668 KB Output is correct - 92.12%