제출 #867628

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
867628		Matjaz	Languages (IOI10_languages)	C++14	0 / 100	10096 ms	10864 KiB

lang

#include <stdlib.h>
#include <stdio.h>
#include <set>
#include <vector>
#include <algorithm>

using namespace std;

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

#define SZ 100

set<int> S[56];
int L = 56;

void excerpt(int *E) {
    
    set<int> sample;
    long long a = 719;
    long long b = 479001599;
    int l = 3;
    for (int i=0;i<100 - l + 1;i++){
        int hash = 0;
        for (int j=0;j<l;j++){
            hash = (hash * a + E[i + j]) % b;
        }
        sample.insert(hash);
    }
    
    
    int best_score = 0;
    int best_guess = 0;
    
    for (int i=0;i<L;i++){
        
        set<int> intersect;
        set_intersection(sample.begin(), sample.end(), S[i].begin(), S[i].end(),
                         std::inserter(intersect, intersect.begin()));
        
        int score = intersect.size();
        
        if (best_score < score){
            best_score = score;
            best_guess = i;
        }
    }
    
    int target = language(best_guess);
    
    S[target].insert(sample.begin(), sample.end());
}

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