Submission #220857

#TimeUsernameProblemLanguageResultExecution timeMemory
220857t12345Languages (IOI10_languages)C++14
89 / 100
2655 ms31272 KiB
#include "grader.h" #include "lang.h" #include <map> using namespace std; typedef unsigned long long ll; ll c[60], x[105][5]; map<ll, ll> mp; void excerpt(int *E) { ll i, j, mx=0, mi=0, ans; for(i=0; i<56; i++) c[i] = x[i][0] = 0; for(i=0; i<97; i++) { for(j=1; j<=4; j++) { x[i][j] = x[i][j-1] * 65536 + E[i+j-1]; if(mp.count(x[i][j])) c[mp[x[i][j]]] += j*j; } } for(i=0; i<56; i++) { if(c[i] > mx) mx = c[i], mi = i; } ans = language(mi); for(i=0; i<97; i++) for(j=1; j<=4; j++) mp[x[i][j]] = ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...