oj.uz

Submission #201789

# Submission time Handle Problem Language Result Execution time Memory
201789 2020-02-12T02:06:46 Z luciocf Languages (IOI10_languages) C++14
56 / 100
 3813 ms 11572 KB 
#include <bits/stdc++.h>
 
#include "grader.h"
#include "lang.h"
 
using namespace std;
 
map<int, bool> ant[60];
 
void excerpt(int *E)
{
	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 (E[j-1] >= 'A' && ant[i][E[j-1]]) 
				dist.insert(E[j-1]);
		
		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][E[i-1]] = 1;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3813 ms 11572 KB Output is correct

Subtask #2
26.0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 3751 ms 11332 KB Output is partially correct - 52.54%