oj.uz

답안 #885221

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
885221 2023-12-09T09:59:18 Z mnbvcxz123 Languages (IOI10_languages) C++17
99 / 100
 7641 ms 45080 KB 
    #include <stdlib.h>
    #include <stdio.h>
    #include <set>
    #include <vector>
    #include <algorithm>
    #include <unordered_set>
    using namespace std;
     
    #include "grader.h"
    #include "lang.h"
     
    #define SZ 100
     
    unordered_set<int> S[56];
    int L = 56;
     
    void excerpt(int *E) {
        
        vector<int> sample;
        long long a = 719;
        long long b = 479001599;
        
        
        int l = 4;
        
        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;
                if (j > 0) sample.push_back(hash);
            }
        }
        
        
        
        int best_score = 0;
        int best_guess = 0;
        
        for (int i=0;i<L;i++){
            
            int score = 0;
            for (int j=0;j<sample.size();j++) score += S[i].count(sample[j]);
            
            if (best_score < score){
                best_score = score;
                best_guess = i;
            }
        }
        
        int target = language(best_guess);
        
        S[target].insert(sample.begin(), sample.end());
    }

Compilation message

lang.cpp: In function 'void excerpt(int*)':
lang.cpp:42:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |             for (int j=0;j<sample.size();j++) score += S[i].count(sample[j]);
      |                          ~^~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

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

Subtask #2
69.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 7641 ms 45080 KB Output is partially correct - 90.15%