oj.uz

Submission #632361

# Submission time Handle Problem Language Result Execution time Memory
632361 2022-08-19T21:49:19 Z ggoh Languages (IOI10_languages) C++14
96 / 100
 9753 ms 19724 KB 
#include<bits/stdc++.h>
#include "grader.h"
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
int V[56][65536];
set<lint>Y[56];
void excerpt(int *E)
{
  int l=0,maxi=-1;
  vector<lint>P;
  for(int k=0;k<3;k++)
  {
    for(int i=0;i+k<100;i++)
    {
      lint h=0;
      for(int j=0;j<=k;j++)
      {
        h=h*65537+E[i+j];
      }
      P.push_back(h);
    }
  }
  sort(P.begin(),P.end());
  P.erase(unique(P.begin(),P.end()),P.end());
  for(int j=0;j<56;j++)
  {
    int kind=0;
    for(auto &i:P)
    {
      if(Y[j].find(i)!=Y[j].end())kind++;
    }
    if(kind>maxi)
    {
      maxi=kind;
      l=j;
    }
  }

  int L=language(l);
  for(int k=0;k<3;k++)
  {
    for(int i=0;i+k<100;i++)
    {
      lint h=0;
      for(int j=0;j<=k;j++)
      {
        h=h*65537+E[i+j];
      }
      Y[L].insert(h);
    }
  }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 9753 ms 19724 KB Output is correct

Subtask #2
66.0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 9303 ms 19688 KB Output is partially correct - 87.74%