oj.uz

Submission #252318

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

const int m = 100;

set<int> s[N];

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

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2148 ms 6396 KB Output is correct

Subtask #2
26.0 / 80.0

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