oj.uz

Submission #252328

# Submission time Handle Problem Language Result Execution time Memory
252328 2020-07-25T09:34:49 Z SamAnd Languages (IOI10_languages) C++17
56 / 100
 2238 ms 1112 KB 
#include <bits/stdc++.h>
#include "grader.h"
#include "lang.h"
using namespace std;
const int N = 60;

const int m = 100;

map<int, int> s[N];
int ss[N];

void excerpt(int *E)
{
    double maxu = -1;
    int maxi = -1;
    for (int i = 0; i < N; ++i)
    {
        double q = 0;
        for (int j = 0; j < m; ++j)
        {
            if (s[i].find(E[j]) != s[i].end())
                q += 1;//(s[i][E[j]] / (double)(ss[i]));
        }
        if (q > maxu)
        {
            maxu = q;
            maxi = i;
        }
    }
    int u = language(maxi);
    ss[u]++;
    for (int j = 0; j < m; ++j)
    {
        s[u][E[j]]++;
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2226 ms 1112 KB Output is correct

Subtask #2
26.0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 2238 ms 1000 KB Output is partially correct - 52.92%