oj.uz

Submission #201782

# Submission time Handle Problem Language Result Execution time Memory
201782 2020-02-12T01:50:02 Z luciocf Languages (IOI10_languages) C++14
39 / 100
 2339 ms 480 KB 
#include <bits/stdc++.h>
 
#include "grader.h"
#include "lang.h"
 
using namespace std;
 
int ant[60][110];
 
void excerpt(int *E)
{
	map<int, int> aparece;
 
	for (int i = 1; i <= 100; i++)
		aparece[E[i-1]] = 1;
 
	int opt = 0;
	int mx_ig = 0;
 
	for (int i = 0; i <= 55; i++)
	{
		set<int> dist;
 
		for (int j = 1; j <= 100; j++)
			if (aparece.find(ant[i][j]) != aparece.end()) 
				dist.insert(ant[i][j]);
		
		if ((int)dist.size() > mx_ig)
			opt = i, mx_ig = (int)dist.size();
	}
  
    int x = language(opt);
 
	for (int i = 1; i <= 100; i++)
		ant[x][i] = E[i-1];
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2273 ms 480 KB Output is correct

Subtask #2
9.0 / 80.0

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