oj.uz

Submission #222298

# Submission time Handle Problem Language Result Execution time Memory
222298 2020-04-13T02:44:15 Z mathking1021 Languages (IOI10_languages) C++11
34 / 100
 280 ms 6348 KB 
#include <stdlib.h>
#include <stdio.h>

#include "grader.h"
#include "lang.h"

#define SZ 100

const int M = 0;
int x[66000][65];
int y[65];

void excerpt(int *E)
{
    int mx2 = -1, mi2 = 0;
    for(int i = 0; i < 56; i++) y[i] = 0;
    for(int i = 0; i < 100; i++)
    {
        int mx = -1, mi = 0, mx2 = -1;
        for(int j = 0; j < 56; j++)
        {
            if(x[E[i]][j] > mx) mx = x[E[i]][j], mi = j;
            else if(x[E[i]][j] > mx2) mx2 = x[E[i]][j];
        }
        if(mx - mx2 > M) y[mi]++;
    }
    for(int i = 0; i < 56; i++)
    {
        if(y[i] > mx2) mx2 = y[i], mi2 = i;
    }
    int k = language(mi2);
    for(int i = 0; i < 100; i++)
    {
        x[E[i]][k]++;
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 280 ms 6348 KB Output is correct

Subtask #2
4.0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 265 ms 6296 KB Output is partially correct - 33.67%