oj.uz

Submission #235903

# Submission time Handle Problem Language Result Execution time Memory
235903 2020-05-30T10:56:20 Z dolphingarlic Languages (IOI10_languages) C++14
101 / 100
 2809 ms 118516 KB 
#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
 
#include "grader.h"
 
const int SZ = 100, LANGS = 56, MOD = 539653;
 
ll si[SZ], bi[SZ], tr[SZ], qu[SZ];
double cnt[LANGS];
int freq[LANGS][MOD];
 
inline double hyperb(int x) { return x / (x + 1.1); }
 
void excerpt(int *E) {
    FOR(i, 0, SZ - 3) {
        si[i] = E[i];
        bi[i] = ((si[i] << 16) + E[i + 1]) % MOD;
        tr[i] = ((bi[i] << 16) + E[i + 2]) % MOD;
        qu[i] = ((tr[i] << 16) + E[i + 3]) % MOD;
    }
 
    int best = 0;
    double best_sim = 0;
    FOR(i, 0, LANGS) {
        double sim = 0;
        FOR(j, 0, SZ - 3) {
            sim += hyperb(freq[i][qu[j]]) * 135;
            sim += hyperb(freq[i][tr[j]]) * 55;
            sim += hyperb(freq[i][bi[j]]) * 95;
            sim += hyperb(freq[i][si[j]]) * 9;
        }
        sim /= log(cnt[i] + 2);
 
        if (sim > best_sim) best = i, best_sim = sim;
    }
 
    int ans = language(best);
    cnt[ans]++;
    FOR(i, 0, SZ - 3) {
        freq[ans][qu[i]]++;
        freq[ans][tr[i]]++;
        freq[ans][bi[i]]++;
        freq[ans][si[i]]++;
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2575 ms 118516 KB Output is correct

Subtask #2
71.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 2809 ms 118448 KB Output is correct - 92.69%