oj.uz

Submission #867629

# Submission time Handle Problem Language Result Execution time Memory
867629 2023-10-29T02:41:50 Z Matjaz Languages (IOI10_languages) C++14
95 / 100
 4304 ms 14636 KB 
#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) {
    
    vector<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.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:39:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |         for (int j=0;j<sample.size();j++) score += S[i].count(sample[j]);
      |                      ~^~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4304 ms 14464 KB Output is correct

Subtask #2
65.0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 4179 ms 14636 KB Output is partially correct - 86.86%