oj.uz

Submission #402022

# Submission time Handle Problem Language Result Execution time Memory
402022 2021-05-11T07:55:32 Z IloveN Languages (IOI10_languages) C++14
55 / 100
 278 ms 2832 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];

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

/*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 278 ms 2832 KB Output is correct

Subtask #2
25.0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 267 ms 2768 KB Output is partially correct - 51.90%