# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
8075 | 2014-08-28T11:08:55 Z | ho94949 | Languages (IOI10_languages) | C++ | 7250 ms | 3504 KB |
#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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 7148 ms | 3504 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 7250 ms | 3348 KB | Output is partially correct - 36.02% |