Submission #358527

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
358527	2021-01-25T16:58:25 Z	idk321	Languages (IOI10_languages)	C++11	0 / 100	10000 ms	4756 KB

lang

#include <stdlib.h>
#include <stdio.h>

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

#define SZ 100

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

unordered_map<int, ll> freq [56];
bool vis[56];
int c = 0;

void excerpt(int *E) {
    unordered_map<int, ll> cfreq;
   for (int i = 0; i < 100; i++)
   {
        cfreq[E[i]]++;
   }

   ll best = -1;
   ll bscore = -1;
   ll factor = 1000000000;
   for (int i = 0; i < 56; i++)
   {
        double score = 0;
        for (auto it = freq[i].begin(); it != freq[i].end(); it++)
        {
            if (it->second != 0 && cfreq[it->first] != 0)
            {
                 score += factor;
                 score -= abs(it->second - cfreq[it->first]) * (factor) / 10;
            }
        }
        if (score >  bscore)
        {
            best = i;
            bscore = score;
        }
   }

   int actual = language(best);

   if (!vis[actual])
   {
        vis[actual] = true;
        freq[actual] = cfreq;
   } else
   {
        unordered_map<int, ll> nfreq;
        for (auto it = freq[actual].begin(); it != freq[actual].end(); it++)
        {
            nfreq[it->first] = (it-> second + cfreq[it->first]) / 2;
        }
        for (auto it = cfreq.begin(); it != cfreq.end(); it++)
        {
            nfreq[it->first] = (it-> second + freq[actual][it->first]) / 2;
        }
        freq[actual] = nfreq;
   }

   c++;
}

Subtask #1

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	10057 ms	4756 KB	Time limit exceeded

Subtask #2

0 / 80.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	10010 ms	4604 KB	Time limit exceeded