oj.uz

Submission #44982

# Submission time Handle Problem Language Result Execution time Memory
44982 2018-04-10T09:38:11 Z junodeveloper Languages (IOI10_languages) C++14
0 / 100
 387 ms 608 KB 
#include "lang.h"
#include "grader.h"
#include <map>
#include <algorithm>
using namespace std;
typedef unsigned long long ll;
map<ll, int> mp;
ll cnt[56] = {0};
void excerpt(int* a) {
	for(int i=0; i<56; i++) cnt[i] = 0;
	for(int i=0; i<97; i++) {
		ll val = 0;
		for(int j=0; j<4; j++)
			val = val * 65535 + a[i] - 1;
		if(mp.count(val)) cnt[mp[val]]++;
	}
	int ret = max_element(cnt, cnt+56) - cnt;
	int ans = language(ret);
	for(int i=0; i<97; i++) {
		ll val = 0;
		for(int j=0; j<4; j++)
			val = val * 65535 + a[i] - 1;
		mp[val] = ans;
	}
}

Subtask #1
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 387 ms 608 KB Output isn't correct

Subtask #2
0.0 / 80.0

# Verdict Execution time Memory Grader output
1 Incorrect 364 ms 600 KB Output isn't correct - 23.65%