oj.uz

Submission #232584

# Submission time Handle Problem Language Result Execution time Memory
232584 2020-05-17T13:47:15 Z crossing0ver Languages (IOI10_languages) C++17
56 / 100
 545 ms 2132 KB 
#include<bits/stdc++.h>
#include "grader.h"
#include "lang.h"
using namespace std;
bool s[56][65536];
int A[56];
vector<int> G;
int vis[65536];
void excerpt(int E[]) {
	int ca = 1;
	for (int i = 0; i <= 55; i++) {
	for (int j = 0; j < 100; j++) {
		G.push_back(E[j]);
		if (s[i][E[j]] && !vis[E[j]])
			A[i]++, vis[E[j]] = 1;
		}
		for (int g:G) vis[g] = 0;
		G.clear(); 
	}
	for (int i = 0; i <= 55; i++)
		if (A[i] > A[ca]) ca = i;
	memset (A,0,sizeof A);
	int d = language(ca);
	for (int i = 0; i < 100; i++)
		s[d][E[i]]|=1;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 545 ms 2132 KB Output is correct

Subtask #2
26.0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 538 ms 2016 KB Output is partially correct - 52.82%