oj.uz

Submission #201772

# Submission time Handle Problem Language Result Execution time Memory
201772 2020-02-12T01:29:12 Z luciocf Languages (IOI10_languages) C++14
39 / 100
 2523 ms 584 KB 
#include <bits/stdc++.h>
 
#include "grader.h"
#include "lang.h"
 
#define SZ 100
 
using namespace std;
 
int ant[60][110];
int lang[10010];
 
int vez;
 
void excerpt(int *E)
{
	unordered_map<int, bool> aparece;
 
	++vez;
 
	if (vez == 1)
	{
		lang[vez] = language(0);
 
		for (int i = 1; i <= 100; i++)
			ant[lang[1]][i] = E[i-1];
 
		return;
	}
 
	for (int i = 1; i <= 100; i++)
		aparece[E[i-1]] = 1;
 
	int opt = 1;
	int mx_ig = 0;
 
	for (int i = 0; i <= 55; i++)
	{
		if (ant[i][1] == 0) continue;
 
		unordered_set<int> dist;
 
		for (int j = 1; j <= 100; j++)
			if (aparece[ant[i][j]])
				dist.insert(ant[i][j]);
		
		if ((int)dist.size() > mx_ig)
			opt = i, mx_ig = (int)dist.size();
	}
 
	lang[vez] = language(opt);
 
	for (int i = 1; i <= 100; i++)
		ant[lang[vez]][i] = E[i-1];
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2375 ms 584 KB Output is correct

Subtask #2
9.0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 2523 ms 436 KB Output is partially correct - 37.52%