oj.uz

답안 #235445

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
235445 2020-05-28T09:59:49 Z dolphingarlic Languages (IOI10_languages) C++14
96 / 100
 4962 ms 94120 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("O3")
#pragma GCC target("sse4,avx2,fma,avx")
#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;

ll cnt[LANGS], bigram[SZ], trigram[SZ], quadram[SZ];
unordered_map<ll, unordered_map<int, int>> mp;

void excerpt(int *E) {
    FOR(i, 0, LANGS) cnt[i] = 0;
    FOR(i, 0, SZ - 3) {
        quadram[i] = 0;
        FOR(j, 0, 4) {
            quadram[i] = (quadram[i] << 16) + E[i + j];
        }
        trigram[i] = quadram[i] >> 16;
        bigram[i] = trigram[i] >> 16;

        if (mp[quadram[i]].size()) {
            int best = 0, sim = 0;
            for (pair<int, int> k : mp[quadram[i]]) {
                if (k.second > sim) {
                    sim = k.second;
                    best = k.first;
                }
            }
            cnt[best] += 4;
        }
        if (mp[trigram[i]].size()) {
            int best = 0, sim = 0;
            for (pair<int, int> k : mp[trigram[i]]) {
                if (k.second > sim) {
                    sim = k.second;
                    best = k.first;
                }
            }
            cnt[best] += 3;
        }
        if (mp[bigram[i]].size()) {
            int best = 0, sim = 0;
            for (pair<int, int> k : mp[bigram[i]]) {
                if (k.second > sim) {
                    sim = k.second;
                    best = k.first;
                }
            }
            cnt[best] += 2;
        }
    }

    int best = 0, sim = 0;
    FOR(i, 0, LANGS) {
        if (cnt[i] > sim) {
            sim = cnt[i];
            best = i;
        }
    }

    int ans = language(best);
    FOR(i, 0, SZ - 3) {
        mp[quadram[i]][ans]++;
        mp[trigram[i]][ans]++;
        mp[bigram[i]][ans]++;
    }
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4961 ms 94092 KB Output is correct

Subtask #2
66.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 4962 ms 94120 KB Output is partially correct - 88.06%