oj.uz

Submission #632345

# Submission time Handle Problem Language Result Execution time Memory
632345 2022-08-19T21:23:48 Z ggoh Languages (IOI10_languages) C++14
0 / 100
 10000 ms 37048 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<ulint>Y[56];
void excerpt(int *E)
{
  int l=0,maxi=0;
  vector<ulint>P;
  for(int i=0;i<97;i++)
  {
    P.push_back(1llu*E[i]*(1llu<<48)+1llu*E[i+1]*(1llu<<32)+1llu*E[i+2]*(1llu<<16)+E[i+3]);
  }

  for(int i=0;i<98;i++)
  {
    P.push_back(1ll*E[i]*(1ll<<32)+1ll*E[i+1]*65536+E[i+2]);
  }
  
  for(int i=0;i<99;i++)
  {
    P.push_back(1ll*E[i]*65536+E[i+1]);
  }
  
  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;
    }
  }
  if(maxi==0)
  {
    vector<int>S;
    for(int i=0;i<100;i++)S.push_back(E[i]);
    sort(S.begin(),S.end());
    S.erase(unique(S.begin(),S.end()),S.end());
    maxi=-1;
    for(int j=0;j<56;j++)
    {
      int kind=0;
      for(auto &i:S)
      {
        if(V[j][i])kind++;
      }
      if(kind>maxi)
      {
        maxi=kind;
        l=j;
      }
    }
  }
  int L=language(l);
  for(int i=0;i<100;i++)
  {
    V[L][E[i]]++;
  }
  for(int i=0;i<99;i++)
  {
    Y[L].insert(1ll*E[i]*65536+E[i+1]);
  }
  for(int i=0;i<98;i++)
  {
    Y[L].insert(1ll*E[i]*(1ll<<32)+1ll*E[i+1]*65536+E[i+2]);
  }
  for(int i=0;i<97;i++)
  {
    Y[L].insert(1llu*E[i]*(1llu<<48)+1llu*E[i+1]*(1llu<<32)+1llu*E[i+2]*(1llu<<16)+E[i+3]); 
  }
}

Subtask #1
0 / 30.0

# Verdict Execution time Memory Grader output
1 Execution timed out 10011 ms 36284 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Execution timed out 10023 ms 37048 KB Time limit exceeded
2 Halted 0 ms 0 KB -