This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#include "lang.h"
#include "grader.h"
using namespace std;
int freq[56][70001], nocur[56], spac, cfreq[70001];
set<pair<int, int> > ses[56];
void excerpt(int *e) {
int exp = 0;
int sd = 0;
for(int i = 0; i < 56; i++) {
int csd = 0;
for(int j = 0; j < 100; j++) csd += freq[i][e[j]];
for(int j = 0; j < 99; j++) csd += (ses[i].find({e[j], e[j + 1]}) != ses[i].end());
if(csd > sd) sd = csd, exp = i;
}
int ca = language(exp);
for(int i = 0; i < 100; i++) freq[ca][e[i]] = 1;
for(int i = 0; i < 99; i++) ses[ca].insert({e[i], e[i + 1]});
nocur[ca]++;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |