oj.uz

Submission #402024

# Submission time Handle Problem Language Result Execution time Memory
402024 2021-05-11T08:01:23 Z IloveN Languages (IOI10_languages) C++14
59 / 100
 380 ms 5616 KB 
#include<bits/stdc++.h>
#include "grader.h"
using namespace std;
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define all(vr) vr.begin(),vr.end()
#define vi vector<int>
#define vll vector<ll>
const int N = 1e5 + 10;

int in[60][N], cnt[60][N];

void excerpt(int E[])
{
    set<int> st;
    for (int i = 0; i < 100; ++i) st.insert(E[i]);
    int id = 0;
    pii mx = mp(-1, -1);
    for (int i = 0; i <= 55; ++i)
    {
        pii score = mp(0, 0);
        for (int x : st) score.fi += in[i][x];
        for (int j = 0; j < 100; ++j) score.se += cnt[i][E[j]];
        if (score > mx) id = i, mx = score;
    }
    id = language(id);
    for (int x : st) in[id][x] = 1;
    for (int i = 0; i < 100; ++i) cnt[id][E[i]]++;
}

/*int main()
{
    //freopen("ss.inp", "r", stdin);
    ios::sync_with_stdio(false);
    cin.tie(0);
    return 0;
}*/

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 380 ms 5616 KB Output is correct

Subtask #2
29.0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 352 ms 5460 KB Output is partially correct - 55.69%