Submission #222305

#TimeUsernameProblemLanguageResultExecution timeMemory
222305mathking1021Languages (IOI10_languages)C++11
0 / 100
337 ms6324 KiB
#include <stdlib.h> #include <stdio.h> #include "grader.h" #include "lang.h" #define SZ 100 const int M = 600; int x[66000][65]; int y[65]; int cnt = 0; void excerpt(int *E) { int mx2 = -1, mi2 = 0; for(int i = 0; i < 56; i++) y[i] = 0; for(int i = 0; i < 100; i++) { int mx = -1, mi = 0, mx2 = -1; for(int j = 0; j < 56; j++) { if(x[E[i]][j] > mx) mx = x[E[i]][j], mi = j; else if(x[E[i]][j] > mx2) mx2 = x[E[i]][j]; } y[mi] += 100 + mx - mx2; } for(int i = 0; i < 56; i++) { if(y[i] > mx2) mx2 = y[i], mi2 = i; } int k = language(mi2); for(int i = 0; i < 100; i++) { x[E[i]][k]++; } cnt++; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...