oj.uz

Submission #44976

# Submission time Handle Problem Language Result Execution time Memory
44976 2018-04-10T09:07:06 Z junodeveloper Languages (IOI10_languages) C++14
0 / 100
 1504 ms 14916 KB 
#include "lang.h"
#include "grader.h"
#include <map>
#include <algorithm>
using namespace std;
typedef unsigned long long ll;
map<ll, int> mp[56];
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;
		int mx = 0, idx = 0;
		for(int j=0; j<56; j++)
			if(mx < mp[j][val])
			mx = mp[j][val], idx = j;
		cnt[idx] += mx;
	}
	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[ans][val]++;
	}
}

Subtask #1
0 / 30.0

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

Subtask #2
0.0 / 80.0

# Verdict Execution time Memory Grader output
1 Incorrect 1504 ms 14896 KB Output isn't correct - 6.53%