oj.uz

Submission #291667

# Submission time Handle Problem Language Result Execution time Memory
291667 2020-09-05T15:43:36 Z tatyam Languages (IOI10_languages) C++17
38 / 100
 1732 ms 145624 KB 
#include <bits/stdc++.h>
using namespace std;

#include "grader.h"
#include "lang.h"

#define SZ 100
using u64 = uint64_t;

int prev[1100000];
#define C(n) \
auto comp ## n = [](const array<int, n>& a){ u64 ans = 0; for(int i : a){ ans <<= 16; ans |= i; } return ans; };\
unordered_map<array<int, n>, array<int, 56>, decltype(comp ## n)> c ## n(1 << 17, comp ## n)
C(1);
C(2);
C(3);
C(4);
array<int, 56> cnt;

void excerpt(int *E) {
   cnt.fill(0);
   for(int i = 0; i <= 100 - 1; i++){
      auto& c = c1[{E[i]}];
      for(int i = 0; i < 56; i++) cnt[i] += c[i];
   }
   for(int i = 0; i <= 100 - 2; i++){
      auto& c = c2[{E[i], E[i + 1]}];
      for(int i = 0; i < 56; i++) cnt[i] += c[i];
   }
   for(int i = 0; i <= 100 - 3; i++){
      auto& c = c3[{E[i], E[i + 1], E[i + 2]}];
      for(int i = 0; i < 56; i++) cnt[i] += c[i];
   }
   for(int i = 0; i <= 100 - 4; i++){
      auto& c = c4[{E[i], E[i + 1], E[i + 2], E[i + 3]}];
      for(int i = 0; i < 56; i++) cnt[i] += c[i];
   }

   int ans = language(max_element(cnt.begin(), cnt.end()) - cnt.begin());

   for(int i = 0; i <= 100 - 1; i++){
      auto& c = c1[{E[i]}];
      c[ans]++;
   }
   for(int i = 0; i <= 100 - 2; i++){
      auto& c = c2[{E[i], E[i + 1]}];
      c[ans]++;
   }
   for(int i = 0; i <= 100 - 3; i++){
      auto& c = c3[{E[i], E[i + 1], E[i + 2]}];
      c[ans]++;
   }
   for(int i = 0; i <= 100 - 4; i++){
      auto& c = c4[{E[i], E[i + 1], E[i + 2], E[i + 3]}];
      c[ans]++;
   }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1701 ms 145624 KB Output is correct

Subtask #2
8.0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 1732 ms 145608 KB Output is partially correct - 36.76%