# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
8075 | ho94949 | Languages (IOI10_languages) | C++98 | 7250 ms | 3504 KiB |
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 <stdlib.h>
#include <stdio.h>
#include <map>
using namespace std;
#include "grader.h"
#include "lang.h"
#define SZ 100
#define LANG 56
map<unsigned int, int> A[LANG];
int appear[LANG];
void excerpt(int *E) {
double langcnt[LANG];
for(int i=0;i<LANG;i++) langcnt[i]=0;
for(int i=0;i<SZ-1;i++){
unsigned int triplet=E[i+1]<<16+E[i+2];
for(int j=0;j<LANG;j++){
map<unsigned int,int>::iterator it=A[j].find(triplet);
if(it!=A[j].end())
langcnt[j]+=(double)(*it).second/(appear[LANG]+1);
}
}
double max=0;
int maxi=0;
for(int i=0;i<LANG;i++){
if(max<langcnt[i]){
max=langcnt[i];
maxi=i;
}
}
int res=language(maxi);
appear[res]++;
for(int i=0;i<SZ-1;i++){
unsigned int triplet=E[i+1]<<16+E[i+2];
A[res][triplet]=A[res][triplet]+1;
}
return;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |