oj.uz

Submission #65809

# Submission time Handle Problem Language Result Execution time Memory
65809 2018-08-09T00:04:23 Z ho94949 Languages (IOI10_languages) C++17
66 / 100
 7718 ms 4792 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]*53)+E[i+1])&65535;
    		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]*53)+E[i+1])&65535;
    		A[res][triplet]=A[res][triplet]+1;
    	}
    	return;
    }

Compilation message

lang.cpp: In function 'void excerpt(int*)':
lang.cpp:24:54: warning: array subscript is above array bounds [-Warray-bounds]
         langcnt[j]+=(double)(*it).second/(appear[LANG]+1);
                                           ~~~~~~~~~~~^

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7718 ms 4720 KB Output is correct

Subtask #2
36.0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 7604 ms 4792 KB Output is partially correct - 61.49%